Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

A Comparative Study of Precedence-Preserving Genetic Operators in Sequential Ordering Problems and Job Shop Scheduling Problems

서열 순서화 문제와 Job Shop 문제에 대한 선행관계유지 유전 연산자의 비교

  • Lee, Hye-Ree (School of Electric and Computer Engineering and RICIC, Chungbuk National University and AITrc) ;
  • Lee, Keon-Myung (School of Electric and Computer Engineering and RICIC, Chungbuk National University and AITrc)
  • Published : 2004.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

Genetic algorithms have been successfully applied to various optimization problems belonging to NP-hard problems. The sequential ordering problems(SOP) and the job shop scheduling problems(JSP) are well-known NP-hard problems with strong influence on industrial applications. Both problems share some common properties in that they have some imposed precedence constraints. When genetic algorithms are applied to this kind of problems, it is desirable for genetic operators to be designed to produce chromosomes satisfying the imposed precedence constraints. Several genetic operators applicable to such problems have been proposed. We call such genetic operators precedence-preserving genetic operators. This paper presents three existing precedence-preserving genetic operators: Precedence -Preserving Crossover(PPX), Precedence-preserving Order-based Crossover (POX), and Maximum Partial Order! Arbitrary Insertion (MPO/AI). In addition, it proposes two new operators named Precedence-Preserving Edge Recombination (PPER) and Multiple Selection Precedence-preserving Order-based Crossover (MSPOX) applicable to such problems. It compares the performance of these genetic operators for SOP and JSP in the perspective of their solution quality and execution time.

Keywords

References

  1. L. Gambardella, M. Dorigo, "HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem", Technical Report IDSIA 11-97, Lugano, Switzerland, 1997.
  2. K.M. Lee, T. Yamakawa, K.-M. Lee, "A Genetic Algorithm for General Machine Scheduling Problems", Proceedings of Int. Conf. on Conventional and Knowledge-based Electronics Systems(KES'98), Australia, pp.62-65, 1998.
  3. S. Chen, S. Smith, "Commonality and Genetic Algorithms", CMU-RI-TR-96-27, 1996.
  4. J. Carlier, E. Pinson, "An Algorithm for Solving the Job Shop Problem", Management Science, Vol.35, No.2, pp.164-176, 1989. https://doi.org/10.1287/mnsc.35.2.164
  5. J. Adams, E. Balas, D. Zawack, "The Shift Bottlenck Procedure for Job Shop Scheduling", Management Science, Vol.34, No.3, pp.389-401, 1988.
  6. P.J.M.V. Larrhoven, E.H.L. Aarts, J.K. Lnestra, "Job Shop Scheduling by Simmulated Annealing", Operation Research, Vol.40, No.1, pp.113-125, 1992. https://doi.org/10.1287/opre.40.1.113
  7. R. Namano, T.Yamada, "Conventional Genetic Algorithm for Job Shop Problems", Proc. of the 4th Int. Conf. on Genetic Algorithms, pp.474-479, 1991.
  8. T. Yamada, R. Nakano, "A Genetic Algorithm Application to Large-scale Job Shop Problems", Proc. of the 5th Int. Conf. on Parallel Problem Solving from Nature, pp.281-290, 1992.
  9. D. Whitley, T. Starkweather, D. Fuquary, "Scheduling Problem and Traveling Salesman Problem : The Genetic Edge Recombination Operator", Proc. of the 3rd Int. Conf. on Genetic Algorithm, Margan Kaufman Publishers, pp.133-139, 1989.
  10. J. Holland, Adaptation in Neural and Arficial Systems, Ann Habor : Univesity of Michigan Press, 1975.
  11. D. Whitley, "GENETOR: A Different Genetic Algorithm", Proc. of Rocky Mountain Conference on Artificial Intelligence, 1988.
  12. http://www.iwr.uni-heidelberg.de/iwr/com-opt/soft/TSPLIB95/sop.
  13. J. F. Muth, G.L. Thompson, Industrial Scheduling, Prentice Hall, Engleweed Cliffs, New Jersey, 1963.
  14. K.M. Lee, T. Yamakawa, K.-M. Lee, A Genetic Algorithm for Traveling Salesman Problem with Precedence Constraints, Proc. of EUFIT'97, Aachen, Germany, pp.809-813, 1997
  15. M. Mitchell, An Introduction to Genetic Algorithms, 208p, The MIT Press, 1998.