Affordable Access

Parallelization of the Vehicle Routing Problem with Time Windows

Authors
Publication Date
Keywords
  • This Dissertation Presents A Number Of Algorithms For Solving The Vehicle Routing Problem With Time
  • The Vrptw Is A Generalization Of The Well Known Capacity Constrained Vehicle Routing Problem (Vrp)
  • In The Vrp A Fleet Of Vehicles Based At A Central Depot Must Service A Set Of Customers
  • In The Vrptw Each Customer Has A Time Window
  • Service Of A Customer Must Begin Within The Interval Given By The Time Window
  • The Objective Is To Minimize Some Aspect Of Operating Costs (E
  • G
  • Total Distance Traveled
  • Number Of Vehicles Needed Or A Combination Of Parameters)
  • Since The Late 80'S And The Beginning Of The 90'S Optimal Methods For The Vrptw Have Appeared In The
  • Methods Have Basicly Been Based On Three Approaches: Dynamic Programming
  • Lagrange Relaxation And Column Generation (Dantzig-Wolfe)
  • The Most Successful Approaches Rely On Column Generation
  • Good Results Have Also Been Obtained Using Lagrange Relaxation
  • This Dissertation Is Divided Into Three Parts
  • First The Theoretical Framework Is Described
  • Thereafter A Number Of Techniques To Improve The Performance Of The Column-Generation Framework Are
  • Finally A Parallel Algorithm Based On The Sequential Algorithm Developed In The Previous Part Of The

Abstract

Parallelization of the Vehicle Routing Problem with Time Windows - DTU Orbit (15/04/14) Larsen, J. (1999). Parallelization of the Vehicle Routing Problem with Time Windows. (IMM-PHD-1999-62).

There are no comments yet on this publication. Be the first to share your thoughts.