Guided construction search metaheuristics for the capacitated p-median problem with single source constraint

DOI10.1057/palgrave.jors.2602135zbMath1152.90509OpenAlexW1988258119MaRDI QIDQ5292808

Samad Ahmadi, Ibrahim. H Osman

Publication date: 25 June 2007

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602135

zbMATH Keywords

data structuresfacility locationperiodicgreedy random adaptive search procedure

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

A variable neighborhood descent approach for the two-dimensional bin packing problem ⋮ Large-scale pickup and delivery work area design ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ A matheuristic for large-scale capacitated clustering ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ Variable neighbourhood search: methods and applications ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ Model-based capacitated clustering with posterior regularization ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• GRASP

This page was built for publication: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint