A hybrid method for the probabilistic maximal covering location-allocation problem

DOI10.1016/j.cor.2014.12.001zbMath1348.90411OpenAlexW2083487387MaRDI QIDQ337483

Leandro C. Coelho, Marcos Antonio Pereira, Ligia Corrêa de Souza, Luiz Antonio Nogueira Lorena

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2014.12.001

zbMATH Keywords

facility locationhybrid algorithmadaptive large neighborhood searchexact methodcongested systemspmclapqueueing maximal covering location-allocation model

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (9)

The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ An exact approach for the \(r\)-interdiction covering problem with fortification ⋮ The multi-pickup and delivery problem with time windows ⋮ A matheuristic approach to large-scale avionic scheduling ⋮ Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics ⋮ Sequential versus integrated optimization: production, location, inventory control, and distribution ⋮ Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation
• A Lagrangean heuristic for the maximal covering location problem
• Location science research: a review
• The inventory-routing problem with transshipment
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• The Maximal Covering Location Problem with Capacities on Total Workload
• Matheuristics
• A column generation approach for the maximal covering location problem

This page was built for publication: A hybrid method for the probabilistic maximal covering location-allocation problem