1 / 20

VRP

VRP. Vehicle Routing Problem. What is VRP. Objective Minimize routing costs. Variations. No. of vehicles No. of depots Time windows Returned goods Combinations. Motivation. Deliveries Airlines Cargo Ships. Solutions techniques. Route first, Partition later

Download Presentation

VRP

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. VRP Vehicle Routing Problem

  2. What is VRP • Objective • Minimize routing costs.

  3. Variations • No. of vehicles • No. of depots • Time windows • Returned goods • Combinations

  4. Motivation • Deliveries • Airlines • Cargo Ships

  5. Solutions techniques • Route first, Partition later • Partition first, Route later

  6. Route first, Partition later • Finding a short path through the set of customers sites first. • Equivalent to TSP • Partition customers into subsets s.t: For each subset Si, vehicle V: Tdemand (Si) <= capacity (V) • Choose the one which minimizes the total cost.

  7. Partition first, Route later • Computes the polar coordinates of each customer with respect to the depot. • The sites are then sorted by increasing polar angle. • Start from arbitrary customer and sweep through consecutive customers. • For each Ci in customers • Add customer to subset Si while • Capacity(Si)+Capacity(Ci)<=Capacity(V) • Compute TSP for all subsets.

  8. α

  9. Equivalence to TSP • VRPis a generalization of the Traveling Salesperson. • TSP= VRP with one vehicle with no limits, no depot, customers with no demand. • Therefore is NP-Hard.

  10. Demo

  11. Sweep radius

  12. Improvements

  13. TSP vs. SWEEP • Which is better ???

  14. ??? Thank you!

More Related