Abstract
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS) based on decomposing the original problem into sub-problems that are easier to solve. Unlike the original scheme of KS, our approach uses the Clarke–Wright savings algorithm to construct a sequence of smaller sub-problems, which are subsequently solved using mathematical programming strategies. The computational experiments performed on a set of benchmark instances showed that the proposed matheuristics achieves good results in acceptable computational time.
Funder
Scientific Grant Agency of the Ministry of Education of the Slovak Republic and the Slovak Academy of Sciences
Slovak Research and Development Agency
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference34 articles.
1. The truck dispatching problem;Manag. Sci.,1959
2. Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods and Applications, SIAM. [2nd ed.].
3. Lee, J., and Vygen, J. (2014). Integer Programming and Combinatorial Optimization, Springer International Publishing.
4. Improved branch-cut-and-price for capacitated vehicle routing;Math. Program. Comput.,2017
5. A generic exact solver for vehicle routing and related problems;Math. Program.,2017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献