{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:12:53Z","timestamp":1758845573206,"version":"3.41.0"},"publisher-location":"Cham","reference-count":79,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319302331"},{"type":"electronic","value":"9783319302355"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30235-5_2","type":"book-chapter","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T13:34:01Z","timestamp":1458394441000},"page":"21-41","source":"Crossref","is-referenced-by-count":27,"title":["An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Eneko","family":"Osaba","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Carballedo","sequence":"additional","affiliation":[]},{"given":"Xin-She","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Diaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Soonpracha, K., Mungwattana, A., Manisri, T.: A re-constructed meta-heuristic algorithm for robust fleet size and mix vehicle routing problem with time windows under uncertain demands. In: Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 347\u2013361, Springer (2015)","DOI":"10.1007\/978-3-319-13356-0_28"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Wen, Z., Dong, X., Han, S.: An iterated local search for the split delivery vehicle routing problem. In: International Conference on Computer Information Systems and Industrial Applications, Atlantis Press (2015)","DOI":"10.2991\/cisia-15.2015.12"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J. Heuristics 20(5), 483\u2013509 (2014)","journal-title":"J. Heuristics"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin, C., Choy, K.L., Ho, G.T., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4), 1118\u20131138 (2014)","journal-title":"Expert Syst. Appl."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15, 169\u2013176 (2014)","journal-title":"Appl. Soft Comput."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Coelho, L.C., Renaud, J., Laporte, G.: Road-based goods transportation: a survey of real-world applications from 2000 to 2015. Technical report, Technical Report FSA-2015-007, Qu\u00e9bec, Canada (2015)","DOI":"10.1080\/03155986.2016.1167357"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. Soc. Ind. Appl. Math. (2015)","DOI":"10.1137\/1.9781611973594"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/1.9781611973594.ch4","volume":"18","author":"G Laporte","year":"2014","unstructured":"Laporte, G., Ropke, S., Vidal, T.: Heuristics for the vehicle routing problem. Veh. Routing Prob. Methods Appl. 18, 87 (2014)","journal-title":"Veh. Routing Prob. Methods Appl."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"key":"2_CR10","unstructured":"Lawler, E.L.: The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-interscience series in discrete mathematics (1985)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2_CR13","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. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search, part i. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"4598","key":"2_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simmulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoret. Comput. Sci. 344(2), 243\u2013278 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR17","unstructured":"Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional (1989)"},{"key":"2_CR18","unstructured":"De Jong, K.: Analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Michigan, USA (1975)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R., et al.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948, Perth, Australia (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Rodriguez, A., Gutierrez, A., Rivera, L., Ramirez, L.: Rwa: Comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced Computer and Communication Engineering Technology, pp. 3\u201314, Springer (2015)","DOI":"10.1007\/978-3-319-07674-4_1"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Cao, B., Glover, F., Rego, C.: A tabu search algorithm for cohesive clustering problems. J. Heuristics 1\u201321 (2015)","DOI":"10.1007\/s10732-015-9285-2"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.asoc.2014.11.060","volume":"28","author":"T \u0130nkaya","year":"2015","unstructured":"\u0130nkaya, T., Kayal\u0131gil, S., \u00d6zdemirel, N.E.: Ant colony optimization based clustering methodology. Appl. Soft Comput. 28, 301\u2013311 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"2_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via l\u00e9vy flights. In: IEEE World Congress on Nature & Biologically Inspired Computing, pp. 210\u2013214 (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"4","key":"2_CR25","first-page":"330","volume":"1","author":"XS Yang","year":"2010","unstructured":"Yang, X.S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330\u2013343 (2010)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"13","key":"2_CR26","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Inf. Sci. 179(13), 2232\u20132248 (2009)","journal-title":"Inf. Sci."},{"key":"2_CR27","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang, X.S.: Nature-inspired metaheuristic algorithms. Luniver press, Bristol (2008)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Fister, I., Yang, X.S., Fister, D., Fister Jr, I.: Firefly algorithm: a brief review of the expanding literature. In: Cuckoo Search and Firefly Algorithm, pp. 347\u2013360, Springer (2014)","DOI":"10.1007\/978-3-319-02141-6_17"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Fister, I., Fister Jr, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. (2013)","DOI":"10.1016\/j.swevo.2013.06.001"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Ma, Y., Zhao, Y., Wu, L., He, Y., Yang, X.S.: Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm. Neurocomputing (2015)","DOI":"10.1016\/j.neucom.2015.01.028"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.ijepes.2014.09.008","volume":"64","author":"RH Liang","year":"2015","unstructured":"Liang, R.H., Wang, J.C., Chen, Y.T., Tseng, W.T.: An enhanced firefly algorithm to multi-objective optimal active\/reactive power dispatch with uncertainties consideration. Int. J. Electr. Power Energy Syst. 64, 1088\u20131097 (2015)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Zouache, D., Nouioua, F., Moussaoui, A.: Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput. 1\u201319 (2015)","DOI":"10.1007\/s00500-015-1681-x"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Metaheuristic optimization: algorithm analysis and open problems. In: Experimental Algorithms, pp. 21\u201332, Springer (2011)","DOI":"10.1007\/978-3-642-20662-7_2"},{"issue":"2","key":"2_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1166\/jctn.2012.2012","volume":"9","author":"XS Yang","year":"2012","unstructured":"Yang, X.S.: Efficiency analysis of swarm intelligence and randomization techniques. J. Comput. Theoret. Nanosci. 9(2), 189\u2013198 (2012)","journal-title":"J. Comput. Theoret. Nanosci."},{"issue":"2","key":"2_CR35","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.swevo.2011.05.005","volume":"1","author":"S Das","year":"2011","unstructured":"Das, S., Maity, S., Qu, B.Y., Suganthan, P.N.: Real-parameter evolutionary multimodal optimizationa survey of the state-of-the-art. Swarm Evol. Comput. 1(2), 71\u201388 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications, pp. 169\u2013178, Springer (2009)","DOI":"10.1007\/978-3-642-04944-6_14"},{"issue":"1","key":"2_CR37","first-page":"1","volume":"1","author":"M Sayadi","year":"2010","unstructured":"Sayadi, M., Ramezanian, R., Ghaffari-Nasab, N.: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int. J. Ind. Eng. Comput. 1(1), 1\u201310 (2010)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Abedinia, O., Amjady, N., Naderi, M.S.: Multi-objective environmental\/economic dispatch using firefly technique. In: IEEE International Conference on Environment and Electrical Engineering, pp. 461\u2013466 (2012)","DOI":"10.1109\/EEEIC.2012.6221422"},{"key":"2_CR39","unstructured":"Zhang, Y., Wu, L.: A novel method for rigid image registration based on firefly algorithm. Int. J. Res. Rev. Soft Intell. Comput. (IJRRSIC) 2(2), 141\u2013146 (2012)"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2528\/PIERB11053108","volume":"32","author":"B Basu","year":"2011","unstructured":"Basu, B., Mahanti, G.K.: Fire fly and artificial bees colony algorithm for synthesis of scanned and broadside linear array antenna. Prog. Electromagnet. Res. B 32, 169\u2013190 (2011)","journal-title":"Prog. Electromagnet. Res. B"},{"issue":"5","key":"2_CR41","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1002\/tal.1043","volume":"23","author":"S Talatahari","year":"2014","unstructured":"Talatahari, S., Gandomi, A.H., Yun, G.J.: Optimum design of tower structures using firefly algorithm. Struct. Des. Tall Spec. Buildings 23(5), 350\u2013361 (2014)","journal-title":"Struct. Des. Tall Spec. Buildings"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Jakimovski, B., Meyer, B., Maehle, E.: Firefly flashing synchronization as inspiration for self-synchronization of walking robot gait patterns using a decentralized robot control architecture. In: Architecture of Computing Systems-ARCS 2010, pp. 61\u201372, Springer (2010)","DOI":"10.1007\/978-3-642-11950-7_7"},{"key":"2_CR43","unstructured":"Pop, C.B., Rozina Chifu, V., Salomie, I., Baico, R.B., Dinsoreanu, M., Copil, G.: A hybrid firefly-inspired approach for optimal semantic web service composition. Scalable Comput. Pract. Exp. 12(3), 363\u2013370 (2011)"},{"issue":"12","key":"2_CR44","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1016\/j.cherd.2012.04.011","volume":"90","author":"SEK Fateen","year":"2012","unstructured":"Fateen, S.E.K., Bonilla-Petriciolet, A., Rangaiah, G.P.: Evaluation of covariance matrix adaptation evolution strategy, shuffled complex evolution and firefly algorithms for phase stability, phase equilibrium and chemical equilibrium problems. Chem. Eng. Res. Des. 90(12), 2051\u20132071 (2012)","journal-title":"Chem. Eng. Res. Des."},{"issue":"3","key":"2_CR45","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/17415977.2012.712531","volume":"21","author":"Ariane F. dos Santos","year":"2013","unstructured":"Santos, A.F., Campos Velho, H.F., Luz, E.F., Freitas, S.R., Grell, G., Gan, M.A.: Firefly optimization to determine the precipitation field on south america. Inverse Prob. Sci. Eng. 21(3), 451\u2013466 (2013)","journal-title":"Inverse Problems in Science and Engineering"},{"key":"2_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2012\/467631","volume":"2012","author":"Surafel Luleseged Tilahun","year":"2012","unstructured":"Tilahun, S.L., Ong, H.C.: Modified firefly algorithm. J. Appl. Math. 2012, 1\u201312 (2012)","journal-title":"Journal of Applied Mathematics"},{"issue":"1","key":"2_CR47","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.cnsns.2012.06.009","volume":"18","author":"A Gandomi","year":"2013","unstructured":"Gandomi, A., Yang, X.S., Talatahari, S., Alavi, A.: Firefly algorithm with chaos. Commun. Nonlinear Sci. Numer. Simul. 18(1), 89\u201398 (2013)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Coelho, L.D.S., de Andrade Bernert, D.L., Mariani, V.C.: A chaotic firefly algorithm applied to reliability-redundancy optimization. In: IEEE Congress on Evolutionary Computation, IEEE, pp. 517\u2013521 (2011)","DOI":"10.1109\/CEC.2011.5949662"},{"key":"2_CR49","unstructured":"Subutic, M., Tuba, M., Stanarevic, N.: Parallelization of the firefly algorithm for unconstrained optimization problems. Latest Adv. Inf. Sci. Appl. 22, 264\u2013269 (2012)"},{"key":"2_CR50","unstructured":"Husselmann, A.V., Hawick, K.: Parallel parametric optimisation with firefly algorithms on graphical processing units. In: Proceedings International Conference on Genetic and Evolutionary Methods, pp. 77\u201383 (2012)"},{"issue":"S12","key":"2_CR51","first-page":"97","volume":"8","author":"SM Farahani","year":"2012","unstructured":"Farahani, S.M., Abshouri, A.A., Nasiri, B., Meybodi, M.: Some hybrid models to improve firefly algorithm performance. Int. J. Artif. Intell. 8(S12), 97\u2013117 (2012)","journal-title":"Int. J. Artif. Intell."},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Luthra, J., Pal, S.K.: A hybrid firefly algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher. In: IEEE World Congress on Information and Communication Technologies, pp. 202\u2013206 (2011)","DOI":"10.1109\/WICT.2011.6141244"},{"issue":"6","key":"2_CR53","first-page":"10","volume":"30","author":"R Aruchamy","year":"2011","unstructured":"Aruchamy, R., Vasantha, K.: A comparative performance study on hybrid swarm model for micro array data. Int. J. Comput. Appl. 30(6), 10\u201314 (2011)","journal-title":"Int. J. Comput. Appl."},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Hassanzadeh, T., Faez, K., Seyfi, G.: A speech recognition system based on structure equivalent fuzzy neural network trained by firefly algorithm. In: IEEE International Conference on Biomedical Engineering, pp. 63\u201367 (2012)","DOI":"10.1109\/ICoBE.2012.6178956"},{"key":"2_CR55","unstructured":"Durkota, K.: Implementation of a discrete firefly algorithm for the qap problem within the sage framework. BSc thesis, Czech Technical University (2011)"},{"issue":"2","key":"2_CR56","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TEVC.2013.2240304","volume":"18","author":"MK Marichelvam","year":"2014","unstructured":"Marichelvam, M.K., Prabaharan, T., Yang, X.S.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. EEE Trans. Evol. Comput. 18(2), 301\u2013305 (2014)","journal-title":"EEE Trans. Evol. Comput."},{"key":"2_CR57","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/978-3-642-23857-4_38","volume-title":"Adaptive and Intelligent Systems","author":"Gilang Kusuma Jati","year":"2011","unstructured":"Jati, G.K., et al.: Evolutionary discrete firefly algorithm for travelling salesman problem. In: Adaptive and Intelligent Systems (2011)"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Zhou, L., Ding, L., Qiang, X.: A multi-population discrete firefly algorithm to solve tsp. In: Bio-Inspired Computing-Theories and Applications, pp. 648\u2013653, Springer (2014)","DOI":"10.1007\/978-3-662-45049-9_106"},{"key":"2_CR59","unstructured":"Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Les Cahiers du GERAD G-2014-110, GERAD, Montr\u00e9al, Canada (2014)"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2_CR61","doi-asserted-by":"crossref","first-page":"52","DOI":"10.12720\/jtle.2.1.52-58","volume":"2","author":"Nihat Engin Toklu","year":"2014","unstructured":"Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logist. Eng. 2(1), 5\u20138 (2014)","journal-title":"Journal of Traffic and Logistics Engineering"},{"issue":"4","key":"2_CR62","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10732-014-9244-3","volume":"20","author":"PK Nguyen","year":"2014","unstructured":"Nguyen, P.K., Crainic, T.G., Toulouse, M.: A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J. Heuristics 20(4), 383\u2013416 (2014)","journal-title":"J. Heuristics"},{"key":"2_CR63","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M.: Vehicle Routing Problem with Time Windows. Springer, New York (2005)"},{"key":"2_CR64","unstructured":"Gendreau, M., Tarantilis, C.D.: Solving large-scale vehicle routing problems with time windows: The state-of-the-art, Cirrelt (2010)"},{"issue":"2","key":"2_CR65","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part ii: genetic search. INFORMS J. Comput. 8(2), 165\u2013172 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2_CR66","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"2_CR67","doi-asserted-by":"crossref","unstructured":"Afifi, S., Guibadj, R.N., Moukrim, A.: New lower bounds on the number of vehicles for the vehicle routing problem with time windows. In: Integration of AI and OR Techniques in Constraint Programming, pp. 422\u2013437, Springer (2014)","DOI":"10.1007\/978-3-319-07046-9_30"},{"issue":"3","key":"2_CR68","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","volume":"40","author":"A Agra","year":"2013","unstructured":"Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3), 856\u2013866 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2_CR69","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"178","author":"N Azi","year":"2007","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178(3), 755\u2013766 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR70","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02579017","volume":"10","author":"O Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. Top 10(2), 211\u2013237 (2002)","journal-title":"Top"},{"key":"2_CR71","first-page":"157","volume":"9","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: Vrp with time windows. Veh. Routing Prob. 9, 157\u2013193 (2001)","journal-title":"Veh. Routing Prob."},{"issue":"1","key":"2_CR72","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"issue":"3","key":"2_CR73","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","volume":"27","author":"C Rego","year":"2001","unstructured":"Rego, C.: Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3), 201\u2013222 (2001)","journal-title":"Parallel Comput."},{"issue":"5","key":"2_CR74","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Yuichi Nagata","year":"2009","unstructured":"Nagata, Y., Brysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37(5), 333\u2013338 (2009)","journal-title":"Operations Research Letters"},{"issue":"2","key":"2_CR75","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/ijoc.1070.0239","volume":"20","author":"S Irnich","year":"2008","unstructured":"Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270\u2013287 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"2_CR76","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion Heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369\u2013378 (2004)","journal-title":"Transp. Sci."},{"issue":"2","key":"2_CR77","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"2_CR78","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"2_CR79","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10489-013-0512-y","volume":"41","author":"E Osaba","year":"2014","unstructured":"Osaba, E., Diaz, F., Onieva, E.: Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41(1), 145\u2013166 (2014)","journal-title":"Appl. Intell."}],"container-title":["Studies in Computational Intelligence","Nature-Inspired Computation in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30235-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:21:35Z","timestamp":1748812895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30235-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319302331","9783319302355"],"references-count":79,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30235-5_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2016]]}}}