A practical heuristic for maximum coverage in large-scale continuous location problem

DOI10.22124/JMM.2021.18624.1594MaRDI QIDQ5080078zbMATH OpenOpenAlexFDO

Authors Mahdi Imanparast, Vahid Kiani

Publication date 31 May 2022

Full work available at URL https://jmm.guilan.ac.ir/article_4635_43dd386994d4999be00212ee5bcfe838.pdf

zbMATH Keywords

coverage radiuscovering problemsfacility locationlarge-scale datasets

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Lagrangean heuristic for the maximal covering location problem
• Fast heuristics for large scale covering-location problems
• Solving the maximal covering location problem with heuristic concentration
• A decomposition heuristic for the maximal covering location problem
• The large-scale dynamic maximal covering location problem
• The Maximal Expected Covering Location Problem: Revisited
• A hybrid method for the probabilistic maximal covering location-allocation problem
• An extended continuous maximal covering location problem with facility placement

Cites work

• A bibliography for some fundamental problem categories in discrete location science
• A mean-shift algorithm for large-scale planar maximal covering location problems
• A mixed integer formulation for maximal covering by inclined parallelograms
• An exact algorithm for the maximal covering problem
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• Planar maximal covering location problem under block norm distance measure
• Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
• The large-scale dynamic maximal covering location problem

Cited in

(6)

• Intelligent-guided adaptive search for the maximum covering location problem
• How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem
• Fast heuristics for large scale covering-location problems
• A decomposition heuristic for the maximal covering location problem
• Multi-agent single machine scheduling problem with transportation constraints
• Mathematical model and hybrid meta-heuristic solution approaches for hub location problem with hybrid drone-airplane delivery mode

Describes a project that uses

Uses Software

• MOD-DIST
• MENU-OKF
• SITATION

This page was built for publication: A practical heuristic for maximum coverage in large-scale continuous location problem

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