An application of late acceptance hill-climbing to the traveling purchaser problem

Conference paper (2013)

Authors

Andreas Goerler Universität Hamburg
F. Schulte Universität Hamburg, Institute of Information Systems (IWI)
Stefan Voß Universität Hamburg
Affiliation
External organisation
Metaheuristic Late Acceptance Hill-Climbing Traveling Purchaser Problem
More Info
expand_more

Published Date

01-01-2013

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

Late Acceptance Hill Climbing (LAHC) is a recent metaheuristic in the realm of local search based procedures. The basic idea is to delay the comparison between neighborhood solutions and to compare new candidate solutions to a solution having been current several steps ago. The LAHC was first presented at the PATAT 2008 conference and successfully tested for exam timetabling, the traveling salesman problem (TSP) and the magic square problem and the results seemed extraordinary. The purpose of this paper is to analyze the behavior of the method and to provide some extended understanding about its success and limitations. To do so, we investigate the method for a generalized version of the TSP, the traveling purchaser problem.