Publication
Title
A fast metaheuristic for the travelling salesperson problem with hotel selection
Author
Abstract
The travelling salesperson problem with hotel selection (TSPHS) is a recently proposed variant of the travelling salesperson problem. Currently, the approach that finds the best solutions is a memetic algorithm. However, this approach is unsuitable for applications that require very short computation times. In this paper, a new set-partitioning formulation is presented along with a simple but powerful meta-heuristic for the TSPHS. The algorithm is able to obtain very competitive results while remaining at least one order of magnitude faster than the best-performing method so far. The parameters of the metaheuristic were carefully tuned by means of an extensive statistical experiment.
Language
English
Source (journal)
4 OR: a quarterly journal of operations research. - Berlin
Publication
Berlin : 2015
ISSN
1619-4500
Volume/pages
13:1(2015), p. 15-34
ISI
000351136300002
Full text (Publishers DOI)
Full text (publishers version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 12.05.2015
Last edited 26.03.2017
To cite this reference