scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

We address the problem of optimizing a spacecraft trajectory by using three different multi-objective evolutionary algorithms: i) Non-dominated sorting genetic algorithm, ii) Pareto-based ranking genetic algorithm, and iii) Strength Pareto genetic algorithm. The trajectory of interest is an orbit transfer around a central body when the spacecraft uses a lowthrust propulsion system. We use a Lya...

today the domain of competition in production and operation has been changed to supply chains for independent firms. in this problem material flow is very important among three flows, financial, information and materials. traditional approach is dominated in supply, production and distribution planning at most iranian industrial cooperation. it means that each of these unit are planning their a...

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

In this paper, we discuss about various applications of Non-dominated Sorting Genetic Algorithm. Six papers are taken for survey. Its advantages and disadvantages are discussed.