Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems

Expert Systems with Applications

Volumn 33, Issue 3, 2007, Pages 762-771

  Chang, Pei Chann ^a   Chen, Shih Hsin ^a   Liu, Chen Hao ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithms; Minging gene structures; Multiobjective optimization; Pareto optimum solution; Scheduling problem

Indexed keywords

CHROMOSOMES; GENES; MULTIOBJECTIVE OPTIMIZATION; PARETO PRINCIPLE; PROBLEM SOLVING; SCHEDULING;

MINGING GENE STRUCTURES; MULTIOBJECTIVE SCHEDULING PROBLEMS; PARETO OPTIMUM SOLUTION; SUB POPULATION GENETIC ALGORITHM (SPGA);

GENETIC ALGORITHMS;

EID: 33847658312     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2006.06.019     Document Type: Article

References (27)

1. Affenzeller M. New generic hybrids based upon genetic algorithms. Lecture Notes in Computer Science 2527 (2002) 329-339
2. Chang P.C., Wang Y.W., and Liu C.H. New operators for faster convergence and better solution quality in modified genetic algorithm. Lecture Notes in Computer Science 3611 (2005) 983-991
3. Chang P.C., Chen S.H., and Lin K.L. Two phase sub-population genetic algorithm for parallel machine scheduling problem. Expert Systems with Applications 29 3 (2005) 705-712
4. Cochran J.K., Horng S.M., and Fowler J.W. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research 30 (2003) 1087-1102
5. Coello C.A., Pulido G.T., and Lechuga M.S. Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation 8 3 (2004) 256-279
6. Davis L. Handbook of genetic algorithm (1991), Van Nostrand Reinhold, New York
7. Deb K., Amrit P., Sameer A., and Meyarivan T. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6 2 (2002) 182-197
8. Fox B.R., and McMahon M.B. Genetic operators for sequencing problems. In: Raolins G.J.E. (Ed). Foundations of genetic algorithms (1991), Morgan Kaufman Publishers, San Marco 284-300
9. Goldberg D.E. Genetic algorithms in search, optimization and machine learning (1989), Addison-Wesley, Reading, MA
10. Holland J.H. Adoption in natural and artificial systems (1975), The University of Michigan Press, Ann Arbor
11. Hu J., Goodman E., Seo K., Fan Z., and Rosenberg R. The hierarchical fair competition framework for sustainable evolutionary algorithms. Evolutionary Computation 13 2 (2005) 241-277
12. Ishibuchi H., Yamamoto N., Murata T., and Tanaka H. Genetic algorithms and neighbourhood search algorithms for fuzzy & flowshop scheduling problems. Fuzzy Sets and Systems 67 (1994) 81-100
13. Ishibuchi H., Yoshida T., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7 2 (2003) 204-223
14. Jog, J., Suh, Y., & Gucht, D. V. (1989). The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem. In Proceedings of the Third IGCA, San Mateo (pp. 110-115).
15. Knowles J.D., and Corne D.W. On metrics for comparing non-dominated sets. Proceedings of the 2002 congress on evolutionary computation conference (CEC02) (2002), IEEE Press, New York 711-716
16. Lis, J., & Eiben, A. E. (1997). A multisexual genetic algorithm for multicriteria optimization. In Proceedings of the 4th IEEE conference on evolutionary computation (pp. 59-64).
17. Mostaghim S., and Teich J. Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization. Evolutionary Computation 2 (2004) 1404-1411
18. max flowshop problem. Computers and Operations Research 17 (1990) 243-253
19. Osman I.H., and Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA 17 (1989) 551-557
20. Reeves C.R. Genetic algorithm for flowshop sequencing. Computers and Operations Research 15 (1995) 5-23
21. Schaffer, J. D. (1985). Multiple objective optimizations with vector evaluated genetic algorithms. In Proceedings of 1st international conference on genetic algorithms (pp. 93-100).
22. Starkweather, T., McDaniel, S., Whitley, C., Mathias, K., & Whitley, D. (1991). A comparison of genetic sequencing operators. In Proceedings of Fourth IGCA (pp. 69-76).
23. Taillard E. Some efficient heuristics methods for flow-shop sequencing problem. European Journal of Operations Research 47 (1991) 65-74
24. Ulder N.L.J. Genetic local search algorithms for the travelling salesman problem. In: Schwefel H.P., and Manner R. (Eds). Parallel problem solving for nature (1991), Springer, Berlin 109-116
25. Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland.
26. Zitzler, E., Laumanns, M., & Bleuler, S. (2004). A tutorial on evolutionary multiobjective optimization. In Proceedings of the workshop on multiple objective metaheuristics.
27. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271