{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:05:45Z","timestamp":1751760345085,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031469695"},{"type":"electronic","value":"9783031469701"}],"license":[{"start":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:00:00Z","timestamp":1698537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T00:00:00Z","timestamp":1698537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-46970-1_28","type":"book-chapter","created":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T05:01:28Z","timestamp":1698469288000},"page":"294-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tool for Solving the CVRP Problem by Applying the Tabu Search Algorithm"],"prefix":"10.1007","author":[{"given":"A.","family":"Mexicano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. C.","family":"Carmona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Y.","family":"Alvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. N.","family":"Montes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Cervantes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,29]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/166\/1\/012029","volume":"166","author":"AA Sarwono","year":"2017","unstructured":"Sarwono, A.A., Ai, T.J., Wigati, S.S.: Combination of nearest neighbor and heuristics algorithms for sequential two dimensional loading capacitated vehicle routing problem. IOP Conference Series: Materials Science and Engineering 166, 012029 (2017)","journal-title":"IOP Conference Series: Materials Science and Engineering"},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Lima, S.J., Araujo, S., Schimit, P.H.: A hybrid approach based on genetic algorithm and nearest neighbor heuristic for solving the capacitated vehicle routing problem, Acta Scientiarum. Technology 40 (2018). https:\/\/doi.org\/10.4025\/actascitechnol.v40i1.36708","DOI":"10.4025\/actascitechnol.v40i1.36708"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s13198-016-0493-4","volume":"9","author":"AO Adewumi","year":"2018","unstructured":"Adewumi, A.O., Adeleke, O.J.: A survey of recent advances in vehicle routing problems. Int. J. Syst. Assur. Eng. Manag. 9(1), 155\u2013172 (2018)","journal-title":"Int. J. Syst. Assur. Eng. Manag."},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Akhand, M.A.H., Peya, Z.J., Sultana, T., Al-Mahmud: Solving Capacitated Vehicle Routing Problem with route optimization using Swarm Intelligence. 2nd Int. Conf. Electr. Inf. Commun. Technol. EICT 2015, pp. 112\u2013117 (2016). https:\/\/doi.org\/10.1109\/EICT.2015.7391932","DOI":"10.1109\/EICT.2015.7391932"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1016\/j.eswa.2007.11.060","volume":"36","author":"SW Lin","year":"2009","unstructured":"Lin, S.W., Lee, Z.J., Ying, K.C., Lee, C.Y.: Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst. Appl. 36, 1505\u20131512 (2009). https:\/\/doi.org\/10.1016\/j.eswa.2007.11.060","journal-title":"Expert Syst. Appl."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"8745","DOI":"10.1007\/s00500-022-07198-2","volume":"26","author":"J Cai","year":"2022","unstructured":"Cai, J., Wang, P., Sun, S., Dong, H.: A dynamic space reduction ant colony optimization for capacitated vehicle routing problem. Soft. Comput. 26, 8745\u20138756 (2022)","journal-title":"Soft. Comput."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"7326","DOI":"10.1007\/s10489-022-03912-7","volume":"53","author":"Y Gao","year":"2023","unstructured":"Gao, Y., Wu, H., Wang, W.: A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem. Appl. Intell. 53, 7326\u20137342 (2023)","journal-title":"Appl. Intell."},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1995658","DOI":"10.1080\/08839514.2021.1995658","volume":"36","author":"F Alesiani","year":"2022","unstructured":"Alesiani, F., Ermis, G., Gkiotsalitis, K.: Constrained clustering for the capacitated vehicle routing problem (CC-CVRP). Appl. Artif. Intell. 36(1), 1995658 (2022). https:\/\/doi.org\/10.1080\/08839514.2021.1995658","journal-title":"Appl. Artif. Intell."},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.3906\/elk-1902-122","volume":"28","author":"\u0130 \u0130lhan","year":"2020","unstructured":"\u0130lhan, \u0130: A population based simulated annealing algorithm for capacitated vehicle routing problem. Turk. J. Electr. Eng. Comput. Sci. 28(3), 1217\u20131235 (2020). https:\/\/doi.org\/10.3906\/elk-1902-122","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"3060","DOI":"10.4028\/www.scientific.net\/AMR.753-755.3060","volume":"753\u2013755","author":"C Ren","year":"2013","unstructured":"Ren, C.: Tabu search algorithm for capacitated vehicle routing problem. Advanced Materials Research 753\u2013755, 3060\u20133063 (2013). https:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.753-755.3060","journal-title":"Advanced Materials Research"},{"key":"28_CR11","unstructured":"Harmanani, H.M., Azar, D., Helal, N., Keirouz, W.: A simulated annealing algorithm for the capacitated vehicle routing problem. In: 26th International Conference on Computers and Their Applications, pp. 96\u2013101. New Orleans, Louisiana, USA (2011)"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30(5), 787\u2013800 (2003). https:\/\/doi.org\/10.1016\/s0305-0548(02)00051-5","DOI":"10.1016\/s0305-0548(02)00051-5"},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Ky Phuc, P.N., Phuong Thao, N.L.: Ant colony optimization for multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets. Logistics 5, 28 (2021). https:\/\/doi.org\/10.3390\/logistics5020028","DOI":"10.3390\/logistics5020028"},{"issue":"6","key":"28_CR14","doi-asserted-by":"publisher","first-page":"2021103","DOI":"10.6703\/IJASE.202112_18(6).002","volume":"18","author":"J Febria","year":"2021","unstructured":"Febria, J., Dewi, C., Mailoa, E.: Optimization of capacitated vehicle routing problem using initial route with same size K-means and greedy algorithm for vaccines distribution. Int. J. Appl. Sci. Eng. 18(6), 2021103 (2021). https:\/\/doi.org\/10.6703\/IJASE.202112_18(6).002","journal-title":"Int. J. Appl. Sci. Eng."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Masudin, I., Sa\u2019diyah, R.F., Utama, D.M., Restuputri, D.P., Jie, F.: Capacitated Vehicle Routing Problems: Nearest Neighbor vs. Tabu Search. Int. J. Comp. Theo. Eng. 11(4), 76\u201379 (2019)","DOI":"10.7763\/IJCTE.2019.V11.1246"},{"key":"28_CR16","unstructured":"Augerat, P.: CVRPLIB - All Instances. http:\/\/vrp.atd-lab.inf.puc-rio.br\/index.php\/en\/, accessed 21 Nov. 2021"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.30526\/31.2.1949","volume":"31","author":"O Ibrahim","year":"2018","unstructured":"Ibrahim, O.: Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA), Ibn AL- Haitham. J. Pure Appl. Sci. 31(2), 199\u2013209 (2018). https:\/\/doi.org\/10.30526\/31.2.1949","journal-title":"J. Pure Appl. Sci."},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.13053\/rcs-147-2-3","volume":"147","author":"I Ram\u00edrez","year":"2018","unstructured":"Ram\u00edrez, I., Hern\u00e1ndez, J.A., Ruiz, M.A., Cruz, M.A., Arroyo, G.: Design and implementation of a CVRP simulator using genetic algorithms. Research in Computing Science 147(2), 35\u201347 (2018)","journal-title":"Research in Computing Science"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4322\/bjopm.2011.006","volume":"8","author":"OS da Silva","year":"2011","unstructured":"da Silva, O.S., Silveira, L.A.: A free geographic information system as a tool for multi-depot vehicle routing. Brazilian J. Operat. Produ. Manage. 8, 103\u2013120 (2011). https:\/\/doi.org\/10.4322\/bjopm.2011.006","journal-title":"Brazilian J. Operat. Produ. Manage."},{"issue":"5","key":"28_CR20","first-page":"1331","volume":"3","author":"S Kulkarni","year":"2014","unstructured":"Kulkarni, S., Sohani, N., Sehta, N.: Capacitated vehicle routing using nearest neighbor algorithm in supply chain. Int. J. Eng. Res. Technol. 3(5), 1331\u20131334 (2014)","journal-title":"Int. J. Eng. Res. Technol."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Bozorg-Haddad, O., Solgi, M., Lo\u00e1iciga, H.A.: Meta-Heuristic and Evolutionary Algorithms for Engineering Optimization (2017)","DOI":"10.1002\/9781119387053"},{"key":"28_CR22","first-page":"153","volume":"22","author":"JL Ch\u00e1vez-Bosquez","year":"2015","unstructured":"Ch\u00e1vez-Bosquez, J.L., Pozos-Parra, O., G\u00f3mez-Ramos, P.: B\u00fasqueda Tab\u00fa con Criterio de Aspiraci\u00f3n Probabil\u00edstico Aplicado a la Generaci\u00f3n de Horarios Escolares. Rev. Matem\u00e1tica Teor. y Apl. 22, 153\u2013177 (2015)","journal-title":"Rev. Matem\u00e1tica Teor. y Apl."}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances on P2P, Parallel, Grid, Cloud and Internet Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46970-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T05:04:48Z","timestamp":1698469488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46970-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,29]]},"ISBN":["9783031469695","9783031469701"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46970-1_28","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2023,10,29]]},"assertion":[{"value":"29 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"3PGCIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daegu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pgcic2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/3pgcic\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}