Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods

DOI10.1051/ro/2018026zbMath1411.90199OpenAlexW2799433650WikidataQ129969241 ScholiaQ129969241MaRDI QIDQ4634322

Javad Mohebi, Alireza Eydi

Publication date: 7 May 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018026

zbMATH Keywords

simulated annealing algorithmcapacitated facilitiesfacility relocationgradual maximal covering location problemmulti-objective coveragevariable radius coverage

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

The minimal covering location and sizing problem in the presence of gradual cooperative coverage

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Foundations of location analysis
• The multi-period incremental service facility location problem
• The variable radius covering problem
• The gradual covering decay location problem on a network.
• A maximal covering location model in the presence of partial coverage
• The large-scale dynamic maximal covering location problem
• Solving the maximal covering location problem with heuristic concentration
• The maximal expected coverage relocation problem for emergency vehicles
• The Maximum Coverage Location Problem
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• LOCATING MULTIPLE FACILITIES IN A PLANAR COMPETITIVE ENVIRONMENT
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.
• The generalized maximal covering location problem

This page was built for publication: Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods