{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:10:46Z","timestamp":1743009046892,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031044465"},{"type":"electronic","value":"9783031044472"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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-3-031-04447-2_10","type":"book-chapter","created":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T16:05:24Z","timestamp":1650557124000},"page":"141-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiphase Model Based on K-means and Ant Colony Optimization to Solve the Capacitated Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3304-2621","authenticated-orcid":false,"given":"Airton","family":"Huam\u00e1n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2895-7459","authenticated-orcid":false,"given":"Marco","family":"Huancahuari","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5032-3233","authenticated-orcid":false,"given":"Lenis","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"\u017duni\u0107, E., \u0110onko, D., Buza, E.: An adaptive data-driven approach to solve real-world vehicle routing problems in logistics. Complexity (2020)","DOI":"10.1155\/2020\/7386701"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cassettari, L., Demartini, M., Mosca, R., Revetria, R., Tonelli, F.: A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints. Multidisciplinary Digital Publishing Institute (2018)","DOI":"10.3390\/a11050069"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Manage. Sci. 6, 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van, I.: The vehicle routing problem: State of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A., Reisman, R.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57, 1472\u20131483 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR6","first-page":"549","volume":"11","author":"M Mutar","year":"2020","unstructured":"Mutar, M., Burhanuddin, M., Hameed, A., Yusof, N., Mutashar, H.: An efficient improvement of ant colony system algorithm for handling capacity vehicle routing problem. Int. J. Ind. Eng. Comput. 11, 549\u2013564 (2020)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"462","DOI":"10.11591\/ijeecs.v11.i2.pp462-468","volume":"11","author":"N Alfiyatin","year":"2018","unstructured":"Alfiyatin, N., Mahmudy, W., Anggodo, Y.: K-means clustering and genetic algorithm to solve vehicle routing problem with time windows problem. Indonesian J. Elect. Eng. Comput. Sci. 11, 462\u2013468 (2018)","journal-title":"Indonesian J. Elect. Eng. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12544-020-00409-7","volume":"12","author":"G Calabr\u00f2","year":"2020","unstructured":"Calabr\u00f2, G., Torrisi, V., Inturri, G., Ignaccolo, M.: Improving inbound logistic planning for large-scale real-world routing problems: a novel ant-colony simulation-based optimization. Eur. Transp. Res. Rev. 12, 1\u201311 (2020). https:\/\/doi.org\/10.1186\/s12544-020-00409-7","journal-title":"Eur. Transp. Res. Rev."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.cor.2018.10.008","volume":"102","author":"D Nicola","year":"2018","unstructured":"Nicola, D., Vetschera, R., Dragomir, A.: Total distance approximations for routing solutions. Comput. Oper. Res. 102, 67\u201374 (2018)","journal-title":"Comput. Oper. Res."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"A Florian","year":"2019","unstructured":"Florian, A., Michel, G., Kenneth, S.: Efficiently solving very large-scale routing problems. Comput. Oper. Res. 107, 32\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Nuha, H., Wati, P., Widiasih, W.: A comparison of exact method - metaheuristic method in determination for vehicle routing problem. In: MATEC Web of Conferences, (2018)","DOI":"10.1051\/matecconf\/201820402017"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Lukmandono, Basuki, M., Hidayat, M., Aji, F.: Application of saving matrix methods and cross entropy for capacitated vehicle routing problem (CVRP) resolving. In: IOP Conference Series: Materials Science and Engineering (2018)","DOI":"10.1088\/1757-899X\/462\/1\/012025"},{"key":"10_CR13","first-page":"6535","volume":"8","author":"F Oudouar","year":"2019","unstructured":"Oudouar, F., El Fallahi, A., Zaoui, E.: An improved heuristic based on clustering and genetic algorithm for solving the multi-depot vehicle routing problem. J. Recent Technol. Eng. 8, 6535\u20136540 (2019)","journal-title":"J. Recent Technol. Eng."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, E., Rodriguez-V\u00e1squez, W., M\u00e9ndez, G.: A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services. J. Ind. Eng. Comput. 9, 369\u2013396 (2018)","DOI":"10.5267\/j.ijiec.2017.8.001"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Muniz de Miranda, S., Maghrebi, M.: A more realistic approach towards concrete delivery dispatching problem: using real distance instead spatial distance. Aust. J. Civ. Eng. 16, 1\u201311 (2018)","DOI":"10.1080\/14488353.2017.1408736"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Wicaksono, P., Puspitasari, D., Ariyandanu, S., Hidayanti, R.: Comparison of simulated annealing, nearest neighbour, and tabu search methods to solve vehicle routing problems. In: IOP Conference Series: Earth and Environmental Science (2020)","DOI":"10.1088\/1755-1315\/426\/1\/012138"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Granada-Echeverri, M., Toro, E., Santa, J.: A mixed integer linear programming formulation for the vehicle routing problem with backhauls. J. Ind. Eng. Comput. 10, 295\u2013308 (2019)","DOI":"10.5267\/j.ijiec.2018.6.003"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Haitao, X., Pan, P., Feng, D.: Dynamic vehicle routing problems with enhanced ant colony optimization. discrete dynamics in nature and society (2018)","DOI":"10.1155\/2018\/1295485"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"574","DOI":"10.2507\/IJSIMM18(4)485","volume":"8","author":"T Gocken","year":"2019","unstructured":"Gocken, T., Yaktubay, M.: Comparison of different clustering algorithms via genetic algorithm for VRPTW. Int. J. Simul. Model. 8, 574\u2013585 (2019)","journal-title":"Int. J. Simul. Model."},{"key":"10_CR20","unstructured":"P\u00e9rez, M., Loaiza, R., Flores, P., Ponce, P., Peralta, C.: A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico. Algorithms (2019)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Cui, H., Ruan, G., Xue, J., Xie, R., Wang, L., Feng, X.: A collaborative divide-and-conquer K-means clustering algorithm for processing large data. In: Proceedings of the 11th ACM Conference on Computing Frontiers, New York (2014)","DOI":"10.1145\/2597917.2597918"},{"key":"10_CR22","first-page":"384","volume":"9","author":"H Malik","year":"2018","unstructured":"Malik, H., Amir, M., Mazhar, B., Ali, S., Jalil, R., Khalid, J.: A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services. Int. J. Adv. Comput. Sci. Appl. 9, 384\u2013390 (2018)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Wang, L., Cai, J., Li, M., Liu, Z.: Flexible job shop scheduling problem using an improved ant colony optimization. Sci. Program. (2017)","DOI":"10.1155\/2017\/9016303"},{"issue":"5","key":"10_CR24","first-page":"2883","volume":"14","author":"L Wong","year":"2019","unstructured":"Wong, L., Mauricio, D.S.: Qualities that the activities of the elicitation process must meet to obtain a good requirement. J. Eng. Sci. Technol. (JESTEC) 14(5), 2883\u20132912 (2019)","journal-title":"J. Eng. Sci. Technol. (JESTEC)"},{"key":"10_CR25","unstructured":"The dataset used to support this paper is deposited in the following repository: https:\/\/github.com\/MarcoHuancahuari\/ttracerproject\/blob\/d77b555fb391d8bfd972b5232d6d4480bfc812c4\/Sample%20Dataset%20TTRACER.xlsx"}],"container-title":["Communications in Computer and Information Science","Information Management and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04447-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T16:14:45Z","timestamp":1650557685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04447-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031044465","9783031044472"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04447-2_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIMBig","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on Information Management and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"simbig2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/simbig.org\/SIMBig2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","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":"25","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":"37% - 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":"3","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)"}}]}}