期刊
OR SPECTRUM
卷 42, 期 1, 页码 75-110出版社
SPRINGER
DOI: 10.1007/s00291-019-00568-7
关键词
Multiple depots; Vehicle routing problem; Inter-depot routes; Mixed integer linear programming; Matheuristic
资金
- FCT [UID/MAT/00297/2019, PTDC/EGE-OGE/28071/2017, Lisboa-01.0145-Feder-28071]
- Fundação para a Ciência e a Tecnologia [PTDC/EGE-OGE/28071/2017] Funding Source: FCT
The multi-depot vehicle routing problem with inter-depot routes is studied in this paper, where vehicles may reset their capacity at any depot during the working day. Due to the complexity of this problem, exact approaches are limited to small-size applications. In order to overcome this limitation, we propose a matheuristic which integrates a mixed integer linear programming formulation with a set of relax-and-fix strategies. This solution approach is shown to be very efficient, and for the first time, large-size benchmarking instances are solved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据