Abstract
In this paper we present two new crossover operators that make use of macro-order information and neighborhood information in sequencing problems. None of them needs local information, thus making them usable for a wide area of applications, e.g., optimal variable orders for binary decision diagrams, scheduling problems, seriation in archeology. The experimental results are promising. Especially they show that macro-order and neighborhood information is very important.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic and Evolutionary Algorithms Come of Age. CACM, volume 37(3), 1994.
Goldberg, D.E., Lingle J.R.: Alleles, Loci and the Traveling Salesman Problem. First Int'l Conf. on Genetic Algorithms and Their Applications, Erlbaum Associates, 1985.
Oliver, I.M., Smith, D.J., Holland, J.R.: A Study of Permutation Crossover Operators on the Traveling Salesman Problem. Second Int'l Conf. on Genetic Algorithms and Their Applications, 1987.
Prasanna, J., Jung, Y.S., Gucht, D.V.: The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem. Third Int'l Conf. on Genetic Algorithms, 1989.
Whitley, D., Starkweather, T., Fuquay, D.: Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination operator. Third Int'l Conf. on Genetic Algorithms, 1989.
Mathias, K., Whitley, D.: Genetic Operators, The Fitness Landscape and the Traveling Salesman Problem. Second Int'l Conf. on Parallel Problem Solving from Nature, pp.221–230, 1992.
Ulder, N., Aarts, E., Bandelt, H., van Laarhoven, P., Pesch, E.: Genetic Local Search Algorithms for the Traveling Salesman Problem. First Int'l Conf. on Parallel Problem Solving from Nature, pp.109–116, 1990.
Schleuter, M.G.: ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. Third Int'l Conf. on Genetic Algorithms, 1989.
Fogarty, T., Huang, R.: Implementing the Genetic Algorithm on Transputer Based Parallel Processing Systems. First Int'l Conf. on Parallel Problem Solving from Nature, pp.145–149, 1990.
Maruyma, T., Kanagaya, A., Konishi, I.: An Asynchronous Fine-Grained Parallel Genetic Algorithm. Second Int'l Conf. on Parallel Problem Solving from Nature, pp.561–570, 1992.
Geist, A., Beguelin, A., Dongorra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM3 Users's Guide and Reference Manual. Technical Report, Oak Ridge National Lab, 1994.
Mühlenbein, H.: Evolution in Time and Space, the Parallel Genetic Algorithm. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
Eshelman, L.J.: The CHC Adaptive Search Algorithm. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
Bixby, B., Reinelt, G.: TSPLIB, A Traveling Salesman Problem Library. ORSA Journal on Computing 3, pp.376–384, 1991. Access via http://ftp.zipberlin.de/pub/mp-testdata/tsp/index.html.
Fox, B.R., McMahon, M.B.: Genetic Operators for Sequencing Problems. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aşveren, T., Molitor, P. (1996). New crossover methods for sequencing 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_993
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_993
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