An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
By Dominique Feillet, Pierre J. Dejax, Michel Gendreau, Cyrille Gueguen. Networks, 2004
798 citations recorded by the source corpus.
Subfields: Automotive Engineering, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management
View Paper: https://www.semanticscholar.org/paper/b1de0a42a98b388910bd7890b21ddeadc6afe3cb
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
- Stefan Røpke
- Roberto Roberti
- Roberto Baldacci
- Aristide Mingozzi
- Jakob Puchinger
- Richard F. Hartl
- Gerhard Hiermann
- David Pisinger
In Industrial and Manufacturing Engineering
- Roberto Roberti
- Stefan Røpke
- Roberto Baldacci
- Aristide Mingozzi
- Michel Gendreau
- Gilbert Laporte
- Jakob Puchinger
- Richard F. Hartl
In Organizational Behavior and Human Resource Management
- Giovanni Righini
- Matteo Salani
- Stefan Røpke
- Roberto Baldacci
- Aristide Mingozzi
- Roberto Roberti
- Michel Gendreau
Citations in the corpus
- The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (2016, methodology): “To reduce the number of labels we use label elimination methods based on dominance checks as described in Feillet et al. (2004). By identifying and removing dominated labels we can reduce the number of labels significantly which directly impacts the overall performance of the algorithm.”
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (2011, background): “Their algorithm could not solve three instances solved by Fukasawa et al. (2006). However, it is faster with regard to the problems solved by both methods.”
- Traveling Salesman Problems with Profits (2005, methodology): “A dynamic programming procedure, which extends dynamic programming procedures developed for the nonelementary shortest path problem with resource constraints (Feillet et al. 2003), is used to solve the subproblem.”
- Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (2006, methodology): “[11], we developed labelcorrecting algorithms, where for each vertex the states are ordered by non-decreasing resource consumption.”
- New dynamic programming algorithms for the resource constrained elementary shortest path problem (2008, methodology): “[15], who suggested some improvements to the basic Desrochers’ algorithm [7].”
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (2008, methodology): “However, recently label-setting algorithms have become the most popular approach to solve the ESPPRC; see, e.g., Dumitrescu (2002) and Feillet et al. (2004).”
- The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies (2012, methodology): “We solve the pricing problem with a labelling algorithm built on ideas from Chabrier (2006) and Feillet et al. (2004).”
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (2012, methodology): “Algorithms based on the computation of elementary routes were proposed by Feillet et al. (2004), Danna and Le Pape (2005) and Chabrier (2006).”
- A general heuristic for vehicle routing problems (2007, background): “[48], Irnich and Villeneuve [12], Kallehauge et al.”