Heuristic Procedures for Solving the Discrete Ordered Median Problem

  • 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, p-center and Uncapacitated Facility Location problems. The first procedure proposed in this paper is based on a genetic algorithm developed by Moreno Vega [MV96] for p-median and p-center problems. Additionally, a second heuristic approach based on the Variable Neighborhood Search metaheuristic (VNS) proposed by Hansen & Mladenovic [HM97] for the p-median problem is described. An extensive numerical study is presented to show the efficiency of both heuristics and compare them.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:P. Dominguez-Marín, P. Hansen, N. Mladenovic, S. Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13118
Serie (Series number):Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (46)
Document Type:Report
Language of publication:English
Year of Completion:2003
Year of Publication:2003
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:discrete facility location; genetic algorithms; variable neighborhood search
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $