A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
By Michel Gendreau, Gilbert Laporte, Frédéric Semet. Parallel Computing, 2001
480 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management
View Paper: https://www.semanticscholar.org/paper/2ed47e639ceb912f654772f35344e7508e2a2cb8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Russell W. Bent
- Pascal Van Hentenryck
- Gilbert Laporte
- Jean-François Cordeau
- Luce Brotcorne
- Frédéric Semet
- Michel Gendreau
- Jean-Yves Potvin
In Industrial and Manufacturing Engineering
- Michel Gendreau
- Gilbert Laporte
- Teodor Gabriel Crainic
- Jean-François Cordeau
- Frédéric Semet
- Russell W. Bent
- Pascal Van Hentenryck
- Jean-Yves Potvin
In Organizational Behavior and Human Resource Management
- Gilbert Laporte
- Jean-François Cordeau
- Russell W. Bent
- Pascal Van Hentenryck
- Luce Brotcorne
- Michel Gendreau
- Frédéric Semet
- Xiaoyan Zhu
Citations in the corpus
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies (2003, background): “In this context, relocating idle vehicles in order to anticipate future demands or to escape from downtown rush hour traffic jam is a major issue [20] [21] [22].”
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms (2003, background): “One way around this difficulty, recently proposed by Gendreau et al. (2001) in the context of dynamic ambulance relocation, is to precompute several scenarios, using parallel computing, in anticipation of future requests.”
- A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (2010, methodology): “[27] also treated the deployment problem for a fleet of emergency vehicles and proposed a master–worker TS based on domain decomposition.”
- Dynamic vehicle routing problems: Three decades and counting (2016, background): “[58]) Automated guided vehicles logistics (Gan et al.”
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (2004, methodology): “Gendreau et al. (2001) present an algorithm for ambulance relocation, which consists of two subproblems.”
- A multiperiod set covering location model for dynamic redeployment of ambulances (2008, background): “There have been two earlier papers on relocation in the EMS literature [10,29].”
- A review of dynamic vehicle routing problems (2013, background): “gency vehicles [23,54,66], or the so-called dynamic allocation problems in the area of long haul truckload trucking [60,109,134].”
- Metaheuristics in Combinatorial Optimization (2005, background): “in Glover (1986). Detailed descriptions of TS, including recent developments, may be found in Gendreau (2003, 2002), Glover (1989, 1990, 1997), Glover and Laguna (1997, 2002), Glover et al.”
- Covering models and optimization techniques for emergency response facility location and planning: a review (2011, methodology): “Location (DACL) model, proposed by Gendreau et al. (2001) and Rajagopalan et al. (2008), respectively.”
- Ambulance location and relocation models (2000, methodology): “It was developed by Gendreau et al. (2001) and makes use of the DSM put forward by the same authors in 1997 (see Section 4).”
- Intelligent Freight Transportation Systems : Assessment and the Contribution of Operations Research (2009, background): “…systems aims to build a plan to provide for efficient operations and resource utilization, while satisfying the demand for transportation within the quality criteria (e.g., delivery time) publicized or agreed upon with the respective customers (see, e.g., the surveys of Crainic, 2000; Crainic and…”
- The dial-a-ride problem: models and algorithms (2006, background): “One way around this difficulty, recently proposed by Gendreau, Laporte and Semet (2001) in the context of dynamic ambulance relocation, is to precompute several scenarios, using parallel computing, in anticipation of future requests.”
- A guide to vehicle routing heuristics (2002, background): “Not all authors use the same rounding or truncating conventions which, as emphasized by Gendreau et al , 25 can lead to vastly different results.”