vehicle routing scheduling part 2 l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Vehicle Routing & Scheduling: Part 2 PowerPoint Presentation
Download Presentation
Vehicle Routing & Scheduling: Part 2

Loading in 2 Seconds...

play fullscreen
1 / 29

Vehicle Routing & Scheduling: Part 2 - PowerPoint PPT Presentation


  • 229 Views
  • Uploaded on

Vehicle Routing & Scheduling: Part 2. Multiple Routes Construction Heuristics Sweep Nearest Neighbor, Nearest Insertion, Savings Cluster Methods Improvement Heuristics Time Windows. Multiple Routes. Capacitated VRP: vehicles have capacities. Weight, Cubic feet, Floor space, Value.

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 & Scheduling: Part 2' - roch


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 scheduling part 2
Vehicle Routing & Scheduling: Part 2
  • Multiple Routes
  • Construction Heuristics
    • Sweep
    • Nearest Neighbor, Nearest Insertion, Savings
    • Cluster Methods
  • Improvement Heuristics
  • Time Windows
multiple routes
Multiple Routes
  • Capacitated VRP: vehicles have capacities.
    • Weight, Cubic feet, Floor space, Value.
  • Deadlines force short routes.
    • Pickup at end of day.
    • Deliver in early morning.
  • Time windows
    • Pickup.
    • Delivery.
    • Hard or Soft.
multiple route solution strategies
Multiple Route Solution Strategies
  • Find feasible routes.
    • Cluster first, route second.
      • Cluster orders to satisfy capacities.
      • Create one route per cluster. (TSP for each cluster)
    • Route first, cluster second.
      • Create one route (TSP).
      • Break route into pieces satisfying capacities.
    • Build multiple routes simultaneously.
  • Improve routes iteratively.
sweep algorithm
Sweep Algorithm
  • Draw a ray starting from the depot.
  • Sweep clockwise (or counter-clockwise) and add customers to the route as encountered.
  • Start a new route when vehicle is full.
  • Re-optimize each route (solve a TSP for customers in each route).
sweep algorithm5

depot

depot

Sweep Algorithm

Suppose each vehicle capacity = 4 customers

nearest neighbor nearest insertion savings algorithms
Nearest Neighbor, Nearest Insertion & Savings Algorithms
  • Similar to for TSP, but keep track of demand on route.
  • Start new route when vehicle is full.
  • Re-optimize each route (solve a TSP for customers in each route).
nearest neighbor algorithm

First route

depot

depot

Nearest Neighbor Algorithm

Suppose each vehicle capacity = 4 customers

nearest neighbor algorithm8

Second route

Third route

depot

depot

Nearest Neighbor Algorithm

Suppose each vehicle capacity = 4 customers

cluster algorithms
Cluster Algorithms
  • Select certain customers as seed points for routes.
    • Farthest from depot.
    • Highest priority.
    • Equally spaced.
  • Grow routes starting at seeds. Add customers:
    • Based on nearest neighbor or nearest insertion
    • Based on savings.
    • Based on minimum angle.
  • Re-optimize each route (solve a TSP for customers in each route).
cluster with minimum angle

depot

Add customers with minimum angle

Cluster with Minimum Angle

Suppose each vehicle capacity = 4 customers

depot

Select 3 seeds

cluster with minimum angle11
Cluster with Minimum Angle

Suppose each vehicle capacity = 4 customers

depot

Add customers with minimum angle

cluster with minimum angle12
Cluster with Minimum Angle

Suppose each vehicle capacity = 4 customers

depot

Add customers with minimum angle

vrp improvement heuristics
VRP Improvement Heuristics
  • Start with a feasible route.
  • Exchange heuristics within a route.
    • Switch position of one customer in the route.
    • Switch 2 arcs in a route.
    • Switch 3 arcs in a route.
  • Exchange heuristics between routes.
    • Move a customer from one route to another.
    • Switch two customers between routes.
improvement heuristics

Within-route

improvement

Between-route

improvement

Improvement Heuristics

Cluster with Minimum Angle

depot

depot

Starting routes

“Optimized” routes

time windows
Time Windows
  • Problems with time windows involve routing and scheduling.

3,[2-4]

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-10]

Customer number

depot

6,[9-12]

Start and end of time window

(2 pm - 4 pm)

routing with time windows
Routing with Time Windows

Route must be built with both time windows & geography in mind!

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

routing example with time windows
Routing Example with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

nearest insertion with time windows
Nearest Insertion with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 8:00 - 11:00

Arrive at 1: 9:00 - 12:00

Leave 1: 9:30 - 12:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-1

nearest insertion with time windows19
Nearest Insertion with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 10:30

Arrive at 1: 11:30

Leave 1: 12:00

Arrive at 2: 1:00

Leave 2: 1:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-1-2

nearest insertion with time windows20
Nearest Insertion with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 9:00

Arrive at 1: 10:00

Leave 1: 10:30

Arrive at 4: 11:30

Leave 4: 12:00 Arrive at 2: 1:00

Leave 2: 1:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-1-4-2

nearest insertion with time windows one option
Nearest Insertion with Time Windows - one option

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 8:00

Arrive at 1: 9:00

Leave 1: 9:30 Arrive at 5: 10:30

Leave 5: 11:00

Arrive at 4: 12:00

Leave 4: 12:30 Arrive at 2: 1:30

Leave 2: 2:00

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-1-5-4-2

nearest insertion with time windows a better option
Nearest Insertion with Time Windows - a better option

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 7:30

Arrive at 5: 8:30

Leave 5: 9:00

Arrive at 4: 10:00

Leave 4: 10:30 Arrive at 1: 11:30

Leave 1: 12:00

Arrive at 2: 1:00

Leave 2: 1:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-5-4-1-2

nearest insertion with time windows23
Nearest Insertion with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 7:30

Arrive at 5: 8:30

Leave 5: 9:00

Arrive at 4: 10:00

Leave 4: 10:30 Arrive at 1: 11:30

Leave 1: 12:00

Arrive at 2: 1:00

Leave 2: 1:30

Arrive at 3: 2:30

Leave 3: 3:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-5-4-1-2-3

nearest insertion with time windows24
Nearest Insertion with Time Windows

One hour travel time between any two customers.

Half hour delivery time at each customer.

Leave depot: 7:00

Arrive at 5: 8:00

Leave 5: 8:30

Arrive at 6: 9:30

Leave 6: 10:00

Arrive at 1: 11:00

Leave 1: 11:30 Arrive at 4: 12:30

Leave 4: 1:00

Arrive at 2: 2:00

Leave 2: 2:30

Arrive at 3: 3:30

3,[2-4]

1, [9-12]

2,[1-3]

4,[10-2]

5,[8-11]

depot

6,[9-12]

depot-5-6-1-4-2-3

nearest insertion
Nearest Insertion

Time Windows

No Time Windows

depot-5-6-1-4-2-3

depot-1-2-4-3-5-6

3

3

1

2

1

2

4

4

5

5

depot

depot

6

6

clustering and time windows
Clustering and Time Windows
  • Cluster customers based on location and time window.
  • Design routes for each cluster.

3,[2-4]

1, [9-12]

2,[1-3]

4,[3-5]

5,[8-11]

depot

6,[9-12]

clustering and time windows27
Clustering and Time Windows
  • Cluster customers based on location and time window.
  • Design routes for each cluster.

3,[2-4]

1, [9-12]

2,[1-3]

4,[3-5]

5,[8-11]

depot

6,[9-12]

commercial routing software
Commercial Routing Software
  • Consider (some) real-world complexity.
    • Accurate travel times (distances) from shortest paths on actual (GIS) road network.
    • Street addresses from GIS road network (requires address matching).
    • Multiple vehicle types and capacities.
    • Many costs for driver and vehicle.
    • Priorities for orders and customers.
    • Time windows.
    • Compatibilities.
    • Driver rules.
commercial routing software29
Commercial Routing Software
  • Build initial routes quickly with construction heuristics.
    • May violate some constraints (vehicle capacities, time windows, route duration, etc).
  • Improve routes.
    • Within route improvements and between route improvements.
  • Provides:
    • Detailed driving directions for each route (driver).
    • Dispatcher information.
    • Managerial summaries and analysis.