vehicle routing l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Vehicle Routing PowerPoint Presentation
Download Presentation
Vehicle Routing

Loading in 2 Seconds...

play fullscreen
1 / 3

Vehicle Routing - PowerPoint PPT Presentation


  • 140 Views
  • Uploaded on

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.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Vehicle Routing' - jermaine


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
vehicle routing

Vehicle Routing

Service Delivery in the Field

clarke wright algorithm
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.
steps in c w algorithm
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.