Genetic algorithms for solving the discrete ordered median problem

DOI10.1016/j.ejor.2006.09.069zbMath1121.90087MaRDI QIDQ884020

Jozef Kratica, Zorica Stanimirović, Djordje Dugošija

Publication date: 13 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.069

zbMATH Keywords

genetic algorithms; discrete location; evolutionary computations

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

The ordered capacitated facility location problem, Computing the metric dimension of graphs by genetic algorithms, An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem, Computing minimal doubly resolving sets of graphs, Distribution systems design with role dependent objectives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic procedures for solving the discrete ordered median problem
• The discrete ordered median problem: Models and solution methods.
• Obtaining test problems via Internet
• Exact procedures for solving the discrete ordered median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median