Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows
作者：
Highlights：
• We focus on heterogeneous TRPTW, a generalization of the TRP.
• The problem is mathematically formulated as MILP.
• We propose heuristic algorithm based on the VNS metaheuristic framework.
• We propose reduction strategies for VNS to reduce algorithm’s running time.
• Efficiency of proposed algorithm is tested on four sets of benchmark instances.
摘要
•We focus on heterogeneous TRPTW, a generalization of the TRP.•The problem is mathematically formulated as MILP.•We propose heuristic algorithm based on the VNS metaheuristic framework.•We propose reduction strategies for VNS to reduce algorithm’s running time.•Efficiency of proposed algorithm is tested on four sets of benchmark instances.
论文关键词：Operations planning,Heterogeneous traveling repairmen problem with time windows,Variable neighborhood search
论文评审过程：Available online 20 May 2013.
论文官网地址：https://doi.org/10.1016/j.eswa.2013.05.036
