Quick Directions

Manual Graph Editing:

Menus:

Currently, the user has the choice among three algorithms for solving the VRP problem. The first two algorithms are based on the strategy "route first, partition later" and the last algorithm is based on the strategy "partition first, route later". Neither of the two approaches dominates the other in term of solution quality or speed. However, experience has shown that "route first, partition later" works better when the sites are uniformly distributed in the area and when the truck capacity is small with respect to the total customer demand while the latter "partition first, route later" works better when the sites are more concentrated around the depot and the truck capacity is large.


Back to the Graph Algorithms Applet