Smart Routes: A System for Development and Comparison of Algorithms for Solving Vehicle Routing Problems with Realistic Constraints

Author:

,Soroka A. G.,Mikhelson G. V., ,Mescheryakov A. V., , ,Gerasimov S. V.,

Abstract

The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth. While we are aware of approaches that theoretically provide an exact optimal solution, their application becomes challenging as the problem size increases because of exponential complexity. We investigate the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and compare solutions obtaining by exact solver SCIP [1] with heuristic algorithms such as LKH, 2-OPT, 3-OPT [2], the OR-Tools framework [3], and the deep learning model JAMPR [4]. We demonstrate that for problem of size 50 deep learning and classical heuristic solutions became close to SCIP exact solution but requires less time. Additionally for problems with size 100, SCIP exact methods ∼ 13 times slower that neural and classical heuristics with the same route cost and on ∼ 50% worse for the first feasible solution on the same time. To conduct experiments, we developed the Smart Routes platform for solving route optimization problems, which includes exact, heuristic, and deep learning models, and facilitates convenient integration of custom algorithms and datasets.

Publisher

The Russian Academy of Sciences

Reference21 articles.

1. 1. Bestuzheva, K., Besan¸con, M., Wei-Kun Chen, et al., , The SCIP Optimization Suite 8.0, Technical Report, Optimization Online, 2021. http://www.optimization-online.org/DB_HTML/2021/12/8728. html

2. 2. Helsgaun, K., An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, European Journal of Operational Research, Elsevier Publ., 2000, vol. 126, no. 1, pp. 106-130.

3. 3. Perron, L., Operations Research and Constraint Programming at Google, International Conference on Principles and Practice of Constraint Programming, Springer, 2011, pp. 2-2.

4. 4. Falkner, J.K. and Schmidt-Thieme, L., Learning to Solve Vehicle Routing Problems with Time Windows Through Joint Attention, arXiv preprint arXiv:2006.09100, 2020.

5. 5. Laporte, G. and Nobert, Y., A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem, Operations-Research-Spektrum, Springer, 1983, vol. 5, pp. 77-85.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3