{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:08:35Z","timestamp":1779887315191,"version":"3.53.1"},"reference-count":106,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:00:00Z","timestamp":1589932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00521-020-04983-8","type":"journal-article","created":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T21:02:27Z","timestamp":1590008547000},"page":"409-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Spiking neural firefly optimization scheme for the capacitated dynamic vehicle routing problem with time windows"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4302-9327","authenticated-orcid":false,"given":"Resmi","family":"RamachandranPillai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Arock","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,20]]},"reference":[{"key":"4983_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-540-92910-9_14","volume-title":"Handbook of natural computing","year":"2012","unstructured":"Rozenberg G, B\u00e4ck T, Kok JN (eds) (2012) Handbook of natural computing. Springer, Berlin, pp 461\u2013477"},{"issue":"5","key":"4983_CR2","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0731-7085(99)00272-1","volume":"22","author":"S Agatonovic-Kustrin","year":"2000","unstructured":"Agatonovic-Kustrin S, Beresford R (2000) Basic concepts of artificial neural network (ANN) modeling and its application in pharmaceutical research. J Pharm Biomed Anal 22(5):717\u2013727. https:\/\/doi.org\/10.1016\/S0731-7085(99)00272-1","journal-title":"J Pharm Biomed Anal"},{"key":"4983_CR3","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/528069","author":"Y Zhang","year":"2013","unstructured":"Zhang Y, Agarwal P, Bhatnagar V, Balochian S, Yan J (2013) Swarm intelligence and its applications. Sci World J. https:\/\/doi.org\/10.1155\/2013\/528069","journal-title":"Sci World J"},{"key":"4983_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1124","author":"T Bartz-Beielstein","year":"2014","unstructured":"Bartz-Beielstein T, Branke J, Mehnen J, Mersmann O (2014) Evolutionary algorithms. Wiley Interdiscip Rev Data Min Knowl Discov. https:\/\/doi.org\/10.1002\/widm.1124","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"4983_CR5","volume-title":"Quantum computing","author":"J Gruska","year":"1999","unstructured":"Gruska J (1999) Quantum computing, vol 2005. McGraw-Hill, London"},{"issue":"6","key":"4983_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jlap.2010.04.002","volume":"79","author":"G P\u0103un","year":"2010","unstructured":"P\u0103un G (2010) A quick introduction to membrane computing. J Logic Algebr Program 79(6):291\u2013294. https:\/\/doi.org\/10.1016\/j.jlap.2010.04.002","journal-title":"J Logic Algebr Program"},{"issue":"73","key":"4983_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0304-3975(02)00136-6","volume":"287","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un G, Rozenberg G (2002) A guide to membrane computing. Theor Comput Sci 287(73):100\u20133975. https:\/\/doi.org\/10.1016\/S0304-3975(02)00136-6","journal-title":"Theor Comput Sci"},{"key":"4983_CR8","doi-asserted-by":"publisher","first-page":"e0162882","DOI":"10.1371\/journal.pone.0162882","volume":"11","author":"Y Zhao","year":"2016","unstructured":"Zhao Y, Liu X, Wang W (2016) Spiking neural P systems with neuron division and dissolution. PLoS ONE 11:e0162882. https:\/\/doi.org\/10.1371\/journal.pone.0162882","journal-title":"PLoS ONE"},{"key":"4983_CR9","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1007\/s11432-011-4303-y","volume":"54","author":"L Pan","year":"2011","unstructured":"Pan L, P\u0103un G, P\u00e9rez-Jim\u00e9nez M (2011) Spiking neural P systems with neuron division and budding. Science China. Inf Sci 54:1596\u20131607. https:\/\/doi.org\/10.1007\/s11432-011-4303-y","journal-title":"Inf Sci"},{"key":"4983_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.biosystems.2018.05.004","volume":"169\u2013170","author":"X Song","year":"2018","unstructured":"Song X, Wang J, Peng H, Ning G, Sun Z, Wang T, Yang F (2018) Spiking neural P systems with multiple channels and anti-spikes. Biosystems 169\u2013170:13\u201319. https:\/\/doi.org\/10.1016\/j.biosystems.2018.05.004","journal-title":"Biosystems"},{"key":"4983_CR11","first-page":"141","volume":"75","author":"H Chen","year":"2007","unstructured":"Chen H, Freund R, Ionescu M, Paun G, P\u00e9rez-Jim\u00e9nez M (2007) On string languages generated by spiking neural P systems. Fundam Inform 75:141\u2013162","journal-title":"Fundam Inform"},{"key":"4983_CR12","doi-asserted-by":"publisher","first-page":"1440006","DOI":"10.1142\/S0129065714400061","volume":"24","author":"G Zhang","year":"2014","unstructured":"Zhang G, Rong H, Neri F, P\u00e9rez-Jim\u00e9nez M (2014) An optimization spiking neural P system for approximately solving combinatorial optimization problems. Int J Neural Syst 24:1440006. https:\/\/doi.org\/10.1142\/S0129065714400061","journal-title":"Int J Neural Syst"},{"key":"4983_CR13","first-page":"411","volume":"5","author":"M Garc\u00eda-Arnau","year":"2009","unstructured":"Garc\u00eda-Arnau M, P\u00e9rez D, Rodr\u00edguez-Pat\u00f3n A, Sos\u00edk P (2009) Spiking neural P systems: stronger normal forms. IJUC 5:411\u2013425","journal-title":"IJUC"},{"key":"4983_CR14","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Jim\u00e9nez MJ (2010) A computational complexity theory in membrane computing. In: WMC 2009. Lecture notes in computer science, vol 5957. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-11467-0_10","DOI":"10.1007\/978-3-642-11467-0_10"},{"key":"4983_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2489-z","author":"Z Chen","year":"2016","unstructured":"Chen Z, Zhang P, Wang X, Shi X, Wu T, Zheng P (2016) A computational approach for nuclear export signals identification using spiking neural P systems. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-016-2489-z","journal-title":"Neural Comput Appl"},{"key":"4983_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.07.007","author":"D D\u00edaz-Pernil","year":"2017","unstructured":"D\u00edaz-Pernil D, Guti\u00e9rrez-Naranjo M (2017) Semantics of deductive databases with spiking neural P systems. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2017.07.007","journal-title":"Neurocomputing"},{"key":"4983_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.02.009","author":"C Diaz","year":"2017","unstructured":"Diaz C, Frias T, Sanchez G, Perez-Meana H, Toscano K, Duchen G (2017) A novel parallel multiplier using spiking neural P systems with dendritic delays. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2017.02.009","journal-title":"Neurocomputing"},{"key":"4983_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2017.12.015","volume":"724","author":"W Tingfang","year":"2018","unstructured":"Tingfang W, Wang Y, Jiang S, Yansen S, Shi X (2018) Spiking neural P systems with rules on synapses and anti-spikes. Theor Comput Sci 724:13\u201327. https:\/\/doi.org\/10.1016\/j.tcs.2017.12.015","journal-title":"Theor Comput Sci"},{"key":"4983_CR19","doi-asserted-by":"crossref","unstructured":"Deb K (2014) Multi-objective optimization. In: Search methodologies. Springer, Boston, pp 403\u2013449","DOI":"10.1007\/978-1-4614-6940-7_15"},{"key":"4983_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s12293-013-0128-0","volume":"6","author":"JC Bansal","year":"2014","unstructured":"Bansal JC, Sharma H, Jadon SS et al (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6:31. https:\/\/doi.org\/10.1007\/s12293-013-0128-0","journal-title":"Memet Comput"},{"key":"4983_CR21","unstructured":"Brownlee J (2011) Clever algorithms: nature-inspired programming recipes, Lulu.com"},{"key":"4983_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"4983_CR23","doi-asserted-by":"publisher","unstructured":"Zmazek B, Taranenko A, Smid M (2005) Capacitated VRP with time windows and multiple trips within working day, pp 104\u2013109. https:\/\/doi.org\/10.1109\/iti.2005.1491105","DOI":"10.1109\/iti.2005.1491105"},{"key":"4983_CR24","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1016\/j.procs.2015.05.501","volume":"51","author":"Pedro JS Cardoso","year":"2015","unstructured":"Cardoso Pedro JS, Sch\u00fctz G, Mazayev A, Ey E, Corr\u00eaa T (2015) A Solution for a Real-time Stochastic Capacitated Vehicle Routing Problem with Time Windows. Procedia Computer Science 51:2227\u20132236. https:\/\/doi.org\/10.1016\/j.procs.2015.05.501","journal-title":"Procedia Computer Science"},{"key":"4983_CR25","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) Stochastic algorithms: foundations and applications. SAGA 2009. Lecture notes in computer science, vol 5792. Springer, Berlin","DOI":"10.1007\/978-3-642-04944-6_14"},{"issue":"23","key":"4983_CR26","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1016\/j.compstruc.2011.08.002","volume":"89","author":"A Gandomi","year":"2011","unstructured":"Gandomi A, Yang X, Alavi A (2011) Mixed variable structural optimization using firefly algorithm. Comput Struct 89(23):2325\u20132336","journal-title":"Comput Struct"},{"issue":"4","key":"4983_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1049\/iet-cvi.2012.0207","volume":"7","author":"M Gao","year":"2013","unstructured":"Gao M, He X, Luo D, Jiang J, Teng Q (2013) Object tracking using firefly algorithm. IET Comput Vis 7(4):227\u2013237","journal-title":"IET Comput Vis"},{"key":"4983_CR28","doi-asserted-by":"publisher","first-page":"105728","DOI":"10.1016\/j.asoc.2019.105728","volume":"84","author":"AM Altabeeb","year":"2019","unstructured":"Altabeeb AM, Mohsen AM, Ghallab A (2019) An improved hybrid firefly algorithm for capacitated vehicle routing problem. Appl Soft Comput 84:105728. https:\/\/doi.org\/10.1016\/j.asoc.2019.105728","journal-title":"Appl Soft Comput"},{"key":"4983_CR29","doi-asserted-by":"publisher","first-page":"5295","DOI":"10.1007\/s00500-016-2114-1","volume":"21","author":"E Osaba","year":"2017","unstructured":"Osaba E, Yang X, Diaz F et al (2017) A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Comput 21:5295\u20135308. https:\/\/doi.org\/10.1007\/s00500-016-2114-1","journal-title":"Soft Comput"},{"key":"4983_CR30","doi-asserted-by":"publisher","unstructured":"Aggarwal D, Chahar V, Girdhar A (2017) Firefly algorithm for the vehicle routing problem with time windows. https:\/\/doi.org\/10.1109\/icacci.2018.8554555","DOI":"10.1109\/icacci.2018.8554555"},{"key":"4983_CR31","doi-asserted-by":"publisher","unstructured":"Yesodha R, Amudha T (2019) An improved firefly algorithm for capacitated vehicle routing optimization. In: 2019 amity international conference on artificial intelligence (AICAI), Dubai, United Arab Emirates, pp 163\u2013169. https:\/\/doi.org\/10.1109\/aicai.2019.8701269","DOI":"10.1109\/aicai.2019.8701269"},{"issue":"4","key":"4983_CR32","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"issue":"6","key":"4983_CR33","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.trc.2008.07.002","volume":"17","author":"TG Crainic","year":"2009","unstructured":"Crainic TG, Gendreau M, Potvin J-Y (2009) Intelligent freight-transportation systems: assessment and the contribution of operations research. Transp Res Part C Emerg Technol 17(6):541\u2013557. https:\/\/doi.org\/10.1016\/j.trc.2008.07.002","journal-title":"Transp Res Part C: Emerg Technol"},{"key":"4983_CR34","doi-asserted-by":"crossref","unstructured":"Attanasio A, Bregman J, Ghiani G, Manni E (2007). Real-time fleet management at Ecourier Ltd. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management, volume 38 of operations research\/computer science interfaces, chapter 10, pp 219\u2013238. Springer, New York","DOI":"10.1007\/978-0-387-71722-7_10"},{"issue":"1","key":"4983_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1287\/trsc.36.1.21.570","volume":"36","author":"G Godfrey","year":"2002","unstructured":"Godfrey G, Powell WB (2002) An adaptive dynamic programming algorithm for dynamic fleet management, I: single period travel times. Transp Sci 36(1):21\u201339","journal-title":"Transp Sci"},{"key":"4983_CR36","doi-asserted-by":"crossref","unstructured":"Powell WB, Topaloglu H (2005) Fleet management. In: Wallace S, Ziemba W (eds) Applications of stochastic programming, volume 5 of MPS-SIAM series on optimization, chapter 12. SIAM, pp 185\u2013215","DOI":"10.1137\/1.9780898718799.ch12"},{"issue":"2","key":"4983_CR37","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/trsc.1080.0238","volume":"43","author":"H Simao","year":"2009","unstructured":"Simao H, Day J, George A, Gifford T, Nienow J, Powell WB (2009) An approximate dynamic programming algorithm for large-scale fleet management: a case application. Transp Sci 43(2):178\u2013197","journal-title":"Transp Sci"},{"issue":"5","key":"4983_CR38","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.tre.2006.03.001","volume":"43","author":"T Du","year":"2007","unstructured":"Du T, Wang FK, Lu P-Y (2007) A real-time vehicle-dispatching system for consolidating milk runs. Transp Res Part E Logist Transp Rev 43(5):565\u2013577. https:\/\/doi.org\/10.1016\/j.tre.2006.03.001","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"4983_CR39","doi-asserted-by":"publisher","first-page":"45","DOI":"10.3141\/1790-06","volume":"1790","author":"E Taniguchi","year":"2002","unstructured":"Taniguchi E, Thompson R (2002) Modeling city logistics. Transp Res Rec J Transp Res Board 1790(1):45\u201351","journal-title":"Transp Res Rec J Transp Res Board"},{"key":"4983_CR40","first-page":"163","volume-title":"Dynamic fleet management. Operations research\/computer science interfaces","author":"J Barcelo","year":"2007","unstructured":"Barcelo J, Grzybowska H, Pardo S (2007) Vehicle routing and scheduling models, simulation and city logistics. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management. Operations research\/computer science interfaces, vol 38. US, Springer, pp 163\u2013195"},{"key":"4983_CR41","doi-asserted-by":"crossref","unstructured":"Zeimpekis V, Minis I, Mamassis K, Giaglis GM (2007) Dynamic management of a delayed delivery vehicle in a city logistics environment. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management, volume 38 of operations research\/computer science interfaces series, chapter 9. Springer, New York, pp 197\u2013217","DOI":"10.1007\/978-0-387-71722-7_9"},{"issue":"3","key":"4983_CR42","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau M, Guertin F, Potvin J-Y, S\u00e9guin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-up sand deliveries. Transp Res Part C Emerg Technol 14(3):157\u2013174. https:\/\/doi.org\/10.1016\/j.trc.2006.03.002","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"4983_CR43","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tre.2008.08.003","volume":"45","author":"G Ghiani","year":"2009","unstructured":"Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for same-day courier dispatching. Transp Res Part E Logist Transp Rev 45(1):96\u2013106. https:\/\/doi.org\/10.1016\/j.tre.2008.08.003","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"4983_CR44","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-92944-4_3","volume-title":"Innovations in distribution logistics. Lecture notes in economics and mathematical systems","author":"T Bieding","year":"2009","unstructured":"Bieding T, G\u00f6rtz S, Klose A (2009) On line routing per mobile phone a case on subsequent deliveries of newspapers. In: Nunen JA, Speranza MG, Bertazzi L (eds) Innovations in distribution logistics. Lecture notes in economics and mathematical systems, vol 619. Berlin, Springer, pp 29\u201351"},{"issue":"3","key":"4983_CR45","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/trsc.1040.0105","volume":"39","author":"A Campbell","year":"2005","unstructured":"Campbell A, Savelsbergh M (2005) Decision support for consumer direct grocery initiatives. Transp Sci 39(3):313\u2013327","journal-title":"Transp Sci"},{"key":"4983_CR46","unstructured":"Ferrucci F, Bock S, Gendreau M (2011) Real-time distribution of perishable goods using past request information to anticipate future requests. Oper Res 34"},{"key":"4983_CR47","doi-asserted-by":"crossref","unstructured":"Azi N, Gendreau M, Potvin JY (2011) A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res 13 (in press)","DOI":"10.1007\/s10479-011-0991-3"},{"key":"4983_CR48","unstructured":"Balev S, Guinand F, Lesauvage G, Olivier D (2009) Dynamical handling of straddle carriers activities on a container terminal in uncertain environment\u2014a swarm intelligence approach. In: Proceedings of the 2009 international conference on complex systems and applications (ICCSA 2009), Le Havre, France. University of Le Havre"},{"issue":"1","key":"4983_CR49","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8\u201315. https:\/\/doi.org\/10.1016\/j.ejor.2009.04.024","journal-title":"Eur J Oper Res"},{"issue":"1","key":"4983_CR50","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TASE.2009.2016350","volume":"7","author":"N Smolic-Rocak","year":"2010","unstructured":"Smolic-Rocak N, Bogdan S, Kovacic Z, Petrovic T (2010) Time windows based dynamic routing in multi-agv systems. IEEE Trans Autom Sci Eng 7(1):151\u2013155. https:\/\/doi.org\/10.1109\/TASE.2009.2016350","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"4983_CR51","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.jbi.2009.02.003","volume":"42","author":"C Fiegl","year":"2009","unstructured":"Fiegl C, Pontow C (2009) Online scheduling of pick-up and delivery tasks in hospitals. J Biomed Inform 42(4):624\u2013632. https:\/\/doi.org\/10.1016\/j.jbi.2009.02.003","journal-title":"J Biomed Inform"},{"key":"4983_CR52","doi-asserted-by":"crossref","unstructured":"Caramia M, Italiano G, Oriolo G, Pacifici A, Perugia A (2002) Routing a fleet of vehicles for dynamic combined pick-up and deliveries services. In: Proceedings of the symposium on operation research 2001, Duisburg, Germany, pp 3\u20135","DOI":"10.1007\/978-3-642-50282-8_1"},{"key":"4983_CR53","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry A, Laporte G, Melo T, Nickel S (2010) Dynamic transportation of patients in hospitals. OR Spectrum 32:77\u2013107. https:\/\/doi.org\/10.1007\/s00291-008-0135-6","journal-title":"OR Spectrum"},{"key":"4983_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.04.033","author":"Y Kergosien","year":"2011","unstructured":"Kergosien Y, Lent\u00e9 C, Piton D, Billaut J-C (2011) A tabu search heuristic for the dynamic transportation of patients between care units. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2011.04.033","journal-title":"Eur J Oper Res"},{"key":"4983_CR55","doi-asserted-by":"crossref","unstructured":"Romero M, Sheremetov L, Soriano A (2007) A genetic algorithm for the pickup and delivery problem: an application to the helicopter offshore transportation. In: Theoretical advances and applications of fuzzy logic and soft computing, volume 42 of advances in soft computing. Springer, Berlin, pp 435\u2013444","DOI":"10.1007\/978-3-540-72434-6_43"},{"key":"4983_CR56","doi-asserted-by":"crossref","unstructured":"Powell WB (2007) Approximate dynamic programming: solving the curses of dimensionality, volume 703 of Wiley series in probability and statistics. Wiley, Hoboken","DOI":"10.1002\/9780470182963"},{"key":"4983_CR57","unstructured":"Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde, Glasgow, Scotland"},{"issue":"2","key":"4983_CR58","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/trsc.1030.0068","volume":"38","author":"J Yang","year":"2004","unstructured":"Yang J, Jaillet P, Mahmassani H (2004) Real-time multivehicle truckload pickup and delivery problems. Transp Sci 38(2):135\u2013148. https:\/\/doi.org\/10.1287\/trsc.1030.0068","journal-title":"Transp Sci"},{"issue":"1","key":"4983_CR59","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"Z Chen","year":"2006","unstructured":"Chen Z, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74\u201388","journal-title":"Transp Sci"},{"issue":"4","key":"4983_CR60","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Combin Optim 10(4):327\u2013343. https:\/\/doi.org\/10.1007\/s10878-005-4922-6","journal-title":"J Combin Optim"},{"key":"4983_CR61","unstructured":"Gambardella L, Rizzoli A, Oliverio F, Casagrande N, Donati A, Montemanni R, Lucibello E (2003) Ant colony optimization for vehicle routing in advanced logistics systems. In: Proceedings of the international workshop on modelling and applied simulation (MAS 2003), pp 3\u20139"},{"key":"4983_CR62","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11721-007-0005-x","volume":"1","author":"A Rizzoli","year":"2007","unstructured":"Rizzoli A, Montemanni R, Lucibello E, Gambardella L (2007) Ant colony optimization for real-world vehicle routing problems. Swarm Intell 1:135\u2013151","journal-title":"Swarm Intell"},{"issue":"1","key":"4983_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S03772217(00)00268-X","volume":"135","author":"ED Taillard","year":"2001","unstructured":"Taillard ED, Gambardella LM, Gendreau M, Potvin J-Y (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1\u201316. https:\/\/doi.org\/10.1016\/S03772217(00)00268-X","journal-title":"Eur J Oper Res"},{"issue":"4","key":"4983_CR64","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/trsc.34.4.426.12325","volume":"34","author":"S Ichoua","year":"2000","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2000) Diversion issues in real-time vehicle dispatching. Transp Sci 34(4):426\u2013438. https:\/\/doi.org\/10.1287\/trsc.34.4.426.12325","journal-title":"Transp Sci"},{"issue":"2","key":"4983_CR65","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396. https:\/\/doi.org\/10.1016\/S0377-2217(02)00147-9","journal-title":"Eur J Oper Res"},{"key":"4983_CR66","unstructured":"Romero M, Sheremetov L, Soriano A (2007) A genetic algorithm for the pickup and delivery problem: an application to the helicopter offshore transportation. In: Castillo O, Melin P, Ross OM, Sep\u00falveda Cruz R, Pedrycz W, Kacprzyk J (eds) Theoretical advances and applications of fuzzy logic and soft computing. Advances in soft computing, vol 42. Springer, Berlin"},{"issue":"1","key":"4983_CR67","doi-asserted-by":"publisher","first-page":"14656","DOI":"10.1016\/j.ifacol.2017.08.1906","volume":"50","author":"Z Al Chami","year":"2017","unstructured":"Al Chami Z, Manier H, Manier M-A, Fitouri C (2017) A hybrid genetic algorithm to solve a multi-objective Pickup and Delivery Problem. IFAC-Papers OnLine 50(1):14656\u201314661. https:\/\/doi.org\/10.1016\/j.ifacol.2017.08.1906","journal-title":"IFAC-Papers OnLine"},{"issue":"1","key":"4983_CR68","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1287\/inte.18.1.21","volume":"18","author":"WB Powell","year":"1988","unstructured":"Powell WB, Sheffi Y, Nickerson KS, Butterbaugh K, Atherton S (1988) Maximizing profits for North American Van Lines\u2019 truckload division: a new framework for pricing and operation. Interfaces 18(1):21\u201341","journal-title":"Interfaces"},{"issue":"4","key":"4983_CR69","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.1030.0071","volume":"38","author":"BW Thomas","year":"2004","unstructured":"Thomas BW, White CCI (2004) Anticipatory route selection. Transp Sci 38(4):473\u2013487. https:\/\/doi.org\/10.1287\/trsc.1030.0071","journal-title":"Transp Sci"},{"key":"4983_CR70","doi-asserted-by":"crossref","unstructured":"Powell WB, Bouzaiene-Ayari B, Simao H (2007) Dynamic models for freight transportation. In: Barnhart C, Laporte G (eds) Transportation, volume 14 of handbooks in operations research and management science, chapter 5. North-Holland, pp 285\u2013365","DOI":"10.1016\/S0927-0507(06)14005-0"},{"key":"4983_CR71","doi-asserted-by":"crossref","unstructured":"Yang S, Hamedi M, Haghani A (2005) Online dispatching and routing model for emergency vehicles with area coverage constraints. In: Network modeling 2005, number 1923 in transportation research record, pp 1\u20138","DOI":"10.1177\/0361198105192300101"},{"key":"4983_CR72","first-page":"133","volume-title":"Dynamic fleet management. Operations research\/computer science interfaces","author":"A Haghani","year":"2007","unstructured":"Haghani A, Yang S (2007) Real-time emergency response fleet deployment: concepts, systems, simulation and case studies. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management. Operations research\/computer science interfaces, vol 38. Springer, New York, pp 133\u2013162"},{"issue":"2","key":"4983_CR73","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle-routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"4983_CR74","first-page":"41","volume-title":"Dynamic fleet management, volume 38 of operations research\/computer science interfaces","author":"T Flatberg","year":"2007","unstructured":"Flatberg T, Hasle G, Kloster O, Nilssen EJ, Riise A (2007) Dynamic and stochastic vehicle routing in practice. In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Dynamic fleet management, volume 38 of operations research\/computer science interfaces, vol 38. US, Springer, pp 41\u201363"},{"key":"4983_CR75","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.06.007","author":"V Pillac","year":"2012","unstructured":"Pillac V, Gu\u00e9ret C, Medaglia AL (2012) An event-driven optimization framework for dynamic vehicle routing. Decis Support Syst. https:\/\/doi.org\/10.1016\/j.dss.2012.06.007","journal-title":"Decis Support Syst"},{"issue":"4","key":"4983_CR76","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"LM Hvattum","year":"2006","unstructured":"Hvattum LM, Lokketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transp Sci 40(4):421\u2013438. https:\/\/doi.org\/10.1287\/trsc.1060.0166","journal-title":"Transp Sci"},{"issue":"8","key":"4983_CR77","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107 S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp Res Part B Methodol 38(8):669\u2013685. https:\/\/doi.org\/10.1016\/j.trb.2003.09.001","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"4983_CR78","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/trsc.1040.0095","volume":"39","author":"J Branke","year":"2005","unstructured":"Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transp Sci 39(3):298\u2013312. https:\/\/doi.org\/10.1287\/trsc.1040.0095","journal-title":"Transp Sci"},{"issue":"3","key":"4983_CR79","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/trsc.1060.0183","volume":"41","author":"BW Thomas","year":"2007","unstructured":"Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319\u2013331. https:\/\/doi.org\/10.1287\/trsc.1060.0183","journal-title":"Transp Sci"},{"issue":"4","key":"4983_CR80","first-page":"233","volume":"5","author":"G Ghiani","year":"2008","unstructured":"Ghiani G, Laporte G, Manni E, Musmanno R (2008) Waiting strategies for the dynamic and stochastic traveling salesman problem. Int J Oper Res 5(4):233\u2013241","journal-title":"Int J Oper Res"},{"key":"4983_CR81","unstructured":"Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. In: Veloso M (ed) Proceedings of the 20th international joint conference on artifical intelligence (IJCAI-07), pp 1816\u20131821"},{"issue":"11","key":"4983_CR82","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1016\/j.cor.2009.01.014","volume":"36","author":"RM Branchini","year":"2009","unstructured":"Branchini RM, Armentano VA, Lokketangen A (2009) Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput Oper Res 36(11):2955\u20132968. https:\/\/doi.org\/10.1016\/j.cor.2009.01.014","journal-title":"Comput Oper Res"},{"key":"4983_CR83","unstructured":"Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. In: IJCAI international joint conference on artificial intelligence, pp 1816\u20131821"},{"key":"4983_CR84","doi-asserted-by":"crossref","unstructured":"RamachandranPillai R, Arock M (2019) An adaptive spiking neural P system for solving vehicle routing problems. Arab J Sci Eng 1\u201317","DOI":"10.1007\/s13369-019-04153-6"},{"key":"4983_CR85","unstructured":"Larsen A (2000) The dynamic vehicle routing problem. Kgs. Lyngby, Technical University of Denmark (DTU). IMM-PHD, No. 2000-73, Denmark"},{"key":"4983_CR86","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1295485","author":"X Haitao","year":"2018","unstructured":"Haitao X, Pan P, Duan F (2018) Dynamic vehicle routing problems with enhanced ant colony optimization. Discrete Dyn Nat Soc. https:\/\/doi.org\/10.1155\/2018\/1295485","journal-title":"Discrete Dyn Nat Soc"},{"issue":"2","key":"4983_CR87","first-page":"279","volume":"71","author":"M Ionescu","year":"2006","unstructured":"Ionescu M, P\u01ceun G, Yokomori T (2006) Spiking neural P systems. Fundam Inf 71(2):279\u2013308","journal-title":"Fundam Inf"},{"key":"4983_CR88","doi-asserted-by":"publisher","unstructured":"Qi F, Liu M (2018) Optimization spiking neural P system for solving TSP. https:\/\/doi.org\/10.1007\/978-3-319-73447-7_71","DOI":"10.1007\/978-3-319-73447-7_71"},{"key":"4983_CR89","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications. Springer, pp 169\u2013178","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"4983_CR90","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, London"},{"key":"4983_CR91","doi-asserted-by":"publisher","unstructured":"Zeng X, Song T, Pan L, Zhang X (2011), Spiking Neural P systems for arithmetic operations. In: 2011 sixth international conference on bio-inspired computing: theories and applications, Penang, pp 296\u2013301. https:\/\/doi.org\/10.1109\/bic-ta.2011.42","DOI":"10.1109\/bic-ta.2011.42"},{"key":"4983_CR92","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1142\/S0129054106004212","volume":"17","author":"G Paun","year":"2006","unstructured":"Paun G, P\u00e9rez-Jim\u00e9nez M, Rozenberg G (2006) Spike trains in spiking neural P systems. Int J Found Comput Sci 17:975\u20131002. https:\/\/doi.org\/10.1142\/S0129054106004212","journal-title":"Int J Found Comput Sci"},{"key":"4983_CR93","doi-asserted-by":"publisher","unstructured":"Rong H, Wu T, Pan L, Zhang G (2018) Spiking Neural P systems: theoretical results and applications: essays. Dedicated to Mario de Jes\u00fas P\u00e9rez-Jim\u00e9nez on the Occasion of His 70th Birthday. https:\/\/doi.org\/10.1007\/978-3-030-00265-7_20","DOI":"10.1007\/978-3-030-00265-7_20"},{"key":"4983_CR94","doi-asserted-by":"crossref","unstructured":"Metta VP, Kelemenov\u00e1 A (2015) Sorting using spiking neural P systems with anti-spikes and rules on synapses. In: Rozenberg G, Salomaa A, Sempere J, Zandron C (eds) Membrane computing. CMC 2015. Lecture Notes in Computer Science, vol 9504. Springer, Cham","DOI":"10.1007\/978-3-319-28475-0_20"},{"key":"4983_CR95","doi-asserted-by":"crossref","unstructured":"Zein M, Adl A, Ella Hassanien A (2018), Spiking neural P grey wolf optimization system: Novel strategies for solving non-determinism problems, Expert systems with applications, volume 121, 2019, pp 204\u2013220. https:\/\/doi.org\/10.1016\/j.eswa.2018.12.029","DOI":"10.1016\/j.eswa.2018.12.029"},{"key":"4983_CR96","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1295485","author":"H Xu","year":"2018","unstructured":"Xu H, Pu P, Duan F (2018) Dynamic vehicle routing problems with enhanced ant colony optimization. Discrete Dyn Nat Soc. https:\/\/doi.org\/10.1155\/2018\/1295485","journal-title":"Discrete Dyn Nat Soc"},{"issue":"4","key":"4983_CR97","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1016\/j.asoc.2011.10.023","volume":"12","author":"MR Khouadjia","year":"2012","unstructured":"Khouadjia MR, Sarasola B, Alba E, Jourdan L, Talbi E-G (2012) A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Appl Soft Comput 12(4):1426\u20131439","journal-title":"Appl Soft Comput"},{"issue":"1","key":"4983_CR98","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"FT Hanshar","year":"2007","unstructured":"Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89\u201399","journal-title":"Appl Intell"},{"issue":"1","key":"4983_CR99","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell JE, McMullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inf 18(1):41\u201348","journal-title":"Adv Eng Inf"},{"issue":"1","key":"4983_CR100","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","volume":"38","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ, Yao BZ (2011) A hybrid algorithm for vehicle routing problem with time windows. Expert Syst Appl 38(1):435\u2013441. https:\/\/doi.org\/10.1016\/j.eswa.2010.06.082","journal-title":"Expert Syst Appl"},{"key":"4983_CR101","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589005-3070-3","volume":"34","author":"CK Tan","year":"2006","unstructured":"Tan CK, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115\u2013151. https:\/\/doi.org\/10.1007\/s10589005-3070-3","journal-title":"Comput Optim Appl"},{"key":"4983_CR102","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.swevo.2017.11.001","volume":"39","author":"W Dong","year":"2018","unstructured":"Dong W, Zhou K, Qi H, He C, Zhang J (2018) A tissue P system based evolutionary algorithm for multi-objective VRPTW. Swarm Evolut Comput 39:310\u2013322. https:\/\/doi.org\/10.1016\/j.swevo.2017.11.001","journal-title":"Swarm Evolut Comput"},{"issue":"3","key":"4983_CR103","doi-asserted-by":"publisher","first-page":"809826","DOI":"10.1016\/j.dss.2006.12.011","volume":"43","author":"H Zhao","year":"2007","unstructured":"Zhao H (2007) A multi-objective genetic programming approach to developing Pareto optimal decision trees. Decis Support Syst 43(3):809826. https:\/\/doi.org\/10.1016\/j.dss.2006.12.011","journal-title":"Decis Support Syst"},{"key":"4983_CR104","volume-title":"Encyclopedia of systems biology","author":"W Haynes","year":"2013","unstructured":"Haynes W (2013) Holm\u2019s method. In: Dubitzky W, Wolkenhauer O, Cho KH, Yokota H (eds) Encyclopedia of systems biology. Springer, New York"},{"issue":"1","key":"4983_CR105","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 (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evolut Comput"},{"issue":"6","key":"4983_CR106","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.21037\/jtd.2017.05.34","volume":"9","author":"SY Chen","year":"2017","unstructured":"Chen SY, Feng Z, Yi X (2017) A general introduction to adjustment for multiple comparisons. J Thor Disease 9(6):1725\u20131729. https:\/\/doi.org\/10.21037\/jtd.2017.05.34","journal-title":"J Thor Disease"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04983-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-04983-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04983-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T07:43:01Z","timestamp":1621496581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-04983-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,20]]},"references-count":106,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["4983"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-04983-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,20]]},"assertion":[{"value":"18 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}