Intensification-driven local search for the traveling repairman problem with profits
作者：
Highlights：
• The traveling repairman problem with profits has many applications.
• An intensification-driven local search is presented for solving the problem.
• The K-exchange sampling based neighborhood is applied for the first time.
• The algorithm is assessed on 140 benchmark instances.
• 36 improved best-known results (new lower bounds) are reported.
摘要
•The traveling repairman problem with profits has many applications.•An intensification-driven local search is presented for solving the problem.•The K-exchange sampling based neighborhood is applied for the first time.•The algorithm is assessed on 140 benchmark instances.•36 improved best-known results (new lower bounds) are reported.
论文关键词：Combinatorial optimization,Heuristics,Intensification-driven local search,Variable neighborhood search,K-exchange sampling based neighborhood,Traveling repairman problem with profits
论文评审过程：Received 27 August 2021, Revised 7 January 2022, Accepted 28 March 2022, Available online 21 April 2022, Version of Record 4 May 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.117072
