A memetic algorithm for the travelling salesperson problem with hotel selection

Authors:
Marco Castro;Kenneth SöRensen;Pieter Vansteenwegen;Peter Goos
Affiliations:
University of Antwerp, Belgium;University of Antwerp, Belgium;Ghent University, Belgium and KU Leuven, Belgium;University of Antwerp, Belgium and Erasmus University Rotterdam, The Netherlands
Venue:
Computers and Operations Research
Year:
2013

Citing 12
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A tabu search heuristic for the vehicle routing problem

Management Science
The String-to-String Correction Problem

Journal of the ACM (JACM)
The vehicle routing problem

The vehicle routing problem
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
Waste collection vehicle routing problem with time windows

Computers and Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Journal of Heuristics
A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities

INFORMS Journal on Computing
MA|PM: memetic algorithms with population management

Computers and Operations Research
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.