{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:22:48Z","timestamp":1756992168541,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811623769"},{"type":"electronic","value":"9789811623776"}],"license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-2377-6_25","type":"book-chapter","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:44:09Z","timestamp":1632447849000},"page":"253-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-Phase Approach for Solving the Rich Vehicle Routing Problem Based on Firefly Algorithm Clustering"],"prefix":"10.1007","author":[{"given":"Emir","family":"\u017duni\u0107","sequence":"first","affiliation":[]},{"given":"Sead","family":"Delali\u0107","sequence":"additional","affiliation":[]},{"given":"D\u017eenana","family":"\u0110onko","sequence":"additional","affiliation":[]},{"given":"Haris","family":"\u0160upi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,24]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Zunic E, Delalic S, Tucakovic Z, Hodzic K, Besirevic A (2019) Innovative modular approach based on vehicle routing problem and ant colony optimization for order splitting in real warehouses. In: Communication papers of the 14th federated conference on computer science and information systems (FedCSIS). https:\/\/doi.org\/10.15439\/2019f196","DOI":"10.15439\/2019f196"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Delalic S, Zunic E, Alihodzic A, Selmanovic E (2020) The order batching concept implemented in real smart warehouse. In: 2020 43rd international convention on information and communication technology, electronics and microelectronics (MIPRO). https:\/\/doi.org\/10.23919\/mipro48935.2020.9245256","DOI":"10.23919\/mipro48935.2020.9245256"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, Delali\u0107 S, Hod\u017ei\u0107 K, Be\u0161irevi\u0107 A, Hindija H (2018) Smart warehouse management system concept with implementation. In: 14th symposium on neural networks and applications (NEUREL). https:\/\/doi.org\/10.1109\/NEUREL.2018.8587004","DOI":"10.1109\/NEUREL.2018.8587004"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res. https:\/\/doi.org\/10.1016\/S0305-0548(02)00051-5","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Chiang WC, Russell RA (1996) Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann Oper Res. https:\/\/doi.org\/10.1007\/BF02601637","DOI":"10.1007\/BF02601637"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci. https:\/\/doi.org\/10.1287\/mnsc.40.10.1276","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem: survey. ACM Comput Surv (CSUR). https:\/\/doi.org\/10.1145\/2666003","DOI":"10.1145\/2666003"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Osaba E, Yang XS, Del Ser J (2020) Is the vehicle routing problem dead? An overview through bioinspired perspective and a prospect of opportunities. In: Nature-inspired computation in navigation and routing problems. https:\/\/doi.org\/10.1007\/978-981-15-1842-3_3","DOI":"10.1007\/978-981-15-1842-3_3"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2008.04.003","DOI":"10.1016\/j.cor.2008.04.003"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Belmecheri F, Prins C, Yalaoui F, Amodeo L (2013) Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-012-0627-8","DOI":"10.1007\/s10845-012-0627-8"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Taha A, Hachimi M, Moudden A (2015) Adapted bat algorithm for capacitated vehicle routing problem. Int Rev Comput Softw (IRECOS). https:\/\/doi.org\/10.15866\/irecos.v10i6.6512","DOI":"10.15866\/irecos.v10i6.6512"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Osaba E, Carballedo R, Yang XS, Fister I Jr, Lopez-Garcia P, Del Ser J (2018) On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators. In: Nature-inspired algorithms and applied optimization. https:\/\/doi.org\/10.1007\/978-3-319-67669-2_4","DOI":"10.1007\/978-3-319-67669-2_4"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Yang W, Ke L (2019) An improved fireworks algorithm for the capacitated vehicle routing problem. Front Comput Sci. https:\/\/doi.org\/10.1007\/s11704-017-6418-9","DOI":"10.1007\/s11704-017-6418-9"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Osaba E, Yang XS, Diaz F, Onieva E, Masegosa AD, Perallos A (2017) A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-016-2114-1","DOI":"10.1007\/s00500-016-2114-1"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Altabeeb AM, Mohsen AM, Ghallab A (2019) An improved hybrid firefly algorithm for capacitated vehicle routing problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.105728","DOI":"10.1016\/j.asoc.2019.105728"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Osaba E, Carballedo R, Yang XS, Diaz F (2016) An evolutionary discrete firefly algorithm with novel operators for solving the vehicle routing problem with time windows. In: Nature-inspired computation in engineering. https:\/\/doi.org\/10.1007\/978-3-319-30235-5_2","DOI":"10.1007\/978-3-319-30235-5_2"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Vidal T, Battarra M, Subramanian A, Erdogan G (2015) Hybrid metaheuristics for the clustered vehicle routing problem. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2014.10.019","DOI":"10.1016\/j.cor.2014.10.019"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Dondo R, Cerd\u00e1 J (2007) A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.077","DOI":"10.1016\/j.ejor.2004.07.077"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Exp\u00f3sito-Izquierdo C, Rossi A, Sevaux M (2016) A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2015.11.022","DOI":"10.1016\/j.cie.2015.11.022"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, \u0110onko D, \u0160upi\u0107 H, Delali\u0107 S (2020) Cluster-based approach for successful solving real-world vehicle routing problems. In: 15th conference on computer science and information systems (FedCSIS). https:\/\/doi.org\/10.15439\/2020F184","DOI":"10.15439\/2020F184"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Senthilnath J, Omkar SN, Mani V (2011) Clustering using firefly algorithm: performance study. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2011.06.003","DOI":"10.1016\/j.swevo.2011.06.003"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, Delali\u0107 S, Hod\u017ei\u0107 K, Tucakovi\u0107 Z (2019) Innovative GPS data anomaly detection algorithm inspired by QRS complex detection algorithms in ECG signals. In: EUROCON 2019\u201418th international conference on smart technologies. https:\/\/doi.org\/10.1109\/EUROCON.2019.8861619","DOI":"10.1109\/EUROCON.2019.8861619"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, Hindija H, Be\u0161irevi\u0107 A, Hod\u017ei\u0107 K, Delali\u0107 S (2018) Improving performance of vehicle routing algorithms using GPS data. In: 14th symposium on neural networks and applications (NEUREL). https:\/\/doi.org\/10.1109\/NEUREL.2018.8586982","DOI":"10.1109\/NEUREL.2018.8586982"},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, Delali\u0107 S, \u0110onko, D\u017e (2020) Adaptive multi-phase approach for solving the realistic vehicle routing problems in logistics with innovative comparison method for evaluation based on real GPS data. Transp Lett. https:\/\/doi.org\/10.1080\/19427867.2020.1824311","DOI":"10.1080\/19427867.2020.1824311"},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107 E, Kuric A, Delali\u0107 S (2020) Improving unloading time prediction for vehicle routing problem based on GPS data. In: Position papers of the 15th federated conference on computer science and information systems (FedCSIS). https:\/\/doi.org\/10.15439\/2020F123","DOI":"10.15439\/2020F123"},{"key":"25_CR26","unstructured":"Yang X (2010) Nature-inspired metaheuristic algorithms, 2nd edn. ISBN: 1905986289, 9781905986286"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of Sixth International Congress on Information and Communication Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-2377-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T18:09:32Z","timestamp":1644430172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-2377-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"ISBN":["9789811623769","9789811623776"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-2377-6_25","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,9,24]]},"assertion":[{"value":"24 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}