Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem

DOI10.1016/j.ejor.2012.04.016zbMath1253.90130OpenAlexW1968756810MaRDI QIDQ1926910

Javier Alcaraz, Mercedes Landete, Juan Francisco Monge

Publication date: 29 December 2012

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

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

zbMATH Keywords

metaheuristicsgenetic algorithms\(p\)-median problemscatter search

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (13)

The linear ordering problem with clusters: a new partial ranking ⋮ A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage ⋮ A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ The reliable \(p\)-median problem with at-facility service ⋮ Strengthening the reliability fixed-charge location model using clique constraints ⋮ On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management ⋮ A bi-level programming model for protection of hierarchical facilities under imminent attacks ⋮ Unnamed Item ⋮ Introducing capacities in the location of unreliable facilities ⋮ On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Multi-objective evolutionary algorithms for a reliability location problem ⋮ Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics

Uses Software

• OR-Library
• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for solving a capacitated \(p\)-median problem
• Complexity evaluation of benchmark instances for the \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• A genetic algorithm for the \(p\)-median problem with pos/neg weights
• An effective VNS for the capacitated \(p\)-median problem
• A note on solving large p-median problems
• Heuristic methods for large centroid clustering problems
• An efficient genetic algorithm for the \(p\)-median problem
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• The parallel variable neighborhood search for the \(p\)-median problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• A tighter formulation of the \(p\)-median problem
• A neural model for the \(p\)-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Solving Large p-Median Problems with a Radius Formulation
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Solution methods for thep-median problem: An annotated bibliography
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• Variable neighborhood search for the p-median
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• Large neighborhood local search for the p-median problem
• A hybrid data mining metaheuristic for the p‐median problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Variable neighborhood search: Principles and applications

This page was built for publication: Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem