The large-scale dynamic maximal covering location problem

DOI10.1016/J.MCM.2012.07.028MaRDI QIDQ2256429zbMATH OpenOpenAlexFDO

Authors Mohammad Hossein Fazel Zarandi, Soheil Davari, Seyyed Ali Haddad Sisakht

Publication date 19 February 2015

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2012.07.028

zbMATH Keywords

simulated annealingcombinatorial optimizationmetaheuristicsfacility locationlogistics

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Recommendations

• The Maximal Covering Location Problem with Capacities on Total Workload
• A maximal covering location model in the presence of partial coverage
• A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• A mean-shift algorithm for large-scale planar maximal covering location problems

Cited in

(12)

• The multimode covering location problem
• A practical heuristic for maximum coverage in large-scale continuous location problem
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
• Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods
• A separation based optimization approach to dynamic maximal covering location problems with switched structure
• Intelligent-guided adaptive search for the maximum covering location problem
• A simulation model to enable the optimization of ambulance fleet allocation and base station location for increased patient survival
• A mean-shift algorithm for large-scale planar maximal covering location problems
• Multi-period hub set covering problems with flexible radius: a modified genetic solution
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• Multi-period stochastic covering location problems: modeling framework and solution approach

This page was built for publication: The large-scale dynamic maximal covering location problem

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