1 / 3

Vehicle Routing

Vehicle Routing. Service Delivery in the Field. Clarke-Wright Algorithm. Objective: Create a route that minimizes distance (time) traveled from a depot to several customers. Net savings S ij by linking two locations I and j.

jermaine
Télécharger la présentation

Vehicle Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Vehicle Routing Service Delivery in the Field

  2. Clarke-Wright Algorithm • Objective: Create a route that minimizes distance (time) traveled from a depot to several customers. • Net savings Sij by linking two locations I and j. • Routes can be constrained (e.g. vehicle capacity) or unconstrained.

  3. Steps in C-W Algorithm • Construct a shortest-distance half-matrix. • Assign one round-trip to each location. • Calculate the net savings for each pair of outlying locations, and enter them in a net savings half-matrix. • Enter values for trip indicator T (2 for round trip, 1 for one way, and 0 for no travel) into appropriate cells of the half-matrix. • Identify the cell with the maximum net saving and link the locations provided T>0, locations not already on a route, and other constrains are met.

More Related