A Max–Min Ant System for the split delivery weighted vehicle routing problem

作者：

Highlights：

• This paper proposes the split-delivery weighted vehicle routing problem (SDWVRP).

• A Max–Min Ant System (MMAS-S) algorithm to solve the SDWVRP is developed.

• Large sets of benchmark instances are tested to demonstrate the efficiency of the model.

• SDWVRP are compared with SDVRP and WVRP.

摘要

•This paper proposes the split-delivery weighted vehicle routing problem (SDWVRP).•A Max–Min Ant System (MMAS-S) algorithm to solve the SDWVRP is developed.•Large sets of benchmark instances are tested to demonstrate the efficiency of the model.•SDWVRP are compared with SDVRP and WVRP.

论文关键词：SDVRP,WVRP,Max–Min Ant system,Benchmarking test,Meta-heuristics

论文评审过程：Available online 10 July 2013.

论文官网地址：https://doi.org/10.1016/j.eswa.2013.06.068