A simple GRASP+VND for the travelling salesperson problem with hotel selection
In this paper, we present a new metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS). We develop a simple but powerful metaheuristic for the TSPHS. On the existing benchmark instances for which an optimal solution is known, it obtains 27 out of 28 known optimal solutions. For the other instances, it obtains several new best known solutions. This heuristic clearly outperforms the only existing heuristic in the literature.
Year of publication: |
2012-10
|
---|---|
Authors: | CASTRO, Marco ; SÖRENSEN, Kenneth ; VANSTEENWEGEN, Pieter ; GOOS, Peter |
Institutions: | Faculteit Toegepaste Economische Wetenschappen, Universiteit Antwerpen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
The multiple travelling salesperson problem with hotel selection
CASTRO, Marco, (2014)
-
A fast metaheuristic for the travelling salesperson problem with hotel selection
Castro, Marco, (2015)
-
The multiple travelling salesperson problem with hotel selection
Castro, Marco, (2014)
- More ...