Optimization Online


Layered Formulation for the Robust Vehicle Routing Problem with Time Windows

Agostinho Agra (aagra***at***ua.pt)
Marielle Christiansen (marielle.christiansen***at***iot.ntnu.no)
Rosa Figueiredo (rosa.figueiredo***at***ua.pt)
Lars M. Hvattum (lars.m.hvattum***at***iot.ntnu.no)
Michael Poss (mposs***at***ulb.ac.be)
Cristina Requejo (crequejo***at***ua.pt)

Abstract: This paper studies the vehicle routing problem with time windows where travel times are uncertain and belong to a predetermined polytope. The objective of the problem is to find a set of routes that services all nodes of the graph and that are feasible for all values of the travel times in the uncertainty polytope. The problem is motivated by maritime transportation where delays are frequent and must be taken into account. We present an extended formulation for the vehicle routing problem with time windows that allows us to apply the classical (static) robust programming approach to the problem. The formulation is based on a layered representation of the graph, which enables to track the position of each arc in its route. We test our formulation on a test bed composed of maritime transportation instances.

Keywords: vehicle routing problem, robust programming, time windows, maritime transportation, layered formulation

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Robust Optimization

Category 3: Integer Programming

Citation: Accepted at ISCO 2012

Download: [PDF]

Entry Submitted: 02/06/2012
Entry Accepted: 02/06/2012
Entry Last Modified: 02/06/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society