Heuristic Procedures for Solving the Discrete Ordered Median Problem |
| |
Authors: | Patricia?Domínguez-Marín Email author" target="_blank">Stefan?NickelEmail author Pierre?Hansen Nenad?Mladenovi? |
| |
Institution: | 1.SAP AG,Walldorf,Germany;2.Saarland University and Fraunhofer Institut für Techno- und Wirtschaftsmathematik,Kaiserslautern,Germany;3.GERAD, and MEC Montréal,Montréal,Canada |
| |
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: | genetic algorithms variable neighborhood search discrete facility location |
本文献已被 SpringerLink 等数据库收录! |
|