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

Andreas Goerler, Frederik Schulte, Stefan Voß

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

9 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationComputational Logistics - 4th International Conference, ICCL 2013, Proceedings
PublisherSpringer Verlag
Pages173-183
Number of pages11
ISBN (Print)9783642410185
DOIs
Publication statusPublished - 1 Jan 2013
Externally publishedYes
Event4th International Conference on Computational Logistics, ICCL 2013 - Copenhagen, Denmark
Duration: 25 Sep 201327 Sep 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8197 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Computational Logistics, ICCL 2013
CountryDenmark
CityCopenhagen
Period25/09/1327/09/13

Keywords

  • Late Acceptance Hill-Climbing
  • Metaheuristic
  • Traveling Purchaser Problem

Fingerprint Dive into the research topics of 'An application of late acceptance hill-climbing to the traveling purchaser problem'. Together they form a unique fingerprint.

  • Cite this

    Goerler, A., Schulte, F., & Voß, S. (2013). An application of late acceptance hill-climbing to the traveling purchaser problem. In Computational Logistics - 4th International Conference, ICCL 2013, Proceedings (pp. 173-183). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8197 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_13