New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

By Roberto Baldacci, Aristide Mingozzi, Roberto Roberti. Operational Research, 2011

551 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/4446c32d7c934039336dddb5f966443fd7b039ad

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

1. Thibaut Vidal
2. Guy Desaulniers
3. Stefan Irnich
4. Fausto Errico
5. Anand Subramanian
6. Michael Schneider

Citations in the corpus

• The time-dependent vehicle routing problem with soft time windows and stochastic travel times (2014, unknown): “The optimal/best known solutions obtained for the classical VRPTW (see Desaulniers et al., 2008; Baldacci et al., 2011) are evaluated under the time-dependent and stochastic travel times by considering soft time windows.”
• New benchmark instances for the Capacitated Vehicle Routing Problem (2017, background): “Small Values, Small Variance (5-10) – demands from UD[5,10].”
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (2014, methodology): “Therefore, we apply the ng-route relaxation [Baldacci et al., 2011], an adaptation of 2-path cuts [Kohl et al.”