The 2-echelon capacitated vehicle routing problem (2E-CVRP) is a transportation and distribution problem where goods are transported from a depot to a set of customers possible via optional satellite facilities. The 2E-CVRP is relevant in city-logistic applications where legal restrictions make it infeasible to use large trucks within the center of large cities. We propose a new mathematical formulation for the 2E-CVRP with much fewer variables than the previously proposed but with several constraint sets of exponential size. The strength of the model is implied by the facts that many cutting planes proposed for the previous formulations are redundant and that many model symmetries can now be avoided. A branch-and-cut algorithm is developed to solve this model to optimality.
|Publication status||Published - 2010|
|Event||Tristan VII: Seventh Triennial Symposium on Transportation Analysis - Tromsø, Norway|
Duration: 20 Jun 2010 → 25 Jun 2010
Conference number: 7
|Conference||Tristan VII: Seventh Triennial Symposium on Transportation Analysis|
|Period||20/06/2010 → 25/06/2010|