{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T19:58:35Z","timestamp":1768247915079,"version":"3.49.0"},"reference-count":71,"publisher":"IGI Global","issue":"1","license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,11]]},"abstract":"<p>The vehicle routing problem with time windows is an NP-hard optimization problem vital to logistics and supply chain management. It involves optimizing vehicle routes to serve customers within time windows and capacity limits. This study proposes a hybrid genetic algorithm combining a nearest neighbor-based initialization with advanced mutation operators. The nearest neighbor method ensures high-quality initial solutions by prioritizing proximity and constraints, while multiple mutation operators enhance exploration and exploitation. Tested on the Solomon 100-customer dataset, NN-IHGA outperformed benchmarks, especially on random and mixed datasets, reducing travel costs and vehicle counts. Results highlight NN-IHGA's robustness and adaptability, offering a practical solution for real-world logistics optimization.<\/p>","DOI":"10.4018\/ijamc.387961","type":"journal-article","created":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:28:57Z","timestamp":1757615337000},"page":"1-30","source":"Crossref","is-referenced-by-count":0,"title":["Advancing Hybrid Metaheuristics"],"prefix":"10.4018","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8753-3429","authenticated-orcid":true,"given":"Aysha","family":"Sohail","sequence":"first","affiliation":[{"name":"King Mongkut's University of Technology, Thonburi, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jumpol","family":"Polvichai","sequence":"additional","affiliation":[{"name":"King Mongkut's University of Technology, Thonburi, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4908-5901","authenticated-orcid":true,"given":"Taninnuch","family":"Lamjiak","sequence":"additional","affiliation":[{"name":"King Mongkut's University of Technology, Thonburi, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3069-6592","authenticated-orcid":true,"given":"Aye Thant","family":"May","sequence":"additional","affiliation":[{"name":"King Mongkut's University of Technology, Thonburi, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"IJAMC.387961-0","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2009.027156"},{"key":"IJAMC.387961-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107403"},{"issue":"3","key":"IJAMC.387961-2","first-page":"118","article-title":"A PSO approach for solving VRPTW with real case study.","volume":"4","author":"S.Amini","year":"2010","journal-title":"International Journal of Research and Reviews in Applied Sciences"},{"key":"IJAMC.387961-3","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"IJAMC.387961-4","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-011-0625-1"},{"key":"IJAMC.387961-5","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00163-1"},{"key":"IJAMC.387961-6","doi-asserted-by":"publisher","DOI":"10.1109\/GOL.2018.8378106"},{"key":"IJAMC.387961-7","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-18147-8"},{"key":"IJAMC.387961-8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.4.417"},{"key":"IJAMC.387961-9","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2010.646"},{"key":"IJAMC.387961-10","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"IJAMC.387961-11","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"IJAMC.387961-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.11.043"},{"key":"IJAMC.387961-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.07.014"},{"key":"IJAMC.387961-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.11.002"},{"key":"IJAMC.387961-15","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3386-5"},{"key":"IJAMC.387961-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksus.2010.03.002"},{"key":"IJAMC.387961-17","doi-asserted-by":"publisher","DOI":"10.3390\/sym14102115"},{"key":"IJAMC.387961-18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.4.1.61"},{"key":"IJAMC.387961-19","author":"L. M.Gambardella","year":"1999","journal-title":"MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows"},{"key":"IJAMC.387961-20","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-7258-1.ch024"},{"key":"IJAMC.387961-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.11.094"},{"key":"IJAMC.387961-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.11.041"},{"key":"IJAMC.387961-23"},{"key":"IJAMC.387961-24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"IJAMC.387961-25","doi-asserted-by":"publisher","DOI":"10.1109\/IDAP.2017.8090185"},{"key":"IJAMC.387961-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.06.028"},{"key":"IJAMC.387961-27","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1486\/3\/032015"},{"key":"IJAMC.387961-28","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/1071\/1\/012025"},{"key":"IJAMC.387961-29","doi-asserted-by":"publisher","DOI":"10.1109\/ICMSS.2010.5577864"},{"key":"IJAMC.387961-30","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS-EERC.2015.30"},{"key":"IJAMC.387961-31","doi-asserted-by":"publisher","DOI":"10.1109\/GCCE53005.2021.9621864"},{"key":"IJAMC.387961-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.469"},{"key":"IJAMC.387961-33","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-5396-0.ch011"},{"key":"IJAMC.387961-34","doi-asserted-by":"publisher","DOI":"10.1007\/s13198-019-00941-3"},{"key":"IJAMC.387961-35","doi-asserted-by":"publisher","DOI":"10.1504\/ijor.2020.105446"},{"key":"IJAMC.387961-36","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-6684-8474-6.ch007"},{"key":"IJAMC.387961-37","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-6684-9130-0.ch001"},{"key":"IJAMC.387961-38","doi-asserted-by":"publisher","DOI":"10.1007\/s13198-024-02433-5"},{"issue":"11","key":"IJAMC.387961-39","first-page":"8","article-title":"Exploring genetic algorithm for shortest path optimization in data networks.","volume":"10","author":"R.Kumar","year":"2010","journal-title":"Global Journal of Computer Science and Technology"},{"key":"IJAMC.387961-40","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390209"},{"key":"IJAMC.387961-41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120009"},{"key":"IJAMC.387961-42","doi-asserted-by":"publisher","DOI":"10.4025\/actascitechnol.v40i1.36708"},{"key":"IJAMC.387961-43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.007"},{"key":"IJAMC.387961-44","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3373699"},{"key":"IJAMC.387961-45","doi-asserted-by":"publisher","DOI":"10.1109\/ICECET52533.2021.9698698"},{"key":"IJAMC.387961-46","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.12.014"},{"issue":"3","key":"IJAMC.387961-47","first-page":"598","article-title":"Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem.","volume":"45","author":"M. A.Mohiuddin","year":"2016","journal-title":"International Journal of Speech Technology"},{"key":"IJAMC.387961-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2014.10.027"},{"key":"IJAMC.387961-49","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-006-6926-z"},{"key":"IJAMC.387961-50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107478"},{"key":"IJAMC.387961-51","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107877"},{"key":"IJAMC.387961-52","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2017.10.066"},{"issue":"3","key":"IJAMC.387961-53","doi-asserted-by":"crossref","first-page":"525","DOI":"10.5267\/j.dsl.2024.5.008","article-title":"Stas crossover with K-mean clustering for vehicle routing problem with time window.","volume":"13","author":"R.Poohoi","year":"2024","journal-title":"Decision Science Letters"},{"key":"IJAMC.387961-54","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"IJAMC.387961-55","doi-asserted-by":"publisher","DOI":"10.9744\/jti.23.1.75-82"},{"key":"IJAMC.387961-56","doi-asserted-by":"publisher","DOI":"10.1109\/ECAI.2015.7301163"},{"key":"IJAMC.387961-57","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430370"},{"key":"IJAMC.387961-58","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013661617536"},{"key":"IJAMC.387961-59","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022096"},{"key":"IJAMC.387961-60","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2017.07.002"},{"key":"IJAMC.387961-61","unstructured":"Shaw, P. (1997). A new local search algorithm providing high quality solutions to vehicle routing problems (Technical report, Department of Computer Science, University of Strathclyde)"},{"key":"IJAMC.387961-62","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"IJAMC.387961-63","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.2.170"},{"key":"IJAMC.387961-64","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-024-53993-w"},{"key":"IJAMC.387961-65","doi-asserted-by":"publisher","DOI":"10.1201\/9781420050080.ch9"},{"key":"IJAMC.387961-66","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2020.07.010"},{"key":"IJAMC.387961-67","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2024069"},{"key":"IJAMC.387961-68","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2021.01.048"},{"key":"IJAMC.387961-69","doi-asserted-by":"publisher","DOI":"10.1109\/IITA.2009.396"},{"key":"IJAMC.387961-70","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/MSF.471-472.801"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=387961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T16:27:46Z","timestamp":1768235266000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.387961"}},"subtitle":["Evaluating NN-IHGA for Vehicle Routing Problem With Time Windows"],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.387961","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]}}}