{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:36:51Z","timestamp":1756993011313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030718459"},{"type":"electronic","value":"9783030718466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-71846-6_6","type":"book-chapter","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T07:03:10Z","timestamp":1615964590000},"page":"103-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Cluster-Based Approach to Solve Rich Vehicle Routing Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1950-7816","authenticated-orcid":false,"given":"Emir","family":"Zunic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3720-191X","authenticated-orcid":false,"given":"Sead","family":"Delalic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dzenana","family":"Donko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haris","family":"Supic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,18]]},"reference":[{"issue":"1","key":"6_CR1","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). https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manage. Sci."},{"key":"6_CR2","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Frome (2010)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-13495-1_44","volume-title":"Advances in Swarm Intelligence","author":"Y Tan","year":"2010","unstructured":"Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 355\u2013364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13495-1_44"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the Congress on Evolutionary Computation (CEC 1999) (Cat. No. 99TH8406), vol. 2, pp. 1470\u20131477 (1999). https:\/\/doi.org\/10.1109\/CEC.1999.782657","DOI":"10.1109\/CEC.1999.782657"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Wang, G.G., Deb, S., Coelho, L.D.S.: Elephant herding optimization. In: 3rd International Symposium on Computational and Business Intelligence (ISCBI), pp. 1\u20135 (2015). https:\/\/doi.org\/10.1109\/ISCBI.2015.8","DOI":"10.1109\/ISCBI.2015.8"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107, E., Delali\u0107, S., Hod\u017ei\u0107, K., Be\u0161irevi\u0107, A., Hindija, H.: Smart warehouse management system concept with implementation. In: 14th Symposium on Neural Networks and Applications (NEUREL), pp. 1\u20135 (2018). https:\/\/doi.org\/10.1109\/NEUREL.2018.8587004","DOI":"10.1109\/NEUREL.2018.8587004"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Zunic, E., Delalic, S., Tucakovic, Z., Hodzic, K., Besirevic, A.: Innovative modular approach based on vehicle routing problem and ant colony optimization for order splitting in real warehouses. In: 14th Conference on Computer Science and Information Systems (FedCSIS) (Communication Papers), pp. 125\u2013129 (2019). https:\/\/doi.org\/10.15439\/2019f196","DOI":"10.15439\/2019f196"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Delalic, S., Zunic, E., Alihodzic, A., Selmanovic, E.: The order batching concept implemented in real smart warehouse. In: 43rd International Convention on Information and Communication Technology, Electronics and Microelectronics (Mipro), pp. 1685\u20131690 (2020). https:\/\/doi.org\/10.23919\/mipro48935.2020.9245256","DOI":"10.23919\/mipro48935.2020.9245256"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.28945\/1785","volume":"8","author":"E Ziemba","year":"2013","unstructured":"Ziemba, E., Oblak, I.: Critical success factors for ERP systems implementation in public administration. Interdisc. J. Inf. Knowl. Manag. 8, 1\u201319 (2013). https:\/\/doi.org\/10.28945\/1785","journal-title":"Interdisc. J. Inf. Knowl. Manag."},{"issue":"71","key":"6_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.7172\/1644-9584.71.7","volume":"15","author":"E Ziemba","year":"2017","unstructured":"Ziemba, E., Eisenbardt, M.: Business processes improvement by using consumers\u2019 knowledge. Problemy Zarzadzania 15(71), 102\u2013115 (2017). https:\/\/doi.org\/10.7172\/1644-9584.71.7","journal-title":"Problemy Zarzadzania"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Alihodzic, A., Delalic, S., Gusic, D.: An effective integrated metaheuristic algorithm for solving engineering problems. In: 15th Conference on Computer Science and Information Systems (FedCSIS), pp. 207\u2013214 (2020). https:\/\/doi.org\/10.15439\/2020F81","DOI":"10.15439\/2020F81"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107, E., Be\u0161irevi\u0107, A., Delali\u0107, S., Hod\u017ei\u0107, K., Hasi\u0107, H.: A generic approach for order picking optimization process in different warehouse layouts. In: 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (Mipro), pp. 1000\u20131005 (2018). https:\/\/doi.org\/10.23919\/MIPRO.2018.8400183","DOI":"10.23919\/MIPRO.2018.8400183"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Lopez-Garcia, P., Carballedo, R.: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng. Appl. Artif. Intell. 48, 59\u201371 (2016). https:\/\/doi.org\/10.1016\/j.engappai.2015.10.006","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"7","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji, Y., Riffi, M.E.: A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput. Appl. 27(7), 1853\u20131866 (2016). https:\/\/doi.org\/10.1007\/s00521-015-1978-9","journal-title":"Neural Comput. Appl."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-23857-4_38","volume-title":"Adaptive and Intelligent Systems","author":"GK Jati","year":"2011","unstructured":"Jati, G.K., Suyanto: Evolutionary discrete firefly algorithm for travelling salesman problem. In: Bouchachia, A. (ed.) ICAIS 2011. LNCS, vol. 6943, pp. 393\u2013403. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23857-4_38"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1504\/ijcsyse.2017.086740","volume":"3","author":"Z Taidi","year":"2017","unstructured":"Taidi, Z., Benameur, L., Chentoufi, J.A.: A fireworks algorithm for solving travelling salesman problem. Int. J. Comput. Syst. Eng. 3(3), 157\u2013162 (2017). https:\/\/doi.org\/10.1504\/ijcsyse.2017.086740","journal-title":"Int. J. Comput. Syst. Eng."},{"key":"6_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-12065-8_12","volume-title":"Advanced Intelligent Systems for Sustainable Development (AI2SD\u20192018)","author":"A Hossam","year":"2019","unstructured":"Hossam, A., Bouzidi, A., Riffi, M.E.: Elephants herding optimization for solving the travelling salesman problem. In: Ezziyyani, M. (ed.) AI2SD 2018. AISC, vol. 912, pp. 122\u2013130. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12065-8_12"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proceedings of the International Conference on Machine Learning and Cybernetics (Cat. No. 03ex693), vol. 3, pp. 1583\u20131585 (2003). https:\/\/doi.org\/10.1109\/icmlc.2003.1259748","DOI":"10.1109\/icmlc.2003.1259748"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5), 787\u2013800 (2003). https:\/\/doi.org\/10.1016\/S0305-0548(02)00051-5","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang, W.C., Russell, R.A.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63(1), 3\u201327 (1996). https:\/\/doi.org\/10.1007\/BF02601637","journal-title":"Ann. Oper. Res."},{"issue":"10","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276\u20131290 (1994). https:\/\/doi.org\/10.1287\/mnsc.40.10.1276","journal-title":"Manage. Sci."},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2014","unstructured":"Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: Survey. ACM Computing Surveys (CSUR) 47(2), 1\u201328 (2014). https:\/\/doi.org\/10.1145\/2666003","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Osaba, E., Yang, X. S., Del Ser, J.: 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, pp. 57\u201384 (2020). https:\/\/doi.org\/10.1007\/978-981-15-1842-3_3","DOI":"10.1007\/978-981-15-1842-3_3"},{"issue":"5","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"TJ Ai","year":"2009","unstructured":"Ai, T.J., Kachitvichyanukul, V.: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 36(5), 1693\u20131702 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.04.003","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"AL Chen","year":"2006","unstructured":"Chen, A.L., Yang, G.K., Wu, Z.M.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University-Science A 7(4), 607\u2013614 (2006). https:\/\/doi.org\/10.1631\/jzus.2006.A0607","journal-title":"Journal of Zhejiang University-Science A"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Gong, Y.J., Zhang, J., Liu, O., Huang, R.Z., Chung, H.S.H., Shi, Y.H.: Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 42(2), 254\u2013267 (2012). https:\/\/doi.org\/10.1109\/TSMCC.2011.2148712","DOI":"10.1109\/TSMCC.2011.2148712"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10845-012-0627-8","volume":"24","author":"F Belmecheri","year":"2013","unstructured":"Belmecheri, F., Prins, C., Yalaoui, F., Amodeo, L.: Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. J. Intell. Manuf. 24(4), 775\u2013789 (2013). https:\/\/doi.org\/10.1007\/s10845-012-0627-8","journal-title":"J. Intell. Manuf."},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Taha, A., Hachimi, M., Moudden, A.: Adapted bat algorithm for capacitated vehicle routing problem. International Review on Computers and Software (IRECOS) 10(6), 610\u2013619 (2015). https:\/\/doi.org\/10.15866\/irecos.v10i6.6512","DOI":"10.15866\/irecos.v10i6.6512"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Zhou, Y., Luo, Q., Xie, J., Zheng, H.: A hybrid bat algorithm with path relinking for the capacitated vehicle routing problem. In Metaheuristics and Optimization in Civil Engineering, pp. 255\u2013276 (2016). https:\/\/doi.org\/10.1007\/978-3-319-26245-1_12","DOI":"10.1007\/978-3-319-26245-1_12"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Osaba, E., Carballedo, R., Yang, X.S., Fister Jr, I., Lopez-Garcia, P., Del Ser, J.: 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, pp. 69\u201389 (2018). https:\/\/doi.org\/10.1007\/978-3-319-67669-2_4","DOI":"10.1007\/978-3-319-67669-2_4"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1504\/IJAACS.2019.098589","volume":"12","author":"Y Cai","year":"2019","unstructured":"Cai, Y., Qi, Y., Cai, H., Huang, H., Chen, H.: Chaotic discrete bat algorithm for capacitated vehicle routing problem. International Journal of Autonomous and Adaptive Communications Systems 12(2), 91\u2013108 (2019). https:\/\/doi.org\/10.1504\/IJAACS.2019.098589","journal-title":"International Journal of Autonomous and Adaptive Communications Systems"},{"issue":"1","key":"6_CR32","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18(1), 41\u201348 (2004). https:\/\/doi.org\/10.1016\/j.aei.2004.07.001","journal-title":"Adv. Eng. Inform."},{"issue":"1","key":"6_CR33","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu, B., Yang, Z.Z., Yao, B.: An improved ant colony optimization for vehicle routing problem. Eur. J. Oper. Res. 196(1), 171\u2013176 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.02.028","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"6_CR34","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto, W.Y., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215(1), 126\u2013135 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2011.06.006","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"6_CR35","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1177\/0037549713481503","volume":"89","author":"B Yao","year":"2013","unstructured":"Yao, B., Hu, P., Zhang, M., Wang, S.: Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem. SIMULATION 89(6), 762\u2013770 (2013). https:\/\/doi.org\/10.1177\/0037549713481503","journal-title":"SIMULATION"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Korayem, L., Khorsid, M., Kassem, S. S.: Using grey wolf algorithm to solve the capacitated vehicle routing problem. In IOP Conference Series: Materials Science and Engineering. IOP Publishing, 83(1), 1\u201310 (2015). https:\/\/doi.org\/10.1088\/1757-899X\/83\/1\/012014","DOI":"10.1088\/1757-899X\/83\/1\/012014"},{"issue":"3","key":"6_CR37","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/s11704-017-6418-9","volume":"13","author":"W Yang","year":"2019","unstructured":"Yang, W., Ke, L.: An improved fireworks algorithm for the capacitated vehicle routing problem. Frontiers of Computer Science 13(3), 552\u2013564 (2019). https:\/\/doi.org\/10.1007\/s11704-017-6418-9","journal-title":"Frontiers of Computer Science"},{"issue":"18","key":"6_CR38","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.S., Diaz, F., Onieva, E., Masegosa, A.D., Perallos, A.: A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft. Comput. 21(18), 5295\u20135308 (2017). https:\/\/doi.org\/10.1007\/s00500-016-2114-1","journal-title":"Soft. Comput."},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2019.105728","volume":"84","author":"AM Altabeeb","year":"2019","unstructured":"Altabeeb, A.M., Mohsen, A.M., Ghallab, A.: An improved hybrid firefly algorithm for capacitated vehicle routing problem. Applied Soft Computing 84, 1\u20139 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105728","journal-title":"Applied Soft Computing"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Osaba, E., Carballedo, R., Yang, X.S., Diaz, F.: An evolutionary discrete firefly algorithm with novel operators for solving the vehicle routing problem with time windows. In Nature-Inspired Computation in Engineering, pp. 21\u201341 (2016). https:\/\/doi.org\/10.1007\/978-3-319-30235-5_2","DOI":"10.1007\/978-3-319-30235-5_2"},{"issue":"2","key":"6_CR41","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1504\/IJISE.2019.102471","volume":"33","author":"PP Matthopoulos","year":"2019","unstructured":"Matthopoulos, P.P., Sofianopoulou, S.: A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem. Int. J. Ind. Syst. Eng. 33(2), 204\u2013224 (2019). https:\/\/doi.org\/10.1504\/IJISE.2019.102471","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","volume":"58","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Battarra, M., Subramanian, A., Erdogan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Computers & Operations Research 58, 87\u201399 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.10.019","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6_CR43","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., Cerd\u00e1, J.: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176(3), 1478\u20131507 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2004.07.077","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR44","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cie.2015.11.022","volume":"91","author":"C Exp\u00f3sito-Izquierdo","year":"2016","unstructured":"Exp\u00f3sito-Izquierdo, C., Rossi, A., Sevaux, M.: A two-level solution approach to solve the clustered capacitated vehicle routing problem. Computers & Industrial Engineering 91, 274\u2013289 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.11.022","journal-title":"Computers & Industrial Engineering"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Zunic, E., Donko, D., Supic, H., Delalic, S.: Cluster-based approach for successful solving real-world vehicle routing problems. In 15th Conference on Computer Science and Information Systems (FedCSIS), Vol. 21, pp. 619\u2013626 (2020). https:\/\/doi.org\/10.15439\/2020F184","DOI":"10.15439\/2020F184"},{"key":"6_CR46","unstructured":"Alsabti, K., Ranka, S., Singh, V.: An efficient k-means clustering algorithm. (1997)"},{"key":"6_CR47","doi-asserted-by":"publisher","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications 36(2), 3336\u20133341 (2009). https:\/\/doi.org\/10.1016\/j.eswa.2008.01.039","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"6_CR48","doi-asserted-by":"publisher","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241\u2013254 (1967). https:\/\/doi.org\/10.1007\/BF02289588","DOI":"10.1007\/BF02289588"},{"key":"6_CR49","doi-asserted-by":"publisher","unstructured":"Senthilnath, J., Omkar, S.N., Mani, V.: Clustering using firefly algorithm: performance study. Swarm and Evolutionary Computation 1(3), 164\u2013171 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.06.003","DOI":"10.1016\/j.swevo.2011.06.003"},{"key":"6_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2019.105763","volume":"84","author":"H Xie","year":"2019","unstructured":"Xie, H., Zhang, L., Lim, C.P., Yu, Y., Liu, C., Liu, H., Walters, J.: Improving K-means clustering with enhanced Firefly Algorithms. Applied Soft Computing 84, 1\u201322 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105763","journal-title":"Applied Soft Computing"},{"key":"6_CR51","doi-asserted-by":"publisher","unstructured":"Van der Merwe, D. W., Engelbrecht, A. P.: Data clustering using particle swarm optimization. In Congress on Evolutionary Computation (CEC\u201903), Vol. 1, pp. 215\u2013220 (2003). https:\/\/doi.org\/10.1109\/CEC.2003.1299577","DOI":"10.1109\/CEC.2003.1299577"},{"key":"6_CR52","doi-asserted-by":"publisher","unstructured":"Kudova, P.: Clustering genetic algorithm. In 18th International Workshop on Database and Expert Systems Applications (DEXA), pp. 138\u2013142 (2007). https:\/\/doi.org\/10.1109\/DEXA.2007.65","DOI":"10.1109\/DEXA.2007.65"},{"issue":"10","key":"6_CR53","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/0031-3203(91)90097-O","volume":"24","author":"SZ Selim","year":"1991","unstructured":"Selim, S.Z., Alsultan, K.: A simulated annealing algorithm for the clustering problem. Pattern Recogn. 24(10), 1003\u20131008 (1991). https:\/\/doi.org\/10.1016\/0031-3203(91)90097-O","journal-title":"Pattern Recogn."},{"key":"6_CR54","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107, E., Delali\u0107, S., Hod\u017ei\u0107, K., Tucakovi\u0107, Z.: Innovative GPS Data Anomaly Detection Algorithm inspired by QRS Complex Detection Algorithms in ECG Signals. In 18th International Conference on Smart Technologies (EUROCON), pp. 1\u20136 (2019). https:\/\/doi.org\/10.1109\/EUROCON.2019.8861619","DOI":"10.1109\/EUROCON.2019.8861619"},{"key":"6_CR55","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107, E., Hindija, H., Be\u0161irevi\u0107, A., Hod\u017ei\u0107, K., Delali\u0107, S.: Improving Performance of Vehicle Routing Algorithms using GPS Data. In 14th Symposium on Neural Networks and Applications (NEUREL), pp. 1\u20134 (2018). https:\/\/doi.org\/10.1109\/NEUREL.2018.8586982","DOI":"10.1109\/NEUREL.2018.8586982"},{"key":"6_CR56","doi-asserted-by":"publisher","unstructured":"\u017dunic, E., Kuric, A., Delalic, S.: Improving unloading time prediction for Vehicle Routing Problem based on GPS data. In 15th Conference on Computer Science and Information Systems (FedCSIS) (Position Papers), Vol. 22, pp. 45\u201349 (2020). https:\/\/doi.org\/10.15439\/2020f123","DOI":"10.15439\/2020f123"},{"key":"6_CR57","doi-asserted-by":"publisher","unstructured":"\u017duni\u0107, E., Delali\u0107, S., Donko, D.: Adaptive multi-phase approach for solving the realistic vehicle routing problems in logistics with innovative comparison method for evaluation based on real GPS data. Transportation Letters 1\u201314, (2020). https:\/\/doi.org\/10.1080\/19427867.2020.1824311","DOI":"10.1080\/19427867.2020.1824311"},{"issue":"1","key":"6_CR58","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1504\/ijsi.2013.055801","volume":"1","author":"XS Yang","year":"2013","unstructured":"Yang, X.S., He, X.: Firefly algorithm: recent advances and applications. International Journal of Swarm Intelligence 1(1), 36\u201350 (2013). https:\/\/doi.org\/10.1504\/ijsi.2013.055801","journal-title":"International Journal of Swarm Intelligence"},{"key":"6_CR59","doi-asserted-by":"crossref","unstructured":"\u017duni\u0107, E., Delali\u0107, S., Donko, D\u017e., \u0160upi\u0107, H.: Two-phase Approach for Solving the Rich Vehicle Routing Problem Based on Firefly Algorithm Clustering. In 6th International Congress on Information and Communication Technology (ICICT). (2021). Paper accepted","DOI":"10.1007\/978-981-16-2377-6_25"}],"container-title":["Lecture Notes in Business Information Processing","Information Technology for Management: Towards Business Excellence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71846-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T18:51:49Z","timestamp":1671648709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71846-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030718459","9783030718466"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71846-6_6","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FedCSIS-IST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Special Sessions in the Information Systems and Technologies Track of the Conference on Computer Science and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sofia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fedcsis-ist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fedcsis.org\/2020\/ist","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The numbers are excluding ISM 2020","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}