Vehicle routing with time windows.

  • Madsen, Oli B.G. (Project Manager)
  • Larsen, Jesper (Project Participant)
  • Clausen, Jens (Project Participant)

    Project Details


    The purpose of the project is to develop and test optimal solution methods to vehicle routing problems with customer time windows. A method based on Dantzig-Wolfe decomposition, generation of valid inequalities, and branch and bound is developed. The results are very promising and the algorithm turns out to be faster than other algorithms considered in the literature, and several previously unsolved problems has been solved to optimality.
    For the time being we are improving the branch and bound procedure and implementing a parallel branch and bound.
    Effective start/end date01/01/199602/07/1999


    Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.