Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
By David Bredström, Mikael Rönnqvist. European Journal of Operational Research, 2008
399 citations recorded by the source corpus.
Subfields: Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/a8ebd4f5b31ba77115c66297cabcc77b50eb325b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
- Frank Meisel
- Christian Bierwirth
- Tor Justesen
- M. Dias
- Jesper Bach Larsen
- Anthony Stentz
- G. Ayorkor Korsah
- Dorota Slawa Mankowska
Citations in the corpus
- The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies (2012, methodology): “Bredstr¨om and R¨onnqvist (2007) develop a branch-and-price algorithm to solve the model of Bredstr¨om and R¨onnqvist (2008), but without the precedence constraints.”
- Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints (2012, background): “Concluding remarks on exact operation synchronization As a further approach for exact operation s., several authors propose to set a fixed visiting time (Grünert (2006, personal communication); Scheuerer, Sigl (2007, personal communication); Bredström/Rönnqvist [20]).”
- The home health care routing and scheduling problem with interdependent services (2013, background): “Bredström and Rönnqvist [7] model home care staff scheduling as a routing problem for homogeneous vehicles with precedence and synchronization constraints.”
- A comprehensive taxonomy for multi-robot task allocation (2013, background): “Mathematical models have also been proposed for VRPs with simultaneity and/or precedence constraints (Bredström and Rönnqvist, 2007, 2008; Larsen et al., 2009; Rasmussen et al., 2010), and as discussed earlier, these models are better suited to our task allocation scenario than are the machine…”