Complement to a comparative analysis of heuristics for the p-median problem

摘要

A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (ⅰ) gathering or obtaining exact optimal values in order to evaluate errors precisely, and (ⅱ) including results obtained with several variants of a variable neighborhood search (VNS) heuristic. For a first, wellknown, 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.