Treffer: Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems.

Title:
Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems.
Authors:
Sobhanan, Abhay1 (AUTHOR) sobhanan@usf.edu, Park, Junyoung2 (AUTHOR) junyoung.park@kaist.ac.kr, Park, Jinkyoo2 (AUTHOR) jinkyoo.park@kaist.ac.kr, Kwon, Changhyun2 (AUTHOR) chkwon@kaist.ac.kr
Source:
Transportation Science. Mar/Apr2025, Vol. 59 Issue 2, p322-339. 18p.
Database:
Business Source Premier

Weitere Informationen

When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), where customers are assigned to depots before delivery, and the capacitated location routing problem (CLRP), where the locations of depots should be determined first. A simple and straightforward approach for such hierarchical problems would be to separate the higher-level decisions from the complicated vehicle routing decisions. For each higher-level decision candidate, we may evaluate the underlying vehicle routing problems to assess the candidate. As this approach requires solving vehicle routing problems multiple times, it has been regarded as impractical in most cases. We propose a novel deep learning-based approach called the genetic algorithm with neural cost predictor to tackle the challenge and simplify algorithm developments. For each higher-level decision candidate, we predict the objective function values of the underlying vehicle routing problems using a pretrained graph neural network without actually solving the routing problems. In particular, our proposed neural network learns the objective values of the HGS-CVRP open-source package that solves capacitated vehicle routing problems. Our numerical experiments show that this simplified approach is effective and efficient in generating high-quality solutions for both MDVRP and CLRP and that it has the potential to expedite algorithm developments for complicated hierarchical problems. We provide computational results evaluated in the standard benchmark instances used in the literature. History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023. Funding: This research was funded by the National Research Foundation of Korea [Grant RS-2023-00259550]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0369. [ABSTRACT FROM AUTHOR]

Copyright of Transportation Science is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.