An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery

作者：

Highlights：

• The Vehicle Routing Problem with Simultaneous Pickup and Delivery is considered.

• A hybrid algorithm that combines ACS and VNS approach is developed.

• A number of well-known benchmark problems are solved and compared.

• Proposed algorithm outperformed perturbation based VNS and local search based ACS.

• Some new best solutions for benchmark problem instances are found.

摘要

•The Vehicle Routing Problem with Simultaneous Pickup and Delivery is considered.•A hybrid algorithm that combines ACS and VNS approach is developed.•A number of well-known benchmark problems are solved and compared.•Proposed algorithm outperformed perturbation based VNS and local search based ACS.•Some new best solutions for benchmark problem instances are found.

论文关键词：Vehicle routing problem,Simultaneous pickup and delivery,Time limit,Ant colony system,Variable neighborhood search,Metaheuristics

论文评审过程：Received 8 January 2016, Revised 9 September 2016, Accepted 10 September 2016, Available online 10 September 2016, Version of Record 14 September 2016.

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