Abstract
Since it is computationally expensive to solve the vehicle routing problem (VRP) optimally, as this problem is NP-hard, in this technical note we study how to accurately approximate the optimal VRP tour length. In our previous papers, we developed a linear regression model including the mean and standard deviation of the modified Clarke and Wright heuristic solution values, which was able to predict the optimal VRP tour length fairly well. In this note, we find that by doing a small amount of extra work to include the minimum of the modified Clarke and Wright heuristic solution values, we can improve the predictive results substantially.
Similar content being viewed by others
Data availability
The datasets generated during and/or analysed as part of the current study are available from the corresponding author upon request.
References
Akkerman, F., Mes, M.: Distance approximation to support customer selection in vehicle routing problems. Ann. Oper. Res., pp. 1–29 (2022)
Basel, J., Willemain, T.R.: Random tours in the traveling salesman problem: analysis and application. Comput. Opt. Appl. 20(2), 211–217 (2001)
Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. Combinatorial Optimization. John Wiley and Sons, London (1979)
Daganzo, C.F.: The distance traveled to visit n points with a maximum of c stops per vehicle: an analytic model and an application. Transp. Sci. 18(4), 331–350 (1984)
Figliozzi, M.A.: Planning approximations to the average length of vehicle routing problems with varying customer demands and routing constraints. Transp. Res. Record 2089(1), 1–8 (2008)
Kou, S., Golden, B., Poikonen, S.: Optimal TSP tour length estimation using standard deviation as a predictor. Comput. Oper. Res. 148, 105993 (2022)
Kou, S., Golden, B., Poikonen, S.: Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization. Int. Trans. Oper. Res. (2023)
Queiroga, E., Sadykov, R., Uchoa, E., & Vidal, T. (2021). 10,000 Optimal CVRP solutions for testing machine learning based heuristics. In: AAAI-22 workshop on machine learning for operations research (ML4OR)
Robust, F., Daganzo, C.F., Souleyrette, R.R., II.: Implementing vehicle routing models. Transp. Res. Part B Methodol. 24(4), 263–286 (1990)
Sinha Roy, D., Golden, B., Masone, A., Wasil, E.: Using regression models to understand the impact of route-length variability in practical vehicle routing. Opt. Lett. 17(1), 163–175 (2023)
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845–858 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Kou, S., Golden, B. & Bertazzi, L. An improved model for estimating optimal VRP solution values. Optim Lett 18, 697–703 (2024). https://doi.org/10.1007/s11590-023-02082-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-023-02082-w