On the impact of local search operators and variable neighbourhood search for the generalized travelling salesperson problem
Files
(Restricted Access)
Date
2015
Authors
Pourhassan, M.
Neumann, F.
Editors
Silva, S.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 2015 Genetic and Evolutionary Computation Conference, 2015 / Silva, S. (ed./s), pp.465-472
Statement of Responsibility
Mojgan Pourhassan, Frank Neumann
Conference Name
2015 Genetic and Evolutionary Computation Conference (GECCO 2015) (11 Jul 2015 - 15 Jul 2015 : Madrid, Spain)
Abstract
The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem where local search approaches have been very successful. We investigate the two hierarchical approaches of Hu and Raidl [9] for solving this problem from a theoretical perspective. We examine the complementary abilities of the two approaches caused by their neighbourhood structures and the advantage of combining them into variable neighbourhood search. We first point out complementary abilities of the two approaches by presenting instances where they mutually outperform each other. Afterwards, we introduce an instance which is hard for both approaches, but where a variable neighbourhood search combining them finds the optimal solution in polynomial time.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2015 ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.