The multiple traveling repairman problem with profits consists of multiple repairmen serving a subset of all customers to maximize the revenues collected through the visited customers. To address this problem, an effective hybrid search algorithm based on the memetic framework is proposed. In the proposed method, three features are integrated: a dedicated arc-based crossover to generate high-quality offspring solutions, a fast evaluation technique to reduce the complexity of navigating classical neighborhoods as well as a correcting step to ensure accurate evaluation of neighboring solutions. The performance of the algorithm on 470 benchmark instances were compared with those of the leading reference algorithms. The results show that the proposed algorithm outperforms the state-of-the-art algorithms by setting new records for 137 instances and matching the best-known results for 330 instances. The importance of the key search components of the algorithm was investigated.
» Read on@article{RHWFejor23,
author = {Jintong Ren and Jin-Kao Hao and Feng Wu and Zhang-Hua Fu},
doi = {10.1016/j.ejor.2022.04.007},
journal = {European Journal of Operational Research (EJOR)},
number = {2},
pages = {381-394},
title = {An effective hybrid search algorithm for the multiple traveling repairman problem with profits},
volume = {304},
year = {2023}
}