A genetic algorithm for solving a capacitated \(p\)-median problem

DOI10.1023/B:NUMA.0000021767.42899.31zbMath1043.90043MaRDI QIDQ596685

Maria Teresinha A. Steiner, Celso Carnieri, Alex A. Freitas, Elon Santos Correa

Publication date: 10 August 2004

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

tabu searchgenetic algorithms\(p\)-median problemfacility-location

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (14)

Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Application of global optimization methods to model and feature selection ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ Model-based capacitated clustering with posterior regularization ⋮ Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem ⋮ Metaheuristic applications on discrete facility location problems: a survey

This page was built for publication: A genetic algorithm for solving a capacitated \(p\)-median problem