Complement to a comparative analysis of heuristics for the <Emphasis Type="Italic">p</Emphasis>-median problem |
| |
Authors: | Pierre Hansen Nenad Mladenović |
| |
Institution: | (1) GERAD and HEC Montréal, Montréal, Québec, H3T 2A7, Canada;(2) GERAD and School of Mathematics, Brunel University, Kingston Lane, Uxbridge, London, UB8 3PH, UK |
| |
Abstract: | 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: | p-median Metaheuristics Evolutionary algorithm Genetic algorithm Neural networks Scatter search Variable neighborhood search |
本文献已被 SpringerLink 等数据库收录! |
|