Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.

Slides:



Advertisements
Similar presentations
SALES AND LOGISTICS MANAGEMENT
Advertisements

Vehicle Routing: Coincident Origin and Destination Points
The optimum shipment size. Empirical observations The observed cost per ton of a given vehicle or vessel is generally linear with distance. The observed.
Chapter 3 Workforce scheduling.
Network Planning.
ArcLogistics Routing Software for Special Needs, Maintenance and Delivery.
Chapter 7: Transportation Models Skip Ship Routing & Scheduling (pp ) Service Selection Shortest Path Transportation Problem Vehicle Routing &
Inventory Cost Captures time-value of holding product Captures time-value of holding product Perishability, theft, opportunity cost of cash, insurance,
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
1 utdallas.edu/~metin Managing Transportation in a Supply Chain Chapter 13 Sections 4.3, 4.4 and 4.5.
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
MANAGEMENT SCIENCE 461 Lecture 1a – Introduction September 9, 2008.
Routing & Scheduling: Part 1
PROFESSOR GOODCHILD CEE 587 APRIL 15, 2009 Basic Optimization.
Transportation in a Supply Chain
Math443/543 Mathematical Modeling and Optimization
CAPS RoutePro Routing Environment. Solution Methods. Backhauls. Dispatcher Interface. Demonstration.
Typical supply chain upstream downstream.
Logistics Cost Part II Professor Goodchild Spring 11.
Vehicle Routing & Scheduling
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 14 WAREHOUSING E. Gutierrez-Miravete Spring 2001.
Travelling Salesman Problem an unfinished story...
Transportation Logistics Professor Goodchild Spring 2011.
Transportation Logistics Professor Goodchild Spring 2009.
Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
CAPS RoutePro CAPS Logistics Overview RoutePro Dispatcher Features.
Network and Dynamic Segmentation Chapter 16. Introduction A network consists of connected linear features. Dynamic segmentation is a data model that is.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Manufacturing Planning and Control MPC 6 th Edition Chapter.
Transport Decisions Chapter 7
Routing and Scheduling in Transportation. Vehicle Routing Problem Determining the best routes or schedules for pickup/delivery of passengers or goods.
Anne Goodchild | Andrea Gagliano | Maura Rowell October 10, 2013 Examining Carrier Transportation Characteristics along the Supply Chain.
1 1 1-to-Many Distribution Vehicle Routing John H. Vande Vate Spring, 2005.
Network-Based Optimization Models Charles E. Noon, Ph.D. The University of Tennessee.
Metaheuristic – Threshold Acceptance (TA). 2 Outlines ▪ Measuring Computational Efficiency ▪ Construction Heuristics ▪ Local Search Algorithms ▪ Metaheuristic.
Seven-Eleven Japan Co The goal of this case is to illustrate how a firm can be successful by structuring its supply chain to support its supply chain strategy.
Traveling Salesman Problem (TSP)
Main Function of SCM (Part II). Main Functions  Procurement (supplier selection, optimal procurement policies, etc.)  Manufacturing (plant location,
Transportation Logistics Professor Goodchild Spring 2011.
Materials Management Systems
Professor Goodchild Spring 08
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Vehicle Routing Problems
Chapter 7 Transportation. Content….. Drivers of transportation decisions Modes of transportations Devising a strategy for transportation Vehicle scheduling.
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
3-1 Chapter 3: Network Planning CMB 8050 Matthew J. Liberatore.
Vehicle Routing Problem
1 1 Milk Runs and Variability John H. Vande Vate Fall, 2002.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
QUANTITATIVE METHODS FOR MANAGERS ASSIGNMENT MODEL.
1 1 1-to-Many Distribution with Transshipments John H. Vande Vate Spring, 2001.
1 1 Vehicle Routing Part 2 John H. Vande Vate Fall, 2002.
Chapter 13 Transportation in the Supply Chain
Transportation II Lecture 16 ESD.260 Fall 2003 Caplice.
Designing the Distribution Network in a Supply Chain
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
IE 8580 Module 2: Transportation in the Supply Chain
Chapter 13 Transportation in a Supply Chain
Insert your company logo here OVERVIEW
Service Delivery in the Field
Paper Report in ECCO group
Routing and Logistics Arc Routing 2018/11/19.
GEOP 4355 Transportation Routing Models
Transportation in the Supply Chain
TransCAD Vehicle Routing 2018/11/29.
Transport Decisions Chapter 7
Professor Goodchild Cee 587 April 13, 2011
Vehicle Routing John H. Vande Vate Fall,
Presentation transcript:

Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07

Routing and Scheduling Which customers to be visited by each vehicle? Sequence in which they will be visited When will each customer be visited? How much will this cost? Minimize cost and travel time, missed deliveries, comply with constraints (truck size, driver hours)

TSP and VRP Traveling Salesman Problem (TSP): Given N points, find a tour that visits them all, returning to the point of departure, with minimum distance (here we are not dealing with many vehicles) Vehicle Routing Problem (VRP): Find an allocation of points to vehicles, and a set of tours that return to a depot, that minimize either distance, number of vehicles, or a combination of the two (this is the same problem we addressed with the SMM and GA method, but number of vehicles not given)

Text Example: Peapod Online grocer Each day has different realization of deliveries Webvan Example: –distance on grid proportional to actual distance traveled –Cost proportional to distance traveled –Capacity 200 units –Minimize distance traveled

Location/Allocation Segment the area (assign customers to a route) Decide on route

Sequence Customers on Routes Determine an initial route (not necessarily optimal) 1)Farthest insert (add farthest from DC first) 2)Nearest insert (add closest to DC first) 3)Nearest neighbor (add closest to customer just added first) 4)Sweep

Results are not always intuitive Farthest insert (add farthest from DC first) 56 Nearest insert (add closest to DC first) 56 Nearest neighbor (add closest to customer just added first) 66 Sweep 56

Route Improvement Procedures Can we do better than original tours? There are many ways you could do this: –2OPT: break trip 2 spots, reconnect –3OPT: break trip 3 spots, reconnect

Transportation Networks Direct Shipping Milk-run Distribution center (hub) Tailored network (serving different customers with different modes, methods or frequencies)

Trade-offs Management complexity Inbound/outbound transportation costs Cost of facility Inventory Handling Ability to respond to the customer Mode

In-class exercise What attributes of a logistics system make milk-runs appropriate? (e.g. high density customers, large loads) What attributes make a cross-docking facility appropriate? When does it make sense to aggregate inventory?