Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
By Stefan Røpke, Jean-François Cordeau, Gilbert Laporte. Networks, 2007
308 citations recorded by the source corpus.
Subfields: Automotive Engineering, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/063d00e6e535175aaa3de38707e744e74e5e2bcc
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Automotive Engineering
- Thibaut Vidal
- Christian Prins
- Teodor Gabriel Crainic
- Michel Gendreau
- Xuesong Zhou
- Monirehalsadat Mahmoudi
- Michael Drexl
- Gilbert Laporte
In Computer Vision and Pattern Recognition
- Teodor Gabriel Crainic
- Thibaut Vidal
- Christian Prins
- Michel Gendreau
- Xuesong Zhou
- Monirehalsadat Mahmoudi
In Industrial and Manufacturing Engineering
- Thibaut Vidal
- Teodor Gabriel Crainic
- Christian Prins
- Michel Gendreau
- Xuesong Zhou
- Monirehalsadat Mahmoudi
- Michael Schneider
- Michael Drexl
Citations in the corpus
- Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “For the CCVRP, Ngueveu et al. (2010) and Ribeiro and Laporte (2012) successfully extended the concepts of, respectively, the hybrid GA with giant tour representation of (Prins 2004), and the ALNS of Pisinger and Ropke (2007), Working and driving hours regulations.”
- Finding Optimal Solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A Dynamic Programming Approach Based on State-space-time Network Representations (2015, methodology): “Ropke et al. (2007) presented a branch-and-cut algorithm to minimize the total routing cost, based on a two-index formulation.”
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (2013, unknown): “…Savelsbergh and Sol, 1998) (Xu, et al., 2003) (Sigurd and Pisinger, 2004) used branch and price schemes for the PDPTW. ( J.-F. Cordeau, 2006) (Ropke, et al., 2007) developed branch and cut approach for the PDPTW. (Ropke and Cordeau, 2009) introduced a new branch and cut and price algorithm for…”