{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:39:45Z","timestamp":1774611585197,"version":"3.50.1"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10489-013-0512-y","type":"journal-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T04:07:15Z","timestamp":1391746035000},"page":"145-166","source":"Crossref","is-referenced-by-count":86,"title":["Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts"],"prefix":"10.1007","volume":"41","author":[{"given":"E.","family":"Osaba","sequence":"first","affiliation":[]},{"given":"F.","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"E.","family":"Onieva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"key":"512_CR1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-32147-4_3","volume-title":"Combinatorial Optimization","author":"C Papadimitriou","year":"2012","unstructured":"Papadimitriou C (2012) The new faces of combinatorial optimization. In: Combinatorial Optimization. LNCS, vol 7422, pp 19\u201323"},{"key":"512_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial optimization: theory and algorithms","author":"B Korte","year":"2012","unstructured":"Korte B, Vygen J (2012) Combinatorial optimization: theory and algorithms, vol 21. Springer, Berlin"},{"key":"512_CR3","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 (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, New York"},{"key":"512_CR4","volume-title":"Computer and job-shop scheduling theory","author":"EG Coffman","year":"1976","unstructured":"Coffman EG, Bruno JL (1976) Computer and job-shop scheduling theory. Wiley, New York"},{"issue":"2","key":"512_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Kan A (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221\u2013227","journal-title":"Networks"},{"issue":"3","key":"512_CR6","doi-asserted-by":"crossref","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 (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728\u2013735","journal-title":"Comput Oper Res"},{"issue":"1","key":"512_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10489-010-0256-x","volume":"36","author":"Y Xu","year":"2012","unstructured":"Xu Y, Qu R (2012) A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Appl Intell 36(1):229\u2013241","journal-title":"Appl Intell"},{"issue":"1","key":"512_CR8","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1016\/j.asoc.2010.04.003","volume":"11","author":"E Onieva","year":"2011","unstructured":"Onieva E, Naranjo J, Milanes V, Alonso J, Garcia R, Perez J (2011) Automatic lateral control for unmanned vehicles via genetic algorithms. Appl Soft Comput 11(1):1303\u20131309","journal-title":"Appl Soft Comput"},{"issue":"1","key":"512_CR9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s10489-012-0405-5","volume":"39","author":"YJ Zheng","year":"2013","unstructured":"Zheng YJ, Chen SY (2013) Cooperative particle swarm optimization for multiobjective transportation planning. Appl Intell 39(1):202\u2013216","journal-title":"Appl Intell"},{"issue":"3","key":"512_CR10","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s10489-011-0278-z","volume":"36","author":"MH Kang","year":"2012","unstructured":"Kang MH, Choi HR, Kim HS, Park BJ (2012) Development of a maritime transportation planning support system for car carriers based on genetic algorithm. Appl Intell 36(3):585\u2013604","journal-title":"Appl Intell"},{"issue":"3","key":"512_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10489-012-0373-9","volume":"38","author":"H Masoud","year":"2013","unstructured":"Masoud H, Jalili S, Hasheminejad SMH (2013) Dynamic clustering using combinatorial particle swarm optimization. Appl Intell 38(3):289\u2013314","journal-title":"Appl Intell"},{"issue":"4","key":"512_CR12","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/s10489-011-0295-y","volume":"36","author":"KS Shin","year":"2012","unstructured":"Shin KS, Jeong YS, Jeong MK (2012) A two-leveled symbiotic evolutionary algorithm for clustering problems. Appl Intell 36(4):788\u2013799","journal-title":"Appl Intell"},{"key":"512_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-25231-0_1","volume-title":"Empirical software engineering and verification","author":"M Harman","year":"2012","unstructured":"Harman M, McMinn P, de Souza JT, Yoo S (2012) Search based software engineering: techniques, taxonomy, tutorial. In: Empirical software engineering and verification, vol 7007. Springer, Berlin, pp 1\u201359"},{"issue":"9","key":"512_CR14","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892\u20132907","journal-title":"Comput Oper Res"},{"issue":"1","key":"512_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00170-011-3610-1","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang L, Zhou G, Xu Y, Wang S, Liu M (2012) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol 60(1):303\u2013315","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"512_CR16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ins.2011.11.013","volume":"188","author":"R Zhang","year":"2012","unstructured":"Zhang R, Wu C (2012) Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm. Inf Sci 188(1):236\u2013252","journal-title":"Inf Sci"},{"issue":"4","key":"512_CR17","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/s10489-012-0345-0","volume":"37","author":"K Wang","year":"2012","unstructured":"Wang K, Zheng YJ (2012) A new particle swarm optimization algorithm for fuzzy optimization of armored vehicle scheme design. Appl Intell 37(4):520\u2013526","journal-title":"Appl Intell"},{"issue":"5\u20138","key":"512_CR18","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s00170-012-4051-1","volume":"64","author":"SHA Rahmati","year":"2013","unstructured":"Rahmati SHA, Zandieh M, Yazdani M (2013) Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol 64(5\u20138):915\u2013932","journal-title":"Int J Adv Manuf Technol"},{"issue":"4598","key":"512_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"512_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez J, Rodriguez-Tello E (2012) New bounds for binary covering arrays using simulated annealing. Inf Sci 185(1):137\u2013152","journal-title":"Inf Sci"},{"issue":"3","key":"512_CR21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search, Part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"2","key":"512_CR22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10489-011-0321-0","volume":"37","author":"AR Hedar","year":"2012","unstructured":"Hedar AR, Ali AF (2012) Tabu search with multi-level neighborhood structures for high dimensional problems. Appl Intell 37(2):189\u2013206","journal-title":"Appl Intell"},{"key":"512_CR23","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"512_CR24","unstructured":"De Jong K (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Michigan, USA"},{"issue":"4","key":"512_CR25","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10489-012-0382-8","volume":"38","author":"K Shi","year":"2013","unstructured":"Shi K, Li L (2013) High performance genetic algorithm based text clustering using parts of speech and outlier elimination. Appl Intell 38(4):511\u2013519","journal-title":"Appl Intell"},{"issue":"2","key":"512_CR26","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2):243\u2013278","journal-title":"Theor Comput Sci"},{"issue":"2","key":"512_CR27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10489-011-0322-z","volume":"37","author":"J Wu","year":"2012","unstructured":"Wu J, Abbas-Turki A, El Moudni A (2012) Cooperative driving: an ant colony system for autonomous intersection management. Appl Intell 37(2):207\u2013222","journal-title":"Appl Intell"},{"key":"512_CR28","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techn rep TR06, Erciyes Univ. Press, Erciyes"},{"issue":"4","key":"512_CR29","first-page":"520","volume":"37","author":"D Karaboga","year":"2012","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2012) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 37(4):520\u2013526","journal-title":"Artif Intell Rev"},{"issue":"12","key":"512_CR30","first-page":"5081","volume":"5","author":"PW Tsai","year":"2009","unstructured":"Tsai PW, Pan JS, Liao BY, Chu SC (2009) Enhanced artificial bee colony optimization. Int J Innov Comput Inf Control 5(12):5081\u20135092","journal-title":"Int J Innov Comput Inf Control"},{"key":"512_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/CEC.2010.5586007","volume-title":"IEEE congress on evolutionary computation","author":"M El-Abd","year":"2010","unstructured":"El-Abd M (2010) A cooperative approach to the artificial bee colony algorithm. In: IEEE congress on evolutionary computation, pp 1\u20135"},{"key":"512_CR32","first-page":"13","volume-title":"IEEE second world congress on nature and biologically inspired computing","author":"A Banharnsakun","year":"2010","unstructured":"Banharnsakun A, Achalakul T, Sirinaovakul B (2010) Artificial bee colony algorithm on distributed environments. In: IEEE second world congress on nature and biologically inspired computing, pp 13\u201318"},{"key":"512_CR33","first-page":"329","volume-title":"Handbook of swarm intelligence","author":"RS Parpinelli","year":"2010","unstructured":"Parpinelli RS, Benitez CMV, Lopes HS (2010) Parallel approaches for the artificial bee colony algorithm. In: Handbook of swarm intelligence. Springer, Berlin, pp 329\u2013345"},{"key":"512_CR34","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MHS.1995.494215","volume-title":"Proceedings of the IEEE sixth international symposium on micro machine and human science","author":"R Eberhart","year":"1995","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the IEEE sixth international symposium on micro machine and human science, pp 39\u201343"},{"issue":"5","key":"512_CR35","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TEVC.2006.886448","volume":"11","author":"W Langdon","year":"2007","unstructured":"Langdon W, Poli R (2007) Evolving problems to learn about particle swarm optimizers and other search algorithms. IEEE Trans Evol Comput 11(5):561\u2013578","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"512_CR36","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10489-012-0420-6","volume":"39","author":"M Hasanzadeh","year":"2013","unstructured":"Hasanzadeh M, Meybodi MR, Ebadzadeh MM (2013) Adaptive cooperative particle swarm optimizer. Appl Intell 39(2):397\u2013420","journal-title":"Appl Intell"},{"key":"512_CR37","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/BFb0040811","volume-title":"Evolutionary programming VII","author":"PJ Angeline","year":"1998","unstructured":"Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. In: Evolutionary programming VII. Springer, Berlin, pp 601\u2013610"},{"key":"512_CR38","first-page":"79","volume-title":"IEEE international conference on web intelligence and intelligent agent technology","author":"Y Xu","year":"2008","unstructured":"Xu Y, Wang Q, Hu J (2008) An improved discrete particle swarm optimization based on cooperative swarms. In: IEEE international conference on web intelligence and intelligent agent technology, vol 2, pp 79\u201382"},{"issue":"2","key":"512_CR39","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1016\/j.amc.2006.07.026","volume":"185","author":"B Niu","year":"2007","unstructured":"Niu B, Zhu Y, He X, Wu H (2007) MCPSO: a multi-swarm cooperative particle swarm optimizer. Appl Math Comput 185(2):1050\u20131062","journal-title":"Appl Math Comput"},{"issue":"4","key":"512_CR40","first-page":"809","volume":"21","author":"J Chanj","year":"2005","unstructured":"Chanj J, Chu SC, Roddick JF, Pan JS (2005) A parallel particle swarm optimization algorithm with communication strategies. J Inf Sci Eng 21(4):809\u2013818","journal-title":"J Inf Sci Eng"},{"key":"512_CR41","first-page":"428","volume-title":"Proceedings of the third international conference on genetic algorithms","author":"B Manderick","year":"1989","unstructured":"Manderick B, Spiessens P (1989) Fine-grained parallel genetic algorithms. In: Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 428\u2013433"},{"key":"512_CR42","volume-title":"Modern heuristic techniques for combinatorial problems","author":"CR Reeves","year":"1993","unstructured":"Reeves CR (1993) Modern heuristic techniques for combinatorial problems. Wiley, New York"},{"key":"512_CR43","first-page":"33","volume":"7","author":"D Whitley","year":"1999","unstructured":"Whitley D, Rana S, Heckendorn RB (1999) The island model genetic algorithm: on separability, population size and convergence. Int J Comput Inf Technol 7:33\u201348","journal-title":"Int J Comput Inf Technol"},{"key":"512_CR44","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-89694-4_19","volume-title":"Simulated evolution and learning","author":"C Li","year":"2008","unstructured":"Li C, Yang S (2008) An island based hybrid evolutionary algorithm for optimization. In: Simulated evolution and learning. Springer, Berlin, pp 180\u2013189"},{"issue":"1","key":"512_CR45","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jpdc.1997.1397","volume":"47","author":"P Cal\u00e9gari","year":"1997","unstructured":"Cal\u00e9gari P, Guidec F, Kuonen P, Kobler D (1997) Parallel island-based genetic algorithm for radio network design. J Parallel Distrib Comput 47(1):86\u201390","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"512_CR46","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/s10489-013-0429-5","volume":"39","author":"R Abbasian","year":"2013","unstructured":"Abbasian R, Mouhoub M (2013) A hierarchical parallel genetic approach for the graph coloring problem. Appl Intell 39(3):510\u2013528","journal-title":"Appl Intell"},{"issue":"2","key":"512_CR47","first-page":"141","volume":"10","author":"E Cant\u00fa-Paz","year":"1998","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calc Parall\u00e9les 10(2):141\u2013171","journal-title":"Calc Parall\u00e9les"},{"key":"512_CR48","first-page":"4661","volume-title":"IEEE congress on evolutionary computation","author":"E Atashpaz-Gargari","year":"2007","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation. IEEE, New York, pp 4661\u20134667"},{"key":"512_CR49","doi-asserted-by":"crossref","unstructured":"Wang Gj, Zhang YB, Chen JW (2011) A novel algorithm to solve the vehicle routing problem with time windows: imperialist competitive algorithm. Adv Inf Sci Serv Sci 3(5)","DOI":"10.4156\/aiss.vol3.issue5.14"},{"issue":"5","key":"512_CR50","first-page":"108","volume":"3","author":"M Yousefikhoshbakht","year":"2013","unstructured":"Yousefikhoshbakht M, Sedighpour M (2013) New imperialist competitive algorithm to solve the travelling salesman problem. Int J Comput Math 3(5):108\u2013116","journal-title":"Int J Comput Math"},{"key":"512_CR51","first-page":"225","volume-title":"International conference on computational intelligence and security","author":"C Dai","year":"2006","unstructured":"Dai C, Chen W, Zhu Y (2006) Seeker optimization algorithm. In: International conference on computational intelligence and security. Springer, Berlin, pp 225\u2013229"},{"issue":"2","key":"512_CR52","doi-asserted-by":"crossref","first-page":"300","DOI":"10.3969\/j.issn.1004-4132.2010.02.021","volume":"21","author":"C Dai","year":"2010","unstructured":"Dai C, Chen W, Song Y, Zhu Y (2010) Seeker optimization algorithm: a novel stochastic search algorithm for global numerical optimization. J Syst Eng Electron 21(2):300\u2013311","journal-title":"J Syst Eng Electron"},{"issue":"3","key":"512_CR53","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/TPWRS.2009.2021226","volume":"24","author":"C Dai","year":"2009","unstructured":"Dai C, Chen W, Zhu Y, Zhang X (2009) Seeker optimization algorithm for optimal reactive power dispatch. IEEE Trans Power Syst 24(3):1218\u20131231","journal-title":"IEEE Trans Power Syst"},{"issue":"5","key":"512_CR54","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/TIE.2009.2031194","volume":"57","author":"C Dai","year":"2010","unstructured":"Dai C, Chen W, Zhu Y (2010) Seeker optimization algorithm for digital IIR filter design. IEEE Trans Ind Electron 57(5):1710\u20131718","journal-title":"IEEE Trans Ind Electron"},{"issue":"10","key":"512_CR55","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"512_CR56","first-page":"161","volume-title":"Proceedings of the international joint conference on artificial intelligence","author":"L Davis","year":"1985","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceedings of the international joint conference on artificial intelligence, vol 1, pp 161\u2013163"},{"key":"512_CR57","first-page":"324","volume-title":"Proceedings of the ACM symposium on applied computing","author":"BA Julstrom","year":"1995","unstructured":"Julstrom BA (1995) Very greedy crossover in a genetic algorithm for the traveling salesman problem. In: Proceedings of the ACM symposium on applied computing, pp 324\u2013328"},{"issue":"5","key":"512_CR58","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0167-739X(98)00034-X","volume":"14","author":"LS Ochi","year":"1998","unstructured":"Ochi LS, Vianna DS, Drummond L, Victor A (1998) A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Gener Comput Syst 14(5):285\u2013292","journal-title":"Future Gener Comput Syst"},{"issue":"2","key":"512_CR59","doi-asserted-by":"crossref","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 (2012) On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems. J Heuristics 18(2):317\u2013352","journal-title":"J Heuristics"},{"issue":"5","key":"512_CR60","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1016\/j.cor.2011.06.008","volume":"39","author":"M Casazza","year":"2012","unstructured":"Casazza M, Ceselli A, Nunkesser M (2012) Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput Oper Res 39(5):1044\u20131053","journal-title":"Comput Oper Res"},{"issue":"3","key":"512_CR61","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","volume":"26","author":"SS Ray","year":"2007","unstructured":"Ray SS, Bandyopadhyay S, Pal SK (2007) Genetic operators for combinatorial optimization in tsp and microarray gene ordering. Appl Intell 26(3):183\u2013195","journal-title":"Appl Intell"},{"issue":"3","key":"512_CR62","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345\u2013358","journal-title":"Eur J Oper Res"},{"issue":"11","key":"512_CR63","doi-asserted-by":"crossref","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 (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877\u20131885","journal-title":"Comput Oper Res"},{"issue":"1","key":"512_CR64","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10489-008-0136-9","volume":"32","author":"CY Lee","year":"2010","unstructured":"Lee CY, Lee ZJ, Lin SW, Ying KC (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88\u201395","journal-title":"Appl Intell"},{"issue":"9","key":"512_CR65","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"J Cordeau","year":"2012","unstructured":"Cordeau J, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39(9):2033\u20132050","journal-title":"Comput Oper Res"},{"issue":"4","key":"512_CR66","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) Tsplib\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"2","key":"512_CR67","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"issue":"6","key":"512_CR68","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J Cordeau","year":"2003","unstructured":"Cordeau J, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res, Part B, Methodol 37(6):579\u2013594","journal-title":"Transp Res, Part B, Methodol"},{"issue":"4","key":"512_CR69","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A Breedam","year":"2001","unstructured":"Breedam A (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Oper Res 28(4):289\u2013315","journal-title":"Comput Oper Res"},{"issue":"9","key":"512_CR70","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1016\/j.cor.2004.03.005","volume":"32","author":"C Tarantilis","year":"2005","unstructured":"Tarantilis C (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper Res 32(9):2309\u20132327","journal-title":"Comput Oper Res"},{"issue":"6","key":"512_CR71","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32(6):1379\u20131407","journal-title":"Comput Oper Res"},{"issue":"3","key":"512_CR72","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"C Tarantilis","year":"2007","unstructured":"Tarantilis C, Kiranoudis C (2007) A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector. Eur J Oper Res 179(3):806\u2013822","journal-title":"Eur J Oper Res"},{"issue":"2","key":"512_CR73","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.cor.2005.03.014","volume":"34","author":"N Bianchessi","year":"2007","unstructured":"Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34(2):578\u2013594","journal-title":"Comput Oper Res"},{"key":"512_CR74","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-319-01692-4_9","volume-title":"Nature inspired cooperative strategies for optimization","author":"E Osaba","year":"2014","unstructured":"Osaba E, Onieva E, Carballedo R, Diaz F, Perallos A (2014) An adaptive multi-crossover population algorithm for solving routing problems. In: Nature inspired cooperative strategies for optimization. Springer, Berlin, pp 113\u2013124"},{"issue":"1","key":"512_CR75","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0360-8352(91)90165-3","volume":"21","author":"A Alfa","year":"1991","unstructured":"Alfa A, Heragu S, Chen M (1991) A 3-opt based simulated annealing algorithm for vehicle routing problems. Comput Ind Eng 21(1):635\u2013639","journal-title":"Comput Ind Eng"},{"key":"512_CR76","first-page":"489","volume-title":"IEEE international conference on high performance computing and simulation","author":"K Rocki","year":"2012","unstructured":"Rocki K, Suda R (2012) Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem. In: IEEE international conference on high performance computing and simulation, pp 489\u2013495"},{"key":"512_CR77","volume-title":"The vehicle routing problem","author":"P Toth","year":"1987","unstructured":"Toth P, Vigo D (1987) The vehicle routing problem, vol 9. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"1","key":"512_CR78","first-page":"11","volume":"1","author":"ZJ Lee","year":"2012","unstructured":"Lee ZJ (2012) A hybrid approach for vehicle routing problem with time windows. Adv Intell Transp Syst 1(1):11\u201318","journal-title":"Adv Intell Transp Syst"},{"issue":"11","key":"512_CR79","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1631\/jzus.C1300184","volume":"14","author":"E Osaba","year":"2013","unstructured":"Osaba E, Onieva E, Carballedo R, Diaz F, Perallos A, Zhang X (2013) A multi-crossover and adaptive island based population algorithm for solving routing problems. J Zhejiang Univ Sci C 14(11):815\u2013821","journal-title":"J Zhejiang Univ Sci C"},{"issue":"2","key":"512_CR80","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M Savelsbergh","year":"1992","unstructured":"Savelsbergh M (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4(2):146\u2013154","journal-title":"ORSA J Comput"},{"key":"512_CR81","unstructured":"Diaz B (2012) Vrp web. http:\/\/neo.lcc.uma.es\/radi-aeb\/Web-VRP"},{"key":"512_CR82","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1145\/2464576.2480776","volume-title":"Proceeding of the fifteenth annual conference companion on genetic and evolutionary computation conference companion","author":"E Osaba","year":"2013","unstructured":"Osaba E, Diaz F, Onieva E (2013) A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceeding of the fifteenth annual conference companion on genetic and evolutionary computation conference companion. ACM, New York, pp 1743\u20131744"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0512-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0512-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0512-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:11:44Z","timestamp":1565179904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0512-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["512"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0512-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}