Metaheuristic, models and software for the heterogeneous fleet pickup and delivery problem with split loads

被引:8
作者
Gasque, Diogenes [1 ]
Munari, Pedro [1 ]
机构
[1] Univ Fed Sao Carlos, Rodovia Washington Luis,Km 235, BR-13565905 Sao Carlos, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Pickup and delivery; Heterogeneous fleet; Split load; Metaheuristic; Compact model; LARGE NEIGHBORHOOD SEARCH; VEHICLE-ROUTING PROBLEM; BRANCH-AND-PRICE; TIME WINDOWS; EXACT ALGORITHM; TRANSPORTATION; OPTIMIZATION; COLLECTION; GRASP; CUT;
D O I
10.1016/j.jocs.2021.101549
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper addresses a rich variant of the vehicle routing problem (VRP) that involves pickup and delivery activities, customer time windows, heterogeneous fleet, multiple products and the possibility of splitting a customer demand among several routes. This variant generalizes traditional VRP variants by incorporating features that are commonly found in practice. We present two mixed-integer programming models and propose a metaheuristic based on Adaptive Large Neighborhood Search for the addressed problem. Additionally, to facilitate the use of the proposed approaches in real-world decision-making, we develop an open-source, publicly available web interface that allows one to set and solve VRP variants with the mentioned features. Computational experiments using benchmark instances with up to 150 customers show that the approaches can be used to obtain good-quality solutions in a reasonable time frame in practice.
引用
收藏
页数:13
相关论文
共 45 条