Large-scale local search heuristics for the capacitated vertexp-center problem

DOI10.1002/net.20000zbMath1053.90085OpenAlexW1999488323MaRDI QIDQ4474299

Stefano Pallottino, Maria Grazia Scutellà, Maria Paola Scaparra

Publication date: 4 August 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20000

zbMATH Keywords

large-scale optimizationlocation problemsmultiexchange

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Capacitated \(p\)-center problem with failure foresight, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, When centers can fail: a close second opportunity, A Survey of the Generalized Assignment Problem and Its Applications, Dynamically second-preferred \(p\)-center problem, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Exact solution approaches for the discrete α‐neighbor p‐center problem, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, An exact algorithm for the capacitated vertex \(p\)-center problem, Insertion heuristics for central cycle problems, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, Lagrangean duals and exact solution to the capacitated \(p\)-center problem

Uses Software

• CPLEX
• OR-Library

Cites Work

• Unnamed Item
• A Lagrangean heuristic for the maximal covering location problem
• A column generation approach to capacitated \(p\)-median problems
• A class of greedy algorithms for the generalized assignment problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• How to Allocate Network Centers
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• The Capacitated K-Center Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem