The path cover problem: Formulation and a hybrid metaheuristic

作者：

Highlights：

• This research proposes the path cover problem (PCP).

• A hybridization of variable neighborhood search and tabu search is proposed for solving PCP.

• The proposed algorithm features a new multi-set neighborhood concept.

• Computational results indicate that the proposed algorithm effectively solves PCP.

摘要

•This research proposes the path cover problem (PCP).•A hybridization of variable neighborhood search and tabu search is proposed for solving PCP.•The proposed algorithm features a new multi-set neighborhood concept.•Computational results indicate that the proposed algorithm effectively solves PCP.

论文关键词：Vehicle routing problem,Variable neighborhood search,Tabu search,Hybrid variable neighborhood search and tabu search,Vertex-disjoint path cover problem

论文评审过程：Received 6 May 2018, Revised 30 September 2019, Accepted 28 November 2019, Available online 29 November 2019, Version of Record 31 December 2019.

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