{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:54:53Z","timestamp":1760709293791},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T00:00:00Z","timestamp":1491436800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Yunnan Power Grid Co. Ltd science fund","award":["YNKL00000096"],"award-info":[{"award-number":["YNKL00000096"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11277-017-4107-5","type":"journal-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T07:53:26Z","timestamp":1491465206000},"page":"2345-2357","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Hybrid Differential Evolution Optimization for the Vehicle Routing Problem with Time Windows and Driver-Specific Times"],"prefix":"10.1007","volume":"95","author":[{"given":"Enlai","family":"Pu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongliang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,6]]},"reference":[{"key":"4107_CR1","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.asoc.2015.03.026","volume":"32","author":"J Brito","year":"2015","unstructured":"Brito, J., Mart\u00ednez, F. J., Moreno, J. A., et al. (2015). An ACO hybrid metaheuristic for close\u2013open vehicle routing problems with time windows and fuzzy constraints. Applied Soft Computing, 32, 154\u2013163.","journal-title":"Applied Soft Computing"},{"issue":"3","key":"4107_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S1007-0214(09)70058-6","volume":"14","author":"ZG Dan","year":"2009","unstructured":"Dan, Z. G., Cai, L. N., & Zheng, L. (2009). Improved multi-agent system for the vehicle routing problem with time windows. Tsinghua Sci. Technol., 14(3), 407\u2013412.","journal-title":"Tsinghua Sci. Technol."},{"key":"4107_CR3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cor.2015.11.012","volume":"69","author":"T Vidal","year":"2016","unstructured":"Vidal, T. (2016). Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem. Computers & Operations Research, 69, 40\u201347.","journal-title":"Computers & Operations Research"},{"key":"4107_CR4","doi-asserted-by":"crossref","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.G., & Solomon, M. (2005). Vehicle routing problem with time windows. In Column generation (pp. 67\u201398). Springer.","DOI":"10.1007\/0-387-25486-2_3"},{"issue":"2","key":"4107_CR5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"RA Russell","year":"1995","unstructured":"Russell, R. A. (1995). Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science, 29(2), 156\u2013166.","journal-title":"Transportation Science"},{"key":"4107_CR6","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","volume":"252","author":"G Hiermann","year":"2016","unstructured":"Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016). The electric fleet size and mix vehicle routing problem with time windows and recharging stations. European Journal of Operational Research, 252, 995\u20131018.","journal-title":"European Journal of Operational Research"},{"key":"4107_CR7","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"P Augerat","year":"1998","unstructured":"Augerat, P., Belenguer, J. M., Benavent, E., Corberin, A., & Naddef, D. (1998). Separating capacity constraints in the CVRP using Tabu search. European Journal of Operational Research, 106, 546\u2013557.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4107_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J. Y., Kervahut, T., Garcia, B. L., & Rousseau, J. M. (1996). The vehicle routing problem with time windows. Part I: Tabu search. INFORMS Journal on Computing, 8(2), 158\u2013164.","journal-title":"INFORMS Journal on Computing"},{"issue":"1999","key":"4107_CR9","first-page":"1804","volume":"3","author":"XY Yin","year":"1999","unstructured":"Yin, X. Y., & Yuan, Z. Y. (1999). Multiple vehicle routing with time windows using genetic algorithms. Proceedings of Evolutionary Computation. CEC, 3(1999), 1804\u20131808.","journal-title":"Proceedings of Evolutionary Computation. CEC"},{"issue":"5","key":"4107_CR10","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"J Ai","year":"2009","unstructured":"Ai, J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36(5), 1693\u20131702.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"4107_CR11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0377-2217(83)90199-6","volume":"12","author":"OBG Madsen","year":"1983","unstructured":"Madsen, O. B. G. (1983). Methods for solving combined two level location routing problems of realistic dimension. European Journal of Operational Research, 12(3), 295\u2013301.","journal-title":"European Journal of Operational Research"},{"key":"4107_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Oper. Res. Q., 20, 309\u2013318.","journal-title":"Oper. Res. Q."},{"issue":"3","key":"4107_CR13","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","volume":"179","author":"S Barreto","year":"2007","unstructured":"Barreto, S., Ferreira, C., Paixao, J., & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968\u2013977.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4107_CR14","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., & Cerda, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478\u20131507.","journal-title":"European Journal of Operational Research"},{"key":"4107_CR15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","volume":"116","author":"D Tuzun","year":"1999","unstructured":"Tuzun, D., & Burke, L. I. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116, 87\u201399.","journal-title":"European Journal of Operational Research"},{"key":"4107_CR16","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1016\/j.ejor.2005.10.017","volume":"177","author":"R Caballero","year":"2007","unstructured":"Caballero, R., Gonz\u00e1lez, M., Guerrero, F. M., Molina, J., & Paralera, C. (2007). Solving a multiobjective location routing problem with a metaheuristic based on a tabu search. Application to a real case in Andalusia. European Journal of Operational Research, 177, 1751\u20131763.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"4107_CR17","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C Prins","year":"2007","unstructured":"Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler-Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470\u2013483.","journal-title":"Transportation Science"},{"key":"4107_CR18","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"TH Wu","year":"2002","unstructured":"Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research, 29, 1393\u20131415.","journal-title":"Computers & Operations Research"},{"key":"4107_CR19","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/11892960_50","volume":"4251","author":"L Bouhafs","year":"2006","unstructured":"Bouhafs, L., Hajjam, A., & Koukam, A. (2006). A combination of simulated annealing and ant colony system for the capacitated location-routing problem. Knowledge-Based and Intelligent Information and Engineering Systems LNCS, 4251, 409\u2013416.","journal-title":"Knowledge-Based and Intelligent Information and Engineering Systems LNCS"},{"issue":"3","key":"4107_CR20","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1016\/j.ejor.2004.10.032","volume":"175","author":"CKY Lin","year":"2006","unstructured":"Lin, C. K. Y., & Kwok, R. C. W. (2006). Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. European Journal of Operational Research, 175(3), 1833\u20131849.","journal-title":"European Journal of Operational Research"},{"key":"4107_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., & Wolfler-Calvo, R. (2006). Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research, 4, 221\u2013238.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"1","key":"4107_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/13675560701410144","volume":"11","author":"Y Marinakis","year":"2008","unstructured":"Marinakis, Y., & Marinaki, M. (2008). A bilevel genetic algorithm for a real life location routing problem. International Journal of Logistics: Research and Applications, 11(1), 49\u201365.","journal-title":"International Journal of Logistics: Research and Applications"},{"key":"4107_CR23","unstructured":"Prins, C., Prodhon, C., & Wolfler-Calvo, R. (2006) A memetic algorithm with population management (MAPM) for the capacitated location-routing problem. In J. Gottlieb, & G. R. Raidl (Eds.), EvoCOP 2006, LNCS, 3906. Springer, Berlin, pp. 183\u2013194."},{"key":"4107_CR24","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C Duhamel","year":"2010","unstructured":"Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP\u00a0\u00d7\u00a0ELS approach for the capacitated location-routing problem. Computers & Operations Research, 37, 1912\u20131923.","journal-title":"Computers & Operations Research"},{"key":"4107_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-013-9230-1","volume":"20","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Cordeau, J. F., & Gendron, B. (2014). A GRASP\u00a0+\u00a0ILP-based metaheuristic for the capacitated location-routing problem. Journal of Heuristics, 20, 1\u201338.","journal-title":"Journal of Heuristics"},{"key":"4107_CR26","unstructured":"Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2008) A memetic approach for the capacitated location routing problem. In EU\/meeting 2008, Troyes, France."},{"issue":"5\u20136","key":"4107_CR27","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10732-005-3601-1","volume":"11","author":"J Melechovsky","year":"2005","unstructured":"Melechovsky, J., Prins, C., & Wolfler-Calvo, R. (2005). A metaheuristic to solve a location routing problem with non-linear costs. Journal of Heuristics, 11(5\u20136), 375\u2013391.","journal-title":"Journal of Heuristics"},{"key":"4107_CR28","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","volume":"38","author":"JM Belenguer","year":"2011","unstructured":"Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Wolfler-Calvo, R. (2011). A branchand-cut method for the capacitated location-routing problem. Computers & Operations Research, 38, 931\u2013941.","journal-title":"Computers & Operations Research"},{"key":"4107_CR29","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/11892960_50","volume":"4251","author":"L Bouhafs","year":"2006","unstructured":"Bouhafs, L., Hajjam, A., & Koukam, A. (2006). A combination of simulated annealing and ant colony system for the capacitated location-routing problem. Knowledge-Based and Intelligent Information and Engineering Systems LNCS, 4251, 409\u2013416.","journal-title":"Knowledge-Based and Intelligent Information and Engineering Systems LNCS"},{"key":"4107_CR30","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ijpe.2012.06.011","volume":"141","author":"CJ Ting","year":"2013","unstructured":"Ting, C. J., & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics, 141, 34\u201344.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"4107_CR31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10852-007-9073-6","volume":"7","author":"Y Marinakis","year":"2008","unstructured":"Marinakis, Y., & Marinaki, M. (2008). A particle swarm optimization algorithm with path elinking for the location routing problem. Journal of Mathematical Modelling and Algorithms, 7(1), 59\u201378.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"4107_CR32","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Marinaki, M., & Matsatsinis, N. (2008). Honey bees mating optimization for the location routing problem. In IEEE international engineering management conference (IEMC-Europe 2008), Estoril, Portugal.","DOI":"10.1109\/IEMCE.2008.4618013"},{"key":"4107_CR33","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy, J., & Eberhart, R. C. (2001). Swarm intelligence. San Francisco: Morgan Kaufmann."},{"key":"4107_CR34","first-page":"32","volume":"22","author":"XL Li","year":"2002","unstructured":"Li, X. L., Shao, Z. J., & Qian, J. X. (2002). An optimizing method based on autonomous animates: Fish-swarm algorithm. Systems Engineering Theory and Practice, 22, 32\u201338.","journal-title":"Systems Engineering Theory and Practice"},{"key":"4107_CR35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: From natural to artificial system","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: From natural to artificial system. New York, NY: Oxford University Press."},{"key":"4107_CR36","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., & Akay, B. (2009). A comparative study of artificial bee colony algorithm. Applied Math and Computation, 214, 108\u2013132.","journal-title":"Applied Math and Computation"},{"issue":"4","key":"4107_CR37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., & Price, K. (1997). Differential evolution\u2014A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4), 341\u2013359.","journal-title":"Journal of Global Optimization"},{"key":"4107_CR38","unstructured":"Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2004). Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. In Proceedings of 4th international symposium on intelligent manufacturing systems, Sakarya, Turkey, pp. 442\u2013452."},{"key":"4107_CR39","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.cie.2015.04.012","volume":"85","author":"AW Mohamed","year":"2015","unstructured":"Mohamed, A. W. (2015). An improved differential evolution algorithm with triangular mutation for global numerical optimization. Computers & Industrial Engineering, 85, 359\u2013375.","journal-title":"Computers & Industrial Engineering"},{"key":"4107_CR40","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4107-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4107-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4107-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T07:36:16Z","timestamp":1658907376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4107-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,6]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["4107"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4107-5","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,6]]}}}