Pareto mimic algorithm: An approach to the team orienteering problem

Liangjun Ke, Laipeng Zhai, Jing Li, Tung Sun Chan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

31 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)155-166
Number of pages12
JournalOmega (United Kingdom)
Volume61
DOIs
Publication statusPublished - 1 Jun 2016

Keywords

  • Pareto dominance
  • Team orienteering problem
  • Vehicle routing problem
  • Vehicle scheduling

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Information Systems and Management

Cite this