|Title:||Heuristic procedures for solving the discrete ordered median problem||Journal:||Annals of Operations Research||Volume:||136||Issue:||1||First page:||145||Last page:||173||Issue Date:||1-Jan-2005||Rank:||M22||ISSN:||0254-5330||DOI:||10.1007/s10479-005-2043-3||Abstract:||
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which no such approaches have been developed so far. The DOMP generalizes classical discrete facility location problems, such as the p-median and p-center. The first procedure proposed in this paper is based on a genetic algorithm developed by Moreno Vega (1996) for p-median and p-center problems. Additionally, a second heuristic approach based on the Variable Neighborhood Search metaheuristic (VNS) proposed by Hansen and Mladenović (1997) for the p-median problem is described. An extensive numerical study is presented to show the efficiency of both heuristics and compare them.
|Keywords:||Discrete facility location | Genetic algorithms | Variable neighborhood search||Publisher:||Springer Link|
Show full item record
checked on Dec 2, 2021
checked on Dec 3, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.