Abstract
In this paper we concentrate on job shop scheduling as a representative of constrained combinatorial problems. We introduce a new permutation representation for this problem. Three crossover operators, different in tending to preserve the relative order, the absolute order, and the position in the permutation, are defined. By experiment we observe the strongest phenotypical correlation between parents and offspring when respecting the absolute order. It is shown that a genetic algorithm using an operator which preserves the absolute order also obtains a superior solution quality.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bierwirth, C. (1995): A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. OR Spektrum, vol.17, 87–92
Kargupta, H., Kalyanmoy, D., Goldberg, D. E. (1992): Ordering Genetic Algorithms and Deception. In: Männer, R., Manderick, B. (eds.): Parallel Problem Solving from Nature II, North Holland, Amsterdam, 47–56
Manderick, B., De Weger, M., Spiessens, P. (1991): The Genetic Algorithm and the Structure of the Fitness Landscape. In: Belew, R. K., Booker, L. B. (eds.): Proc. of the 4th Int. Conf. on Genetic Algorithms. Morgan Kauffman Publishers, San Mateo CA, 143–150
Mattfeld, D. C. (1996): Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling, Physica Verlag, Heidelberg
Nakano, R., Yamada, T. (1991): Conventional Genetic Algorithm for Job Shop Problems. In: Belew, R. K., Booker, L. B. (eds.): Proc. of the 4th Int. Conf. on Genetic Algorithms. Morgan Kauffman Publishers, San Mateo CA, 474–479
Oliver, L. M., Smith, D. J., Holland, J. R. C. (1987): A Study of Permutation Crossover Operators on the Traveling Salesman Problem. In: Grefenstette, J. J. (ed.): Proc. of the 2nd Int. Conf. on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale NJ, 224–230
Reeves, C. R. (1993): Modern Heuristic Techniques for Combinatorial Problems. Black-well Scientific Publications, Oxford
Storer, R., Wu, D., Vaccari, R. (1992): New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Management Science, vol. 38, 1495–1509.
Syswerda, G. (1991): Schedule Optimization Using Genetic Algorithms. In: Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, NY, 332–349
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bierwirth, C., Mattfeld, D.C., Kopfer, H. (1996). On permutation representations for scheduling problems. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_995
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_995
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive