Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure

2015 ◽  
Vol 27 (4) ◽  
pp. 658-676 ◽  
Author(s):  
Rafael Martinelli ◽  
Claudio Contardo
2021 ◽  
Vol 1 (1) ◽  
pp. 1-28
Author(s):  
Hao Jiang ◽  
Yuhang Wang ◽  
Ye Tian ◽  
Xingyi Zhang ◽  
Jianhua Xiao

The algorithm recommendation is attracting increasing attention in solving real-world capacitated vehicle routing problems (CVRPs), due to the fact that existing meta-heuristic algorithms often show different performances on different CVRPs. To effectively perform algorithm recommendation for CVRPs, it becomes vital to extract suitable features to characterize the CVRPs accurately. To this end, in this article three groups of penetrating features are proposed to capture the characteristics of CVRPs. The first group consists of some basic features of CVRPs, where several features are suggested to capture the distribution of customer demand, the relationship between customer demand and vehicle capacity, besides some common attributes widely used in CVRPs. The second group is composed of the features extracted from some CVRP solutions generated by local search, where in addition to the feasible and better solutions, the worse solutions and the distribution of travel cost are also used to measure the sensitivity of CVRPs to local search operations. The third group is made up of image features obtained by depicting CVRP instances through images, which is first introduced by us to enhance the generalization of algorithm recommendation. Furthermore, based on the three groups of features, an algorithm recommendation method called ARM-I is built on the basis of a KNN classifier to recommend suitable algorithm for CVRPs. Experimental results on several selected benchmarks demonstrate the effectiveness of the designed features. More interestingly, the proposed ARM-I shows high generalization on real-world instances.


Sign in / Sign up

Export Citation Format

Share Document