A hybrid method for the probabilistic maximal covering location-allocation problem
DOI10.1016/J.COR.2014.12.001zbMATH Open1348.90411OpenAlexW2083487387MaRDI QIDQ337483FDOQ337483
Authors: Leandro C. Coelho, Marcos A. Pereira, Luiz Antonio Nogueira Lorena, Ligia C. de Souza 
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
Recommendations
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- An exact algorithm for the maximal covering problem
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
exact methodhybrid algorithmfacility locationadaptive large neighborhood searchcongested systemspmclapqueueing maximal covering location-allocation model
Cites Work
- Title not available (Why is that?)
- The inventory-routing problem with transshipment
- Matheuristics
- 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
- Location science research: a review
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow 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
- The Maximal Covering Location Problem with Capacities on Total Workload
- A column generation approach for the maximal covering location problem
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
Cited In (16)
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics
- Hybrid metaheuristic method for determining locations for long-term health care facilities
- Sequential versus integrated optimization: production, location, inventory control, and distribution
- A matheuristic approach to large-scale avionic scheduling
- A practical heuristic for maximum coverage in large-scale continuous location problem
- A VNS-LP algorithm for the robust dynamic maximal covering location problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- A separation based optimization approach to dynamic maximal covering location problems with switched structure
- The multi-pickup and delivery problem with time windows
- A survey of adaptive large neighborhood search algorithms and applications
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- The Maximal Expected Covering Location Problem: Revisited
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Uses Software
This page was built for publication: A hybrid method for the probabilistic maximal covering location-allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337483)
