{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:40Z","timestamp":1761596800980},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00830-5","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"352-364","source":"Crossref","is-referenced-by-count":30,"title":["Genetic local search with distance preserving recombination operator for a vehicle routing problem"],"prefix":"10.1016","volume":"151","author":[{"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Kominek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00830-5_BIB1","series-title":"A Connectionist Machine for Genetic Hillclimbing","author":"Ackley","year":"1987"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multistart technique for combinatorial global optimization","volume":"16","author":"Boese","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB3","doi-asserted-by":"crossref","unstructured":"Freisleben, B., Merz, P., 1996. A genetic local search algorithm for travelling salesman problem. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (Eds.), Proceedings of the 4th Conference on Parallel Problem Solving fram Nature-PPSN IV, pp. 890\u2013900","DOI":"10.1007\/3-540-61723-X_1052"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB4","unstructured":"Galinier, P., Hao, J.-K., 1999. Hybrid evolutionary algorithms for graph coloring. Technical Report, Parc Scientifique Georges Besse, Nimes"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristic for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Science"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01719256","article-title":"Scatter search and star-paths: Beyond the genetic metaphor","volume":"17","author":"Glover","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB7","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1988"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB8","unstructured":"Gorges-Schleuter, M., 1997. On the power of evolutionary optimization at the example of ATSP and large TSP Problems. In: European Conference on Artificial Life \u201897, Brighton, UK"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB9","unstructured":"Jaszkiewicz, A., 1998. Genetic local search for multiple objective combinatorial optimization. Research report, Institute of Computing Science, Pozna\u0144 University of Technology, RA-014\/98, pp. 23"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB10","unstructured":"Jones, T., Forrest, S., 1995. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Santa Fe Institute Working Paper 95-02-022"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB11","series-title":"The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the travelling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB13","series-title":"Genetic Algorithms+DataStructures=Evolution Programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB14","series-title":"Proceedings of the 1997 IEEE International Conference on Evolutionary Computation","first-page":"159","article-title":"Genetic local search for the TSP New results","author":"Merz","year":"1997"},{"issue":"4","key":"10.1016\/S0377-2217(02)00830-5_BIB15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","article-title":"Fitness landscape analysis and memetic algorithms for the quadratic assignment problem","volume":"4","author":"Merz","year":"2000","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB16","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50023-9","article-title":"Evolution in time and space\u2013\u2013the parallel genetic algorithm","author":"M\u00fchlenbein","year":"1991"},{"issue":"2","key":"10.1016\/S0377-2217(02)00830-5_BIB17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows\u2013\u2013part II: Genetic search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB18","series-title":"Evolutionary Computing: AISB Workshop","article-title":"Formal memetic algorithms","author":"Radcliffe","year":"1994"},{"issue":"2","key":"10.1016\/S0377-2217(02)00830-5_BIB19","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","article-title":"Genetic algorithms to minimize the weighted number of late jobs on a single machine","volume":"151","author":"Sevaux","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00830-5_BIB20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assignment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Science"},{"issue":"1","key":"10.1016\/S0377-2217(02)00830-5_BIB21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No Free Lunch theorem for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:21:27Z","timestamp":1584508887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0377221702008305"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00830-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}