{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:54:05Z","timestamp":1760730845933,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T00:00:00Z","timestamp":1464307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61133005","61432005"],"award-info":[{"award-number":["61133005","61432005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370095","61472124"],"award-info":[{"award-number":["61370095","61472124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202109","61472126"],"award-info":[{"award-number":["61202109","61472126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Science & Technology Cooperation Program of China","award":["2015DFA11240","2014DFBS0010"],"award-info":[{"award-number":["2015DFA11240","2014DFBS0010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00500-016-2200-4","type":"journal-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T04:04:59Z","timestamp":1464321899000},"page":"6421-6433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Chemical reaction optimization with unified tabu search for the vehicle routing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Thu-Lan","family":"Dam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"issue":"1","key":"2200_CR1","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.cie.2008.06.012","volume":"56","author":"TJ Ai","year":"2009","unstructured":"Ai TJ, Kachitvichyanukul V (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56(1):380\u2013387","journal-title":"Comput Ind Eng"},{"key":"2200_CR2","doi-asserted-by":"crossref","unstructured":"Astudillo L, Melin P, Castillo O (2013) Nature inspired chemical optimization to design a type-2 fuzzy controller for a mobile robot. In: IFSA world congress and NAFIPS annual meeting (IFSA\/NAFIPS), 2013 Joint, pp 1423\u20131428","DOI":"10.1109\/IFSA-NAFIPS.2013.6608610"},{"key":"2200_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ins.2014.08.043","volume":"291","author":"L Astudillo","year":"2015","unstructured":"Astudillo L, Melin P, Castillo O (2015) Introduction to an optimization algorithm based on the chemical reactions. Inf Sci 291:85\u201395","journal-title":"Inf Sci"},{"issue":"5","key":"2200_CR4","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787\u2013800","journal-title":"Comput Oper Res"},{"issue":"12","key":"2200_CR5","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","volume":"54","author":"J Berger","year":"2004","unstructured":"Berger J, Barkaoui M (2004) A new hybrid genetic algorithm for the capacitated vehicle routing problem. J Oper Res Soc 54(12):1254\u20131262","journal-title":"J Oper Res Soc"},{"issue":"4","key":"2200_CR6","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"AL Chen","year":"2006","unstructured":"Chen AL, Yang GK, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7(4):607\u2013614","journal-title":"J Zhejiang Univ Sci A"},{"issue":"2","key":"2200_CR7","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1016\/j.eswa.2009.06.047","volume":"37","author":"P Chen","year":"2010","unstructured":"Chen P, Huang HK, Dong XY (2010) Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Exp Syst Appl 37(2):1620\u20131627","journal-title":"Exp Syst Appl"},{"key":"2200_CR8","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization, vol 1. Wiley, Chichester, pp 315\u2013338"},{"key":"2200_CR9","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J Cordeau","year":"2001","unstructured":"Cordeau J, Laporte G, Hautes E, Commerciales E, Gerad L (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928\u2013936","journal-title":"J Oper Res Soc"},{"issue":"5","key":"2200_CR10","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J Cordeau","year":"2002","unstructured":"Cordeau J, Gendreau M, Laporte G, Potvin J, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53(5):512\u2013522","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2200_CR11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"key":"2200_CR12","doi-asserted-by":"crossref","unstructured":"de la O D, Castillo O, Mel\u00e9ndez A, Melin P, Astudillo L, S\u00e1nchez C, (2015) Optimization of reactive fuzzy controllers for mobile robots based on the chemical reactions algorithm. In: Melin P, Castillo O, Kacprzyk J (eds) Design of intelligent systems based on fuzzy logic, neural networks and nature-inspired optimization, studies in computational intelligence, vol 601. Springer, New York, pp 253\u2013266","DOI":"10.1007\/978-3-319-17747-2_21"},{"issue":"4","key":"2200_CR13","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483","journal-title":"Comput Ind Eng"},{"issue":"10","key":"2200_CR14","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276\u20131290","journal-title":"Manag Sci"},{"volume-title":"The vehicle routing problem: latest advances and new challenges","year":"2008","key":"2200_CR15","unstructured":"Golden BL, Raghavan S, Wasil EA (eds) (2008) The vehicle routing problem: latest advances and new challenges. Springer, Berlin"},{"key":"2200_CR16","volume-title":"Adaptations in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptations in natural and artificial systems. University of Michigan Press, ann arbor"},{"issue":"3","key":"2200_CR17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AY Lam","year":"2010","unstructured":"Lam AY, Li VO (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14(3):381\u2013399","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"2200_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-012-0075-1","volume":"4","author":"AY Lam","year":"2012","unstructured":"Lam AY, Li VO (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3\u201317","journal-title":"Memet Comput"},{"issue":"5","key":"2200_CR19","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1109\/TEVC.2012.2227973","volume":"17","author":"AY Lam","year":"2013","unstructured":"Lam AY, Li VO, Xu J (2013) On the convergence of chemical reaction optimization for combinatorial optimization. IEEE Trans Evol Comput 17(5):605\u2013620","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"2200_CR20","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"issue":"4\u20135","key":"2200_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte G, Gendreau M, Potvin J, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7(4\u20135):285\u2013300","journal-title":"Int Trans Oper Res"},{"key":"2200_CR22","doi-asserted-by":"crossref","unstructured":"Li K, Zhang Z, Xu Y, Gao B, He L (2012) Chemical reaction optimization for heterogeneous computing environments. In: ISPA \u201912 proceedings of the 2012 IEEE 10th international symposium on parallel and distributed processing with applications. IEEE Computer Society, Washington, ISPA \u201912, pp 17\u201323","DOI":"10.1109\/ISPA.2012.11"},{"issue":"10","key":"2200_CR23","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"},{"issue":"8","key":"2200_CR24","doi-asserted-by":"crossref","first-page":"6807","DOI":"10.1016\/j.eswa.2012.01.015","volume":"39","author":"Y Marinakis","year":"2012","unstructured":"Marinakis Y (2012) Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem. Expert Syst Appl 39(8):6807\u20136815","journal-title":"Expert Syst Appl"},{"issue":"4","key":"2200_CR25","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.engappai.2010.02.002","volume":"23","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23(4):463\u2013472","journal-title":"Eng Appl Artif Intell"},{"issue":"8","key":"2200_CR26","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1016\/j.eswa.2012.12.032","volume":"40","author":"P Melin","year":"2013","unstructured":"Melin P, Astudillo L, Castillo O, Valdez F, Garcia M (2013) Optimal design of type-2 and type-1 fuzzy tracking controllers for autonomous mobile robots under perturbed torques using a new chemical optimization paradigm. Expert Syst Appl 40(8):3185\u20133195","journal-title":"Expert Syst Appl"},{"issue":"10","key":"2200_CR27","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.cor.2005.11.006","volume":"34","author":"D Mester","year":"2007","unstructured":"Mester D, Br\u00e4ysy O (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34(10):2964\u20132975","journal-title":"Comput Oper Res"},{"issue":"5","key":"2200_CR28","doi-asserted-by":"crossref","first-page":"2110","DOI":"10.1016\/j.apm.2011.08.010","volume":"36","author":"H Nazif","year":"2012","unstructured":"Nazif H, Lee LS (2012) Optimised crossover genetic algorithm for capacitated vehicle routing problem. Appl Math Model 36(5):2110\u20132117","journal-title":"Appl Math Model"},{"issue":"5","key":"2200_CR29","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1016\/j.eswa.2013.09.012","volume":"41","author":"TT Nguyen","year":"2014","unstructured":"Nguyen TT, Li Z, Zhang S, Truong TK (2014) A hybrid algorithm based on particle swarm and chemical reaction optimization. Expert Syst Appl 41(5):2134\u20132143","journal-title":"Expert Syst Appl"},{"issue":"2","key":"2200_CR30","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00500-014-1266-0","volume":"19","author":"Y Niu","year":"2015","unstructured":"Niu Y, Wang S, He J, Xiao J (2015) A novel membrane algorithm for capacitated vehicle routing problem. Soft Comput 19(2):471\u2013482","journal-title":"Soft Comput"},{"issue":"4","key":"2200_CR31","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I Osman","year":"1993","unstructured":"Osman I (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421\u2013451","journal-title":"Ann Oper Res"},{"key":"2200_CR32","unstructured":"Pan B, Lam A, Li V (2011) Network coding optimization based on chemical reaction optimization. In: Global telecommunications conference (GLOBECOM 2011), 2011 IEEE, pp 1\u20135"},{"issue":"12","key":"2200_CR33","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985\u20132002","journal-title":"Comput Oper Res"},{"issue":"1","key":"2200_CR34","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147\u2013167","journal-title":"J Heuristics"},{"key":"2200_CR35","first-page":"381","volume-title":"Recent advances on hybrid approaches for designing intelligent systems, studies in computational intelligence","author":"C S\u00e1nchez","year":"2014","unstructured":"S\u00e1nchez C, Melin P, Astudillo L (2014) Chemical optimization method for modular neural networks applied in emotion classification. In: Castillo O, Melin P, Pedrycz W, Kacprzyk J (eds) Recent advances on hybrid approaches for designing intelligent systems, studies in computational intelligence, vol 547. Springer, New York, pp 381\u2013390"},{"key":"2200_CR36","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2007","unstructured":"Sheskin DJ (2007) Handbook of parametric and nonparametric statistical procedures, 4th edn. Chapman & Hall\/CRC Press, London\/Boca Raton","edition":"4"},{"key":"2200_CR37","doi-asserted-by":"crossref","unstructured":"Sun J, Wang Y, Li J, Gao K (2011) Hybrid algorithm based on chemical reaction optimization and lin-kernighan local search for the traveling salesman problem. In: 2011 Seventh international conference on natural computation (ICNC), vol\u00a03, pp 1518\u20131521","DOI":"10.1109\/ICNC.2011.6022378"},{"issue":"8","key":"2200_CR38","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"issue":"2","key":"2200_CR39","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"issue":"9","key":"2200_CR40","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"},{"volume-title":"The vehicle routing problem","year":"2002","key":"2200_CR41","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"4","key":"2200_CR42","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J Comput 15(4):333\u2013346","journal-title":"INFORMS J Comput"},{"issue":"4","key":"2200_CR43","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13(4):1774\u20131780","journal-title":"Appl Soft Comput"},{"issue":"5","key":"2200_CR44","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.3233\/IFS-141500","volume":"28","author":"TK Truong","year":"2015","unstructured":"Truong TK, Li K, Xu Y, Ouyang A, Nguyen TT (2015) Solving 0\u20131 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy. J Intell Fuzzy Syst 28(5):2179\u20132186","journal-title":"J Intell Fuzzy Syst"},{"issue":"9","key":"2200_CR45","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1016\/j.jpdc.2013.05.005","volume":"73","author":"Y Xu","year":"2013","unstructured":"Xu Y, Li K, He L, Truong TK (2013) A DAG scheduling scheme on heterogeneous computing systems using double molecular structure-based chemical reaction optimization. J Parallel Distrib Comput 73(9):1306\u20131322","journal-title":"J Parallel Distrib Comput"},{"issue":"12","key":"2200_CR46","doi-asserted-by":"crossref","first-page":"3208","DOI":"10.1109\/TPDS.2014.2385698","volume":"26","author":"Y Xu","year":"2015","unstructured":"Xu Y, Li K, He L, Zhang L, Li K (2015) A hybrid chemical reaction optimization scheme for task scheduling on heterogeneous computing systems. IEEE Trans Parallel Distrib Syst 26(12):3208\u20133222","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"2200_CR47","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/3008161","volume":"21","author":"PC Yellow","year":"1970","unstructured":"Yellow PC (1970) A computational modification to the savings method of vehicle scheduling. Oper Res Q (1970\u20131977) 21(2):281\u2013283","journal-title":"Oper Res Q (1970\u20131977)"},{"issue":"1","key":"2200_CR48","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu B, Yang ZZ, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196(1):171\u2013176","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2200-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2200-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2200-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2200-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:46:18Z","timestamp":1559079978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2200-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,27]]},"references-count":48,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2200"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2200-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,5,27]]}}}