Pareto mimic algorithm: An approach to the team orienteering problem |
| |
Affiliation: | 1. School of Information Systems, Singapore Management University, 178902, Singapore;2. KU Leuven, Leuven Mobility Research Center, CIB, Celestijnenlaan 300, Leuven 3001, Belgium;1. School of Management, Huazhong University of Science and Technology, No. 1037, Luoyu Road, Wuhan, China;2. School of Electronic Engineering and Computer Science, Queen Mary University of London, London, United Kingdom |
| |
Abstract: | The team orienteering problem is an important variant of the vehicle routing problem. In this paper, a new algorithm, called Pareto mimic algorithm, is proposed to deal with it. This algorithm maintains a population of incumbent solutions which are updated using Pareto dominance. It uses a new operator, called mimic operator, to generate a new solution by imitating an incumbent solution. Furthermore, to improve the quality of a solution, it employs an operator, called swallow operator which attempts to swallow (or insert) an infeasible node and then repair the resulting infeasible solution. A comparative study supports the effectiveness of the proposed algorithm, especially, our algorithm can quickly find new better results for several large-scale instances. We also demonstrate that Pareto mimic algorithm can be generalized to solve other routing problems, e.g., the capacitated vehicle routing problem. |
| |
Keywords: | Vehicle scheduling Vehicle routing problem Team orienteering problem Pareto dominance |
本文献已被 ScienceDirect 等数据库收录! |
|