Variable neighborhood search for consistent vehicle routing problem

作者：

Highlights：

• A new algorithm for ConVRP is proposed. It outperforms extant algorithms for ConVRP.

• Several techniques are used to reduce computational time of iterated local search.

• An effective shaking method is proposed.

• Time differences of customer points are calculated using a new method.

摘要

•A new algorithm for ConVRP is proposed. It outperforms extant algorithms for ConVRP.•Several techniques are used to reduce computational time of iterated local search.•An effective shaking method is proposed.•Time differences of customer points are calculated using a new method.

论文关键词：Two-stage algorithm,Template,Diverge,Local search

论文评审过程：Received 26 December 2017, Revised 4 June 2018, Accepted 2 July 2018, Available online 4 July 2018, Version of Record 8 July 2018.

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