Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/62326
Title: Pareto mimic algorithm : an approach to the team orienteering problem
Authors: Ke, L
Zhai , L
Li, J
Chan, FTS 
Keywords: Vehicle scheduling
Vehicle routing problem
Team orienteering problem
Pareto dominance
Issue Date: 2016
Publisher: Pergamon Press
Source: Omega, 2016, v. 61, p. 155-166 How to cite?
Journal: Omega 
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.
URI: http://hdl.handle.net/10397/62326
ISSN: 0305-0483
EISSN: 1873-5274
DOI: 10.1016/j.omega.2015.08.003
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

23
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.