{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:55:44Z","timestamp":1743141344701,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319016917"},{"type":"electronic","value":"9783319016924"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01692-4_9","type":"book-chapter","created":{"date-parts":[[2013,8,12]],"date-time":"2013-08-12T04:30:22Z","timestamp":1376281822000},"page":"113-124","source":"Crossref","is-referenced-by-count":12,"title":["An Adaptive Multi-Crossover Population Algorithm for Solving Routing Problems"],"prefix":"10.1007","author":[{"given":"E.","family":"Osaba","sequence":"first","affiliation":[]},{"given":"E.","family":"Onieva","sequence":"additional","affiliation":[]},{"given":"R.","family":"Carballedo","sequence":"additional","affiliation":[]},{"given":"F.","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"A.","family":"Perallos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Affenzeller, M., Wagner, S., Winkler, S.: Genetic algorithms and genetic programming: modern concepts and practical applications, vol.\u00a06. Chapman & Hall\/CRC (2009)","DOI":"10.1201\/9781420011326"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Systems with Applications\u00a038(3), 1313\u20131320 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1016\/j.eswa.2011.08.009","volume":"39","author":"S. Anbuudayasankar","year":"2012","unstructured":"Anbuudayasankar, S., Ganesh, K., Lenny Koh, S., Ducq, Y.: Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls. Expert Systems with Applications\u00a039(3), 2296\u20132305 (2012)","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11590-010-0252-4","volume":"6","author":"J. Bae","year":"2012","unstructured":"Bae, J., Rathinam, S.: Approximation algorithms for multiple terminal, hamiltonian path problems. Optimization Letters\u00a06(1), 69\u201385 (2012)","journal-title":"Optimization Letters"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.cor.2005.03.014","volume":"34","author":"N. Bianchessi","year":"2007","unstructured":"Bianchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research\u00a034(2), 578\u2013594 (2007)","journal-title":"Computers & Operations Research"},{"key":"9_CR6","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 161\u2013163 (1985)"},{"key":"9_CR7","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: Proceeding of the Third International Conference on Genetic Algorithms, pp. 61\u201369 (1989)"},{"key":"9_CR8","unstructured":"De Jong, K.: Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Michigan, USA (1975)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"3744","DOI":"10.1016\/j.asoc.2011.02.004","volume":"11","author":"J. Fernandez-Prieto","year":"2011","unstructured":"Fernandez-Prieto, J., Gadeo-Martos, M., Velasco, J.R., et al.: Optimisation of control parameters for genetic algorithms to test computer networks under realistic traffic loads. Applied Soft Computing\u00a011(4), 3744\u20133752 (2011)","journal-title":"Applied Soft Computing"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2008.02.025","volume":"196","author":"Y. Gajpal","year":"2009","unstructured":"Gajpal, Y., Abad, P.: Multi-ant colony system (macs) for a vehicle routing problem with backhauls. European Journal of Operational Research\u00a0196(1), 102\u2013117 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cie.2007.04.010","volume":"53","author":"J. Gao","year":"2007","unstructured":"Gao, J., Gen, M., Sun, L., Zhao, X.: A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Computers & Industrial Engineering\u00a053(1), 149\u2013162 (2007)","journal-title":"Computers & Industrial Engineering"},{"key":"9_CR12","unstructured":"Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional (1989)"},{"key":"9_CR13","unstructured":"Golden, B., Baker, E., Alfaro, J., Schaffer, J.: The vehicle routing problem with backhauling: two approaches. In: Proceedings of the Twenty-first Annual Meeting of SE TIMS, South Carolina, USA, pp. 90\u201392 (1985)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"J.J. Grefenstette","year":"1986","unstructured":"Grefenstette, J.J.: Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics\u00a016(1), 122\u2013128 (1986)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-21314-4_16","volume-title":"Advances in Artificial Life. Darwin Meets von Neumann","author":"I. Harvey","year":"2011","unstructured":"Harvey, I.: The microbial genetic algorithm. In: Kampis, G., Karsai, I., Szathm\u00e1ry, E. (eds.) ECAL 2009, Part II. LNCS, vol.\u00a05778, pp. 126\u2013133. Springer, Heidelberg (2011)"},{"key":"9_CR16","unstructured":"Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT Press (1975)"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research\u00a059(3), 345\u2013358 (1992)","journal-title":"European Journal of Operational Research"},{"key":"9_CR18","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"E. Lawler","year":"1985","unstructured":"Lawler, E., Lenstra, J., Kan, A., Shmoys, D.: The traveling salesman problem: a guided tour of combinatorial optimization, vol.\u00a03. Wiley, New York (1985)"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s11590-010-0266-y","volume":"6","author":"W. Li","year":"2012","unstructured":"Li, W., Shi, Y.: On the maximum tsp with \u03b3-parameterized triangle inequality. Optimization Letters\u00a06(3), 415\u2013420 (2012)","journal-title":"Optimization Letters"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10732-011-9181-3","volume":"18","author":"A. Liefooghe","year":"2012","unstructured":"Liefooghe, A., Humeau, J., Mesmoudi, S., Jourdan, L., Talbi, E.: On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems. Journal of Heuristics\u00a018(2), 317\u2013352 (2012)","journal-title":"Journal of Heuristics"},{"issue":"10","key":"9_CR21","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal\u00a044(10), 2245\u20132269 (1965)","journal-title":"Bell System Technical Journal"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Torres, M.: A genetic search of patterns of behaviour in oss communities. Expert Systems with Applications\u00a039(18), 13,182\u201313,192 (2012)","DOI":"10.1016\/j.eswa.2012.05.083"},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"G. Mattos Ribeiro","year":"2012","unstructured":"Mattos Ribeiro, G., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research\u00a039(3), 728\u2013735 (2012)","journal-title":"Computers & Operations Research"},{"issue":"18","key":"9_CR24","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.eswa.2012.05.081","volume":"39","author":"I. Moon","year":"2012","unstructured":"Moon, I., Lee, J.H., Seong, J.: Vehicle routing problem with time windows considering overtime and outsourcing vehicles. Expert Systems with Applications\u00a039(18), 13,202\u201313,213 (2012)","journal-title":"Expert Systems with Applications"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/978-3-642-35380-2_91","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"S. Mukherjee","year":"2012","unstructured":"Mukherjee, S., Ganguly, S., Das, S.: A strategy adaptive genetic algorithm for solving the travelling salesman problem. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds.) SEMCCO 2012. LNCS, vol.\u00a07677, pp. 778\u2013784. Springer, Heidelberg (2012)"},{"issue":"11","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"S. Ngueveu","year":"2010","unstructured":"Ngueveu, S., Prins, C., Wolfler Calvo, R.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research\u00a037(11), 1877\u20131885 (2010)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1016\/j.eswa.2013.01.063","volume":"40","author":"M. Nikoli\u0107","year":"2013","unstructured":"Nikoli\u0107, M., Teodorovi\u0107, D.: Empirical study of the bee colony optimization (bco) algorithm. Expert Systems with Applications\u00a040(1), 4609\u20134620 (2013)","journal-title":"Expert Systems with Applications"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Osaba, E., Carballedo, R., Diaz, F., Perallos, A.: Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems. In: Proceedings of the 8th International Symposium on Applied Computational Intelligence and Informatics, pp. 17\u201323. IEEE (2013)","DOI":"10.1109\/SACI.2013.6608960"},{"issue":"12","key":"9_CR29","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C. Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research\u00a031(12), 1985\u20132002 (2004)","journal-title":"Computers & Operations Research"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Ray, S., Bandyopadhyay, S., Pal, S.: New operators of genetic algorithms for traveling salesman problem. In: Proceedings of the 17th International Conference on Pattern Recognition, vol.\u00a02, pp. 497\u2013500. IEEE (2004)","DOI":"10.1109\/ICPR.2004.1334276"},{"issue":"4","key":"9_CR31","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib: A traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"9_CR32","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.asoc.2009.11.026","volume":"11","author":"M. Rocha","year":"2011","unstructured":"Rocha, M., Sousa, P., Cortez, P., Rio, M.: Quality of service constrained routing optimization using evolutionary computation. Applied Soft Computing\u00a011(1), 356\u2013364 (2011)","journal-title":"Applied Soft Computing"},{"issue":"2","key":"9_CR33","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11590-010-0205-y","volume":"5","author":"S.C. Sarin","year":"2011","unstructured":"Sarin, S.C., Sherali, H.D., Yao, L.: New formulation for the high multiplicity asymmetric traveling salesman problem with application to the chesapeake problem. Optimization Letters\u00a05(2), 259\u2013272 (2011)","journal-title":"Optimization Letters"},{"key":"9_CR34","unstructured":"Schaffer, J.D., Morishima, A.: An adaptive crossover distribution mechanism for genetic algorithms. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and Their Application, pp. 36\u201340. L. Erlbaum Associates Inc. (1987)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Sharma, S., Gupta, K.: Solving the traveling salesmen problem through genetic algorithm with new variation order crossover. In: International Conference on Emerging Trends in Networks and Computer Communications, pp. 274\u2013276. IEEE (2011)","DOI":"10.1109\/ETNCC.2011.6255903"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Spears, W.M.: Adapting crossover in evolutionary algorithms. In: Proceedings of the Conference on Evolutionary Programming, pp. 367\u2013384 (1995)","DOI":"10.7551\/mitpress\/2887.003.0035"},{"issue":"4","key":"9_CR37","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M. Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics\u00a024(4), 656\u2013667 (1994)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR38","unstructured":"Syswerda, G.: Schedule optimization using genetic algorithms. In: Handbook of Genetic Algorithms, pp. 332\u2013349 (1991)"},{"issue":"3","key":"9_CR39","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"C. Tarantilis","year":"2007","unstructured":"Tarantilis, C., Kiranoudis, C.: A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. European Journal of Operational Research\u00a0179(3), 806\u2013822 (2007)","journal-title":"European Journal of Operational Research"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Vafaee, F., Nelson, P.C.: A genetic algorithm that incorporates an adaptive mutation based on an evolutionary model. In: Proceedings of the International Conference on Machine Learning and Applications, pp. 101\u2013107. IEEE (2009)","DOI":"10.1109\/ICMLA.2009.101"},{"key":"9_CR41","unstructured":"Wang, C., Zhang, J., Yang, J., Hu, C., Liu, J.: A modified particle swarm optimization algorithm and its application for solving traveling salesman problem. In: Proceedings of the International Conference on Neural Networks and Brain, vol.\u00a02, pp. 689\u2013694. IEEE (2005)"},{"issue":"6","key":"9_CR42","doi-asserted-by":"publisher","first-page":"7243","DOI":"10.1016\/j.eswa.2010.12.027","volume":"38","author":"L. Wang","year":"2011","unstructured":"Wang, L., Tang, D.: An improved adaptive genetic algorithm based on hormone modulation mechanism for job-shop scheduling problem. Expert Systems with Applications\u00a038(6), 7243\u20137250 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"9_CR43","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1016\/j.ijhydene.2009.05.008","volume":"35","author":"P. Xu","year":"2010","unstructured":"Xu, P., Zheng, J., Chen, H., Liu, P.: Optimal design of high pressure hydrogen storage vessel using an adaptive genetic algorithm. International Journal of Hydrogen Energy\u00a035(7), 2840\u20132846 (2010)","journal-title":"International Journal of Hydrogen Energy"},{"issue":"2","key":"9_CR44","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ress.2009.09.001","volume":"95","author":"Z. Ye","year":"2010","unstructured":"Ye, Z., Li, Z., Xie, M.: Some improvements on adaptive genetic algorithms for reliability-related applications. Reliability Engineering & System Safety\u00a095(2), 120\u2013126 (2010)","journal-title":"Reliability Engineering & System Safety"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, J., Chung, H.S., Zhong, J.: Adaptive crossover and mutation in genetic algorithms based on clustering technique. In: Proceedings of the Conference on Genetic and Evolutionary Computation, pp. 1577\u20131578. ACM (2005)","DOI":"10.1145\/1068009.1068267"},{"issue":"3","key":"9_CR46","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1109\/TEVC.2006.880727","volume":"11","author":"J. Zhang","year":"2007","unstructured":"Zhang, J., Chung, H.S., Lo, W.L.: Clustering-based adaptive crossover and mutation probabilities for genetic algorithms. IEEE Transactions on Evolutionary Computation\u00a011(3), 326\u2013335 (2007)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Studies in Computational Intelligence","Nature Inspired Cooperative Strategies for Optimization (NICSO 2013)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01692-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T10:52:43Z","timestamp":1715856763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01692-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319016917","9783319016924"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01692-4_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]}}}