Fast heuristics for large scale covering-location problems

DOI10.1016/S0305-0548(99)00088-XMaRDI QIDQ5959388zbMATH OpenFDO

Authors L. Brotcorne, G. Laporte, F. Semet

Publication date 3 April 2002

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(99)00088-X

zbMATH Keywords

cliquesgraph colouringheuristicslocationset covering

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Two new heuristics for the location set covering problem
• An adaptation of SH heuristic to the location set covering problem
• New heuristics for the conditional covering problem
• Solving the maximal covering location problem with heuristic concentration
• A practical heuristic for maximum coverage in large-scale continuous location problem

Cites work

• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A tiling and routing heuristic for the screening of cytological samples
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 956847 (Why is no real title available?)
• On the Complexity of Some Common Geometric Location Problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Solving an ambulance location model by tabu search
• The p-cover problem

Cited in

(12)

• A new model for maximal coverage exploiting GIS capabilities
• Covering models and optimization techniques for emergency response facility location and planning: a review
• Solving the maximal covering location problem with heuristic concentration
• A multiperiod set covering location model for dynamic redeployment of ambulances
• A review on algorithms for maximum clique problems
• A tiling and routing heuristic for the screening of cytological samples
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• A practical heuristic for maximum coverage in large-scale continuous location problem
• A decomposition heuristic for the maximal covering location problem
• Fuzzy goal programming models for analyzing demand coverage
• Developing effective meta-heuristics for a probabilistic location model via experimental design

This page was built for publication: Fast heuristics for large scale covering-location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959388)