Authors: Hansen, Pierre
Mladenović, Nenad 
Title: Complement to a comparative analysis of heuristics for the p-median problem
Journal: Statistics and Computing
Volume: 18
Issue: 1
First page: 41
Last page: 46
Issue Date: 1-Mar-2008
Rank: M21
ISSN: 0960-3174
DOI: 10.1007/s11222-007-9036-9
A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaining exact optimal values in order to evaluate errors precisely, and (ii) including results obtained with several variants of a variable neighborhood search (VNS) heuristic. For a first, well-known, series of instances, the average errors of the evolutionary and neural network heuristics are over 10% and more than 1000 times larger than that of VNS. For a second series, this error is about 3% while the errors of the parallel VNS and of a hybrid heuristic are about 0.01% and that of parallel scatter search even smaller.
Keywords: Evolutionary algorithm | Genetic algorithm | Metaheuristics | Neural networks | P-median | Scatter search | Variable neighborhood search
Publisher: Springer Link

Show full item record


checked on Jul 13, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.