Management Science 461 Lecture 8 – Vehicle Routing November 4, 2008.

Slides:



Advertisements
Similar presentations
Vehicle Routing: Coincident Origin and Destination Points
Advertisements

Great Theoretical Ideas in Computer Science
Chapter 5 Fundamental Algorithm Design Techniques.
VEHICLE ROUTING PROBLEM
A tabu search heuristic to solve the split delivery Vehicle Routing Problem with Production and Demand Calendars (VRPPDC) Marie-Claude Bolduc Gilbert Laporte,
DOMinant workshop, Molde, September 20-22, 2009
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Minimizing Multi-Hop Wireless Routing State under Application- based Accuracy Constraints Mustafa Kilavuz & Murat Yuksel University of Nevada, Reno.
Routing & Scheduling: Part 1
1.224J Recitation #4 Freight transportation. Topics Homework questions Home Depot MVRP: Multi vehicle routing problem – Applications – Formulation – Heuristics.
PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.
CAPS RoutePro Routing Environment. Solution Methods. Backhauls. Dispatcher Interface. Demonstration.
Vehicle Routing & Scheduling
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 14 WAREHOUSING E. Gutierrez-Miravete Spring 2001.
CSE 550 Computer Network Design Dr. Mohammed H. Sqalli COE, KFUPM Spring 2007 (Term 062)
A hybrid heuristic for an inventory routing problem C.Archetti, L.Bertazzi, M.G. Speranza University of Brescia, Italy A.Hertz Ecole Polytechnique and.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow
Energy, Energy, Energy  Worldwide efforts to reduce energy consumption  People can conserve. Large percentage savings possible, but each individual has.
The Travelling Salesman Problem (TSP)
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.
LOGO AAIA’2012 \ WCO’ – 12 september, 2012 S. Deleplanque, A. Quilliot. LIMOS, CNRS, BLAISE PASCAL UNIVERSITY, Clermont-Ferrand (FRANCE) Wrocław,
Routing and Scheduling in Transportation. Vehicle Routing Problem Determining the best routes or schedules for pickup/delivery of passengers or goods.
A Multi-Start Approach for Optimizing Routing Networks with Vehicle Loading Constraints Angel Juan Oscar Domínguez Department.
Edward Kent Jason Atkin Rong Qi 1. Contents Vehicle Routing Problem VRP in Forestry Commissioning Loading Bay Constraints Ant Colony Optimisation Handing.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
1 1 1-to-Many Distribution Vehicle Routing John H. Vande Vate Spring, 2005.
1 A Guided Tour of Several New and Interesting Routing Problems by Bruce Golden, University of Maryland Edward Wasil, American University Presented at.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
A Survey of Distributed Task Schedulers Kei Takahashi (M1)
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
LECTURE 13. Course: “Design of Systems: Structural Approach” Dept. “Communication Networks &Systems”, Faculty of Radioengineering & Cybernetics Moscow.
Slide 1 Chapter 9 Mesh Network Design - II. Slide 2 Mesh Network Design The design of backbone networks is governed by 3 goals: nDirect path between source.
K. Panchamgam, Y. Xiong, B. Golden*, and E. Wasil Presented at INFORMS Annual Meeting Charlotte, NC, November 2011 *R.H. Smith School of Business University.
and 6.855J Lagrangian Relaxation I never missed the opportunity to remove obstacles in the way of unity. —Mohandas Gandhi.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
Hierarchical Multiplex Structured Model for Vehicle Routing, Scheduling, and Dispatching Problems Tokyo Institute of Technology Kewei Chen, Kaoru Hirota.
Vehicle Routing & Scheduling
Traveling Salesman Problem (TSP)
Transportation Logistics Professor Goodchild Spring 2011.
Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.
Model 5 Long Distance Phone Calls By Benjamin Cutting
Vehicle Routing Problems
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Vehicle Routing Problem
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Retail Distribution Inside a City or small Region.
BASIC FACILITY LOCATION PROBLEMS Facility location problems deal with the question of where to place facilities & how to assign customers Location analysis.
© 2010 IBM Corporation IBM Container Transport Optimization Dr. Juergen Koehl, IBM Research and Development, Boeblingen Juergen Koehl, IBM Container Logistics.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
St. Edward’s University
1 The Travelling Salesman Problem (TSP) H.P. Williams Professor of Operational Research London School of Economics.
Service Delivery in the Field
Presented by Rich Goyette
1.3 Modeling with exponentially many constr.
GEOP 4355 Transportation Routing Models
TransCAD Vehicle Routing 2018/11/29.
The Hierarchical Traveling Salesman Problem
L12. Network optimization
Professor Goodchild Cee 587 April 13, 2011
1.3 Modeling with exponentially many constr.
Planning the transportation of elderly to a daycare center
Vehicle Routing John H. Vande Vate Fall,
Presentation transcript:

Management Science 461 Lecture 8 – Vehicle Routing November 4, 2008

2 Basic Vehicle Routing Problem Extend the TSP Given customer and depot locations, demands, vehicle capacity Find a set of tours that minimize the total cost  Many potential constraints on tours… Two tasks: Assign customers to tours, optimize tours

Vehicle Capacity =20 Route length = 8 hrs

4 Cluster-Route

5 Finding Clusters Seeding – choose some nodes, “grow” each cluster from the node Sweep – like a radar screen Grid – Overlay a grid, cluster based on the grid

6 Route-Cluster (eg Sweep)

7 Clarke-Wright Savings “Savings heuristic” Assume that each node served by a single truck For each pair, calculate the savings incurred by merging the two trips together Rank savings, keep merging Is this a greedy (myopic) heuristic?

8 Savings Depot Cust 2 Cust 1 Depot Cust 2 Cust 1 Savings = d(Depot,1) + d(2,Depot) - d(2,1)

9 Savings s ij = c ia + c aj - c ij c ai + c ia +c aj + c ja i j a c ai + c ja + c ij i j a vs.

10 Savings Continued Rank savings from largest to smallest Run through the list and merge routes represented by the two nodes as long as:  combined route length < MAX length  combined weight < MAX weight  other constraints as necessary  nodes are not already on same route  neither node is interior

11 Interior customers Cust 2 Cust 1 Cust 3 Customer 2 is interior to the route

12 An Optimization-Based Approach to Vehicle Routing Bramel, J. and D. Simchi-Levi, 1995, A Location Based Heuristic for General Routing Problems, Operations Research, 43, Fisher, M. L. and R. Jaikumar, 1981, A Generalized Assignment Heuristic for Vehicle Routing, Networks, 11,

13 Comparison of Heuristics Accuracy (how close to optimal) Speed (computation time) Simplicity (ease of understanding and implementation) Flexibility (ease of adding other constraints – e.g., time windows, multiple depots)

14 Comparison of Heuristics AccuracySpeedSimplicityFlexibility SavingsLowVery highLow SweepLowMedium- high HighMedium B&S-LMediumLow Meta- heuristics High to very high Medium High Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin, F. Semet, 2002, “A Guide to Vehicle Routing Heuristics,” Journal of the Operational Research Society, 53, pp