Vehicle Routing Problem with Time Windows

Vehicle routing and dispatching are important components of many distribution and transportation systems including bank deliveries, postal deliveries, school bus routing, and security patrol services. It is important to emphasise that vehicle routing and dispatching are combinatorial optimisation problems that are extremely hard to solve [1].<div><br/></div><div>The input of this problem is based on the format of Solomon Benchmark data (</div><div><br/></div><div>The output is a plan gamma in which we have a list of routes. Each route, served by a vehicle, contains a sequence of customers in order that it will serve, starting and ending with the depot, meaning that the vehicle starts from the depot, serving customers and return to the depot as the final destination.</div><div><br/></div><div>[1] Hentenryck, Pascal Van, and Russell Bent. Online stochastic combinatorial optimization. The MIT Press, 2009.<br/></div>
  • {{comment.username}}
submission(s) pending review
Bounty expires in
Bounty expired
(no tags)