Collaborative Logistics
|
|
- Vivien Shepherd
- 5 years ago
- Views:
Transcription
1 Collaborative Logistics Martin Savelsbergh Ozlem Ergun Gultekin Kuyzu The Logistics Institute Georgia Institute of Technology 35th Annual Conference of the Italian Operations Research Society Lecce, September 7-10, 2004
2 Outline Motivation Lane Covering Problem Variants of the Lane Covering Problem Gain Sharing
3 Why Collaborate? Increasing pressure on companies to operate more efficiently Increasing pressure from customers for better service Realization that suppliers, consumers, and even competitors, can be potential collaborative partners in logistics Connectivity provided by the Internet
4 Trucking Industry Highly fragmented: 100,000+ shipper & 250,000+ Carriers Each shipper plans each shipment with only a handful of carriers Each carrier works with only a handful of shippers U.S. truckload capacity moves empty nearly 20% of the time ($165 billion inefficiency yearly)
5 Shipper Collaboration Asset repositioning The cost of asset repositioning is included in the price charged by carriers Shipper collaboration By providing continuous moves shippers can negotiate better rates from carriers Increase the opportunities for continuous moves by collaborating
6 Shipper Collaboration Strategic level Identify regularly scheduled repeatable tours Operational level Identify continuous moves in near real time Focus: Strategic Shipper Collaboration Truckload Shipments
7 Collaborative Tour Example Chicago Kent Chicago: Land O Lakes packaging vendor Kent: Land O Lakes plant New Jersey: Land O Lakes distribution center New Jersey Nistevo identified another member company with New Jersey Chicago traffic 2.5 % savings of Land O Lakes $40 - $50 million finished goods freight bill Carrier avoids empty movements and uses 1 truck instead of 2
8 Collaborative Tour Example Green Bay Bangor Buffalo Wells Cedar Rapids Chicago Mechanicsburg Company 1 Company 2 Stand Alone Together Savings $3,821K $3,090K $ 731K 19% Savings Collaborative Results Efficiency gain 19% Driver turnover under 10% Service reliability over 99%
9 Collaborative Tours Optimization Problem Given a set of lanes, find a minimum cost set of routes covering all lanes Traversing a lane Repositioning
10 Lane Covering Problem (LCP) Given A complete bidirected graph D=(N,A) A nonnegative cost c ij for each arc (i,j) A subset of arcs L (lane set) Find A set of simple directed cycles (not necessarily disjoint) of minimum total cost covering all arcs in L
11 Lane Covering Problem LCP can be solved in polynomial time: Solve min-cost network flow problem Decompose the solution into simple cycles
12 Variants Cardinality constrained lane covering problem Find a set of simple directed cycles containing no more than k arcs covering all arcs in L of minimum total cost Length constrained lane covering problem Find a set of simple directed cycles of length B covering all arcs in L of minimum total cost (where in addition to a cost c ij for each arc we are also given a length l ij for each arc) Both variants are NP-hard
13 Lane Covering Problems Greedy algorithm: At each iteration choose a feasible cycle C such that (cost of lanes covered in C) / (cost of C) is maximized (Greedy solution of set covering formulation) Greedy algorithm has an approximation ratio of at most 2 The algorithm can always choose a trivial 2- cycle
14 Lane Covering Problems Bad instance (ratio: 3/2) Greedy Optimal
15 Dual-Fitting Primal problem Dual problem
16 Dual-Fitting Dual problem Modified dual problem
17 Dual-Fitting Greedy algorithm: Initialize Increase all at the same rate When for a cycle we have Freeze and remove the lanes in the cycle from L
18 Dual-Fitting The cost of the primal solution is equal to the cost of the dual solution The dual solution is not necessarily feasible Find λ such that when we divide all α a s by λ, the dual solution becomes feasible, i.e. Shows λ-approximation
19 Factor Revealing Program
20 Factor Revealing Program WLOG Metric inequality: Cycle inequality: 2-Cycle inequality: Increase α at same rate:
21 Factor Revealing Program Optimization program: Approximation factor:
22 Constrained Lane Covering Problem Greedy algorithm has an approximation ratio of at most Greedy algorithm with k = 3 has an approximation ratio of at most
23 Tight Example 0 c a Cost optimal cycle cover: abc + abc b d Cost greedy cycle cover: aa + bbd + cc + cc
24 Greedy Heuristic Implementation Heap Challenge: Huge number of feasible cycles (deadheading) Ratio Cycle
25 Cycle Generation Observation: A single cycle in the underlying digraph gives rise to many different cycles for the greedy heuristic because arcs may be used to cover a lane or as a deadhead
26 Cycle Generation Pragmatic Approach Distinguish between short deadheads and long deadheads Generate all cycles with at most one long deadhead Employ local search to merge cycles and create cycles with more than one long deadhead
27 Cycle Generation Short deadhead: length R Long deadhead: length > R Generate cycles with at most one long deadhead R R Search for origins of next lanes within a circle of radius R from the destination of the last lane (k-d trees) Base arc long deadhead R
28 Cycle Generation deadhead Forward Search base path base arc Backward Search
29 Local Improvement A cycle with two long deadheads
30 Local Improvement Find all combinations of cycles that can feasibly be merged and compute the improvement Solve a bipartite matching problem to find the optimal set of merges
31 Computational Results npts nlns nclst nclpts Tgen Theur Ratio Generated Selected Tlocal Ratio npairs nmerges , ,094, ,844, , ,900,
32 Variant Given A digraph D=(N,A) Travel times t (v,w) for each arc (v,w) A Lane set L A Dispatch time window [e v,f v ] for each arc (v,w) L Find A set of simple directed cycles covering all arcs in L of minimum total duration Duration= time of return to origin of first lane - dispatch time at origin of first lane Effectiveness of a cycle C =
33 Cycle Generation Goal: Generate feasible cycles with minimum duration (minimum waiting time) Feasibility: A cycle must be completed within the planning period, say a week, and must satisfy dispatch time window constraints Allow wrap-around cycles, e.g. Thursday Tuesday If a cycle (l 1,l 2,,l k ) starting from lane l 1 is feasible then it is also feasible starting from any lane l 2 to l k. Optimality: The minimum amount of waiting time along a feasible cycle given a starting point is achieved when departing as late as possible.
34 Constructing Feasible Cycles time period 1 arrival < departure Earliest departure time Earliest departure time with minimum waiting Key: keep track of the earliest departure time resulting in minimum waiting time along the path
35 Origin of cycle Observations: The duration of a cycle depends on the lane that is executed first duration duration
36 Origin of Cycle 1 5 Maximum waiting time if lane 1 is the first on the cycle
37 Origin of Cycle E Maximum waiting time if lane 5 is the first on the cycle 1 E Find earliest departure time E of path from 1 to 5 with minimum waiting time Find latest departure time of path from 1 to 5 arriving at 1 at or before E
38 Local Improvement Earliest and latest departure with minimum waiting along the path Earliest and latest departure with minimum waiting along the path Key: We can view each path as a single lane with dispatch window defined by the earliest and latest departure time with minimum waiting along the path
39 Computational Results Consortium of tire companies Inbound + outbound truckload transportation Estimated annual savings: $ 500,000
40 Stable Cost Allocation Does there exist a cost allocation α such that: The total payment collected from the shippers is equal to the total cost of covering all the lanes No group of shippers would be better off if they decided to opt out and collaborate only among themselves cost recovery competitiveness
41 Stable Cost Allocation A Cost of each lane = 1 Total cost without collaboration = 6 Total cost with collaboration = 4 If blue + green collaborate, their total cost = 2 If blue + green collaborate, their total cost = 2 B Is an allocation of 4/3 per lane stable? Payment(blue + green) = 8/3 > 2 Payment(red + green) = 8/3 > 2 NO
42 Stable Cost Allocation? Primal problem Dual problem
43 Cost Allocation From Dual Payment that is allocated for covering lane (i,j) L Then Budget: Stable:
44 Cost Allocation From Dual Given any S L, let (l S,y S ) be the optimal dual solution for the associated linear program LP(S) Note that the optimal solution (l,y) to the original dual when restricted to S is feasible for LP(S)
45 Fair Cost Allocation Is this solution fair? By complementary slackness: If a lane is traversed more than once the cost allocated to that lane is 0
46 Stable Cost Allocation A Cost of each lane = 1 Total cost w/o collaboration = 6 Total cost with collaboration = 4 The only stable cost allocation: Green lane pays 0 Blue and red lanes pay 2 B Is this a fair cost allocation?
47 Cross Monotonic Allocations No shipper will be worse off if the size of the collaborative network is increased The dual-based cost allocation is not cross monotonic There does not exist a cross monotonic A allocation in the core A B Payment(green) = 1 Payment(blue) = 1 B Payment(green) = 0 Payment(blue) = 2 Payment(red) = 2
48 Cross Monotonic Allocations There does not exist a cross monotonic allocation which recovers more than ½ of the total cost Add more lanes from A to B Cost of each edge goes to 2 Can allocate at most 1 to each edge ½ is a tight bound since allocating the one way cost of each lane to that lane covers ½ of the total cost.
49 Buyer Collaborations 3 Warehouses A, B, C A 3 Retailers 1, 2, Replenishment cost equal to distance traveled Trucks stationed at warehouses can visit at most two retailers on a trip B 3 C
50 Buyer Collaborations Assume: Collaborators share cost reduction equally A Retailer 1 & 2 collaborate: 3,3 Retailer 3 by itself: Total cost retailer 2 & 3: 7 If retailer 2 & 3 collaborate: 6 B 3 C Retailer 2 & 3 collaborate: 2.5,3.5 Retailer 1 by itself: 4 Total cost retailer 1 & 3: 7.5 If retailer 1 & 3 collaborate: 6
51 Buyer Collaborations Cost allocations & Collaborator gains Stage R1 R2 R3 Gain
52 Buyer Collaborations A No stable cost allocation recovering all the costs exists Minimum & maximum values of gains over time? B 3 C Contract design: exit penalties
53 Buyer Collaborations Cost allocations Retailer 1 Retailer 2 Retailer
54 Buyer Collaborations Sorted cost allocations Smallest allocation Middle allocation Largest allocation
55 Buyer Collaborations Gains Gains
56 Buyer Collaborations The observed continually changing collaborations relies on the ability of participants to obtain knowledge about the costs experienced by other participants The ability to compute the value of a collaboration In practice changing collaborations can be costly Requires sharing of information Requires secure mechanisms of data exchange Requires implementation of gain sharing mechanisms
57 Approximate Competitiveness Can one find a cost allocation such that the incentive for participants to break away is not too large? The ε-core Does such an ε always exist? Is it possible to compute the minimum ε efficiently?
58 Approximate Competitiveness Can one find a cost allocation such that the incentive for small groups of participants to break away is not too large? Does such a k exists? Is it possible to compute the maximum k efficiently?
59 Approximate Cost Recovery Can one find a cost allocation that recovers the largest fraction of the total cost? What is the complexity of finding such a cost allocation?
60 Shipper-Carrier Collaborations B 1 D 3 C 3 Carrier 2 4 Current solution: AB: 8 (C1) CD: 5.12 (C2) E DE: 5.12 (C2) A Carrier 1 Improved solution: AB: 5.38 (C1) CD: 6 (C2) DE: 4.03 (C1)
61 Shipper-Carrier Collaborations Is it possible to reduce system cost by collaborating? What is the potential value of collaborating? Potential value of collaborating is
62 Shipper-Carrier Collaborations Can the potential value of collaborating be realized? Who should collaborate? Will such collaborations happen naturally? How should the gains be shared? The system optimal solution will not make Carrier 2 and Shipper 2 happy
63 Shipper-Carrier Collaborations If it is impossible to realize all of the potential benefits, how much of the benefits can be realized? What information do shippers and carriers need to have access to in order to be able to determine if collaborating can reduce system costs?
Best Practices for Transportation Management
Best Practices for Transportation Management A White Paper from Ozburn-Hessey Logistics www.ohlogistics.com/countonus.html or 800-401-6400 Introduction The mantra for all transportation professionals is
More informationStrategies for Coordinated Drayage Movements
Strategies for Coordinated Drayage Movements Christopher Neuman and Karen Smilowitz May 9, 2002 Abstract The movement of loaded and empty equipment (trailers and containers) between rail yards and shippers/consignees
More informationVehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles. Arun Kumar Ranganathan Jagannathan
Vehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles by Arun Kumar Ranganathan Jagannathan A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment
More informationUniversity Question Paper Two Marks
University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,
More informationINTEGER PROGRAMMING BASED SEARCH
INTEGER PROGRAMMING BASED SEARCH A Thesis Presented to The Academic Faculty by Michael R Hewitt In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Industrial
More informationAn Optimization Algorithm for the Inventory Routing Problem with Continuous Moves
An Optimization Algorithm for the Inventory Routing Problem with Continuous Moves Martin Savelsbergh Jin-Hwa Song The Logistics Institute School of Industrial and Systems Engineering Georgia Institute
More informationNetwork Flows. 7. Multicommodity Flows Problems. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 7. Multicommodity Flows Problems 7.1 Introduction Fall 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction In many application contexts, several physical commodities,
More informationAnalysis of Demand Variability and Robustness in Strategic Transportation Planning
Analysis of Demand Variability and Robustness in Strategic Transportation Planning May 25, 21 Cambridge, MA Ahmedali Lokhandwala Candidate for M.S. in Transportation & M.Eng. in Logistics and Supply Chain
More informationCongestion Reduction Through Efficient Empty Container Movement
Congestion Reduction Through Efficient Empty Container Movement August 2017 A Research Report from the National Center for Sustainable Transportation Maged Dessouky, University of Southern California Santiago
More informationTopics in Supply Chain Management. Session 3. Fouad El Ouardighi BAR-ILAN UNIVERSITY. Department of Operations Management
BAR-ILAN UNIVERSITY Department of Operations Management Topics in Supply Chain Management Session Fouad El Ouardighi «Cette photocopie (d articles ou de livre), fournie dans le cadre d un accord avec le
More informationSAP Supply Chain Management
Estimated Students Paula Ibanez Kelvin Thompson IDM 3330 70 MANAGEMENT INFORMATION SYSTEMS SAP Supply Chain Management The Best Solution for Supply Chain Managers in the Manufacturing Field SAP Supply
More informationA Mathematical Model for Driver Balance in Truckload Relay Networks
Georgia Southern University Digital Commons@Georgia Southern 12th IMHRC Proceedings (Gardanne, France 2012) Progress in Material Handling Research 2012 A Mathematical Model for Driver Balance in Truckload
More information6 Managing freight transport
6 Managing freight transport 6.1 Introduction 6.2 Freight traffic assignment problems 6.3 Service network design problems 6.4 Vehicle allocation problems 6.5 A dynamic driver assignment problem 6.6 Fleet
More information1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS
1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS Professor Cynthia Barnhart Professor Nigel H.M. Wilson Fall 2003 1.224J/ ESD.204J Outline Sign-up Sheet Introductions Carrier
More informationA Framework for Integrating Planning Activities in Container Terminals
A Framework for Integrating Planning Activities in Container Terminals August 30th, 2007 S. H. Won and K. H. Kim Dept. of Industrial Engineering, Pusan National University, South Korea Contents 1 Introduction
More informationReduction of Empty Container Repositioning Costs by Container Sharing
Reduction of Empty Container Repositioning Costs by Container Sharing Herbert Kopfer and Sebastian Sterzik 1 Problem Description Empty container repositioning is a major cost driver for international container
More informationNine Ways Food and Beverage Companies Can Use Supply Chain Design to Drive Competitive Advantage
White Paper Nine Ways Food and Beverage Companies Can Use Supply Chain Design to Drive Competitive Advantage From long-term, strategic decision-making to tactical production planning, supply chain modeling
More informationCombinatorial Auctions
T-79.7003 Research Course in Theoretical Computer Science Phase Transitions in Optimisation Problems October 16th, 2007 Combinatorial Auctions Olli Ahonen 1 Introduction Auctions are a central part of
More informationCongestion Reduction through Efficient Empty Container Movement
Congestion Reduction through Efficient Empty Container Movement Final Report METRANS Project 15-28 August 15, 2017 Principal Investigator: Maged M. Dessouky Ph.D. Graduate Student: Santiago Carvajal Daniel
More informationHeuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:
More informationPut Your Mobile Communications System to Work BIG M DIESEL EXPRESS BOOSTS EFFICIENCY AND PROFITS BY INTEGRATING MOBILE COMMUNICATIONS WITH LOADMASTER
Put Your Mobile Communications System to Work BIG M DIESEL EXPRESS BOOSTS EFFICIENCY AND PROFITS BY INTEGRATING MOBILE COMMUNICATIONS WITH LOADMASTER Mobile communications systems have become an indispensable
More informationXXXII. ROBUST TRUCKLOAD RELAY NETWORK DESIGN UNDER DEMAND UNCERTAINTY
XXXII. ROBUST TRUCKLOAD RELAY NETWORK DESIGN UNDER DEMAND UNCERTAINTY Hector A. Vergara Oregon State University Zahra Mokhtari Oregon State University Abstract This research addresses the issue of incorporating
More informationISyE 3133B Sample Final Tests
ISyE 3133B Sample Final Tests Time: 160 minutes, 100 Points Set A Problem 1 (20 pts). Head & Boulders (H&B) produces two different types of shampoos A and B by mixing 3 raw materials (R1, R2, and R3).
More informationWHITE PAPER HOW TO TURN BIG DATA INTO ACTIONABLE INTELLIGENCE THE FOUR STEP PROCESS TO CONTINUOUS COST SAVINGS
WHITE PAPER HOW TO TURN BIG DATA INTO ACTIONABLE INTELLIGENCE THE FOUR STEP PROCESS TO CONTINUOUS COST SAVINGS INTRODUCTION Supply chain managers are tasked with ensuring all freight is moved efficiently.
More informationHybrid MIP method for a Pickup and Delivery Problem with Time Windows and Dock Service Constraints
International Journal of Operations Research International Journal of Operations Research Vol. 8, No. 1, 36 56 (2011) Hybrid MIP method for a Pickup and Delivery Problem with Time Windows and Dock Service
More informationTransportation Optimization: Is This the Next Step?
Transportation Optimization: Is This the Next Step? By Irista, An HK Systems Company Cost reduction through effective transportation management remains a high priority for most organizations. The challenges
More informationFreight Shipping Guide for Small Businesses
Freight Shipping Guide for Small Businesses Understand how it works, and how to get the best pricing. Learn the following about freight shipping: How it works Industry trends How it is priced How it is
More informationA SIMULATION-BASED ALGORITHM FOR SUPPLY CHAIN OPTIMIZATION. Takayuki Yoshizumi Hiroyuki Okano
Proceedings of the 2007 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. A SIMULATION-BASED ALGORITHM FOR SUPPLY CHAIN OPTIMIZATION Takayuki
More informationTransportation Logistics Part I and II
Transportation Logistics Part I and II Exercise Let G = (V,E) denote a graph consisting of vertices V = {,2,3,4,5,6,,8} and arcs A = {(,2),(,3),(2,4),(3,2),(4,3),(4,5),(4,6),(5,3),(5,),(6,8),(,4),(,6),(,8)}.
More informationInnovations in Freight Management
Innovations in Freight Management Dave Menzel, President and COO Echo Global Logistics November 7, 2018 Why innovate? Supply chains increasing complex to manage TL market is very fragmented 80% of US truck
More informationWelcome! Welcome to The Value of a TMS and Logistics Services for Effective Inbound Freight Management Webinar. Presented By
Welcome! Welcome to The Value of a TMS and Logistics Services for Effective Inbound Freight Management Webinar Presented By READ MORE ABOUT FREIGHT BEST PRACTICES AT THE CERASIS BLOG AT http://cerasis.com/blog
More informationOptimizing Package Express Operations in China
Optimizing Package Express Operations in China Baris Yildiz 1 and Martin Savelsbergh 2 1 Department of Industrial Engineering, Koc University, Istanbul, Turkey 2 H. Milton Stewart School of Industrial
More informationNetwork Design for Express Shipment Delivery
Computational Optimization and Applications, 21, 239 262, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. Network Design for Express Shipment Delivery CYNTHIA BARNHART Massachusetts
More informationThe Time Window Assignment Vehicle Routing Problem
The Time Window Assignment Vehicle Routing Problem Remy Spliet, Adriana F. Gabor June 13, 2012 Problem Description Consider a distribution network of one depot and multiple customers: Problem Description
More informationA Decomposition Approach for the Inventory Routing Problem
A Decomposition Approach for the Inventory Routing Problem Ann Melissa Campbell Martin W.P. Savelsbergh Tippie College of Business Management Sciences Department University of Iowa Iowa City, IA 52242
More informationContainer Sharing in Seaport Hinterland Transportation
Container Sharing in Seaport Hinterland Transportation Herbert Kopfer, Sebastian Sterzik University of Bremen E-Mail: kopfer@uni-bremen.de Abstract In this contribution we optimize the transportation of
More informationTRANSPORT DECISION MAKING. Factors influencing transport decision making. Regulatory developments Technological change Carrier strategies
TRANSPORT DECISION MAKING Factors influencing transport decision making Macroeconomic trends and trends in the cost of various transport modes Regulatory developments Technological change Carrier strategies
More informationA DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS
A DETERMINISTIC ANNEALING ALGORITHM FOR THE PRE- AND END-HAULAGE OF INTERMODAL CONTAINER TERMINALS An Caris Gerrit K. Janssens Transportation Research Institute Hasselt University - campus Diepenbeek Wetenschapspark
More informationUNMANNED AERIAL VEHICLES (UAVS)
UNMANNED AERIAL VEHICLES (UAVS) MONITORING BY UAVS I.E. WHAT? (SOME THESES PROPOSALS) UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted)
More informationOperation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras
Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 37 Transportation and Distribution Models In this lecture, we
More informationA MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT
A MICROSCOPIC TRAFFIC SIMULATION BASED DECISION SUPPORT SYSTEM FOR REAL-TIME FLEET MANAGEMENT City CEDM City Distribution CEDM Distribution Terminal Terminal LOGISTICS BASE Jaume Barceló Hanna Grzybowska
More informationInfluence Maximization on Social Graphs. Yu-Ting Wen
Influence Maximization on Social Graphs Yu-Ting Wen 05-25-2018 Outline Background Models of influence Linear Threshold Independent Cascade Influence maximization problem Proof of performance bound Compute
More informationISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ
ISE 204 OR II Chapter 8 The Transportation and Assignment Problems Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ 1 The Transportation and Assignment Problems Transportation Problems: A special class of Linear Programming
More informationDesigning Full Potential Transportation Networks
Designing Full Potential Transportation Networks What Got You Here, Won t Get You There Many supply chains are the product of history, developed over time as a company grows with expanding product lines
More informationTRANSPORTATION PROBLEM AND VARIANTS
TRANSPORTATION PROBLEM AND VARIANTS Introduction to Lecture T: Welcome to the next exercise. I hope you enjoyed the previous exercise. S: Sure I did. It is good to learn new concepts. I am beginning to
More informationWhite Paper Series Food Logistics Industry Report
White Paper Series 2007 Food Logistics Industry Report This industry-wide report identifies common practices, challenges, and emerging trends within the U.S. food logistics industry. Introduction During
More informationFast Edge-Orientation Heuristics for Job-Shop Scheduling Problems with Applications to Train Scheduling
Fast Edge-Orientation Heuristics for Job-Shop Scheduling Problems with Applications to Train Scheduling Omid Gholami 1, Yuri N. Sotskov 2 and Frank Werner 3* 1 Islamic Azad University, Mahmudadad Branch
More informationQute: Quality-of-Monitoring Aware Sensing and Routing Strategy in Wireless Sensor Networks S H A O J I E T A N G T E M P L E U N I V E R S I T Y
Qute: Quality-of-Monitoring Aware Sensing and Routing Strategy in Wireless Sensor Networks S H A O J I E T A N G J I E WU T E M P L E U N I V E R S I T Y Examples of WSNs Wireless Sensor Networks (WSNs)
More informationLOGISTICS FOR CONSIGNEE, CONSOLIDATOR SHIPPER AND CARRIER
USED AT: AUTHOR: Marge Petersen, DAMA Project DATE: 11/26/97 REV: 1/14/99 TOP UCC Standards EDI Standards HazMat and DOT Regulations 850 Purchase Order LOGISTICS FOR CONSIGNEE, CONSOLIDATOR SHIPPER AND
More informationCARRIER CONNECTIVITY: THECRITICAL COMPONENT OF
CARRIER CONNECTIVITY: THECRITICAL COMPONENT OF TRANSPORTATION M ANAGEMENT Sponsored by Produced by In partnership with With capacity crunches, driver shortages, and other challenges making an impact on
More informationweather monitoring, forest fire detection, traffic control, emergency search and rescue A.y. 2018/19
UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted) Historically, used in the military, mainly deployed in hostile territory to reduce pilot
More informationCapacitated vehicle routing problem for multi-product crossdocking with split deliveries and pickups
Available online at www.sciencedirect.com Procedia - Social and Behavioral Sciences 62 ( 2012 ) 1360 1365 WC-BEM 2012 Capacitated vehicle routing problem for multi-product crossdocking with split deliveries
More informationFixed Routes with Backup Vehicles for Stochastic Vehicle Routing Problems with Time Constraints
Fixed Routes with Backup Vehicles for Stochastic Vehicle Routing Problems with Time Constraints Alan L. Erera, Martin Savelsbergh, and Emrah Uyar The Supply Chain and Logistics Institute School of Industrial
More informationA Dynamic Driver Management Scheme for Less-than-Truckload Carriers
A Dynamic Driver Management Scheme for Less-than-Truckload Carriers Alan Erera, Burak Karacık, Martin Savelsbergh The Logistics Institute School of Industrial and Systems Engineering Georgia Institute
More informationA Competitive Storm Is Brewing
A Competitive Storm Is Brewing The shipping market is just like any other competitive market, with sellers and buyers that supply and demand a service. But in the last year, the shipping playing field
More information8 REASONS Why Your Inbound Trailers are Underutilized
SEPTEMBER 2016 8 REASONS Why Your Inbound Trailers are Underutilized 1 2 3 4 5 6 7 8 SUPPLIERS PROVIDE INACCURATE DATA MILK RUNS AREN T OPTIMIZED SUPPLIERS DON T STACK PROPERLY SUPPLIERS DON T USE THE
More informationThe Two-Echelon Capacitated Vehicle Routing. Problem
The Two-Echelon Capacitated Vehicle Routing Problem Jesus Gonzalez Feliu 1, Guido Perboli 1, Roberto Tadei 1 and Daniele Vigo 2 1 Control and Computer Engineering Department Politecnico di Torino, Italy
More informationWhitepaper. Smarter Supply Chain Solutions
Whitepaper Smarter Supply Chain Solutions Simplified Analyses and Rapid Model Development Solutions On-Demand More Accurate Results Case Studies in Supply Chain Planning Software as a Service fills a gap
More informationVehicle Routing with Departure Smoothing
ERASMUS UNIVERSITY ROTTERDAM Erasmus School of Economics Vehicle Routing with Departure Smoothing Master s Thesis Econometrics and Management Science Author: N.M. van der Zon Student ID: 387441 Supervisors:
More informationCROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS
CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS 1 th International Conference on Production Research P.Baptiste, M.Y.Maknoon Département de mathématiques et génie industriel, Ecole polytechnique
More informationMANHATTAN ACTIVE SUPPLY CHAIN TRANSPORTATION THE RIGHT SOLUTION FOR COMPLEX LOGISTICS NETWORKS
MANHATTAN ACTIVE SUPPLY CHAIN TRANSPORTATION THE RIGHT SOLUTION FOR COMPLEX LOGISTICS NETWORKS ACTIVE, OPTIMIZED TRANSPORTATION MANAGEMENT Logistics complexities and service-level expectations have increased
More informationLecture - 44 Supply Chain
Economics, Management and Entrepreneurship Prof. Pratap. K. J. Mohapatra Department of Industrial Engineering and Management Indian Institute of Technology Kharagpur Lecture - 44 Supply Chain Good morning.
More informationINBOUND LOGISTICS: 10 COMMON TRAPS AND PITFALLS WHITE PAPER
INBOUND LOGISTICS: 10 COMMON TRAPS AND PITFALLS WHITE PAPER Every company is looking for ways to improve margins and overall organizational accountability. Inbound logistics is fast becoming a point of
More informationAcyclic Mechanism Design for Freight Consolidation
Acyclic Mechanism Design for Freight Consolidation Wentao Zhang Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, wentao@usc.edu,
More informationThe Transportation and Assignment Problems. Hillier &Lieberman Chapter 8
The Transportation and Assignment Problems Hillier &Lieberman Chapter 8 The Transportation and Assignment Problems Two important special types of linear programming problems The transportation problem
More informationRehandling Strategies for Container Retrieval
Rehandling Strategies for Container Retrieval Tonguç Ünlüyurt and Cenk Aydin Sabanci University, Faculty of Engineering and Natural Sciences e-mail: tonguc@sabanciuniv.edu 1 Introduction In this work,
More informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
More informationFlorida Multimodal Statewide Freight Model
Florida Multimodal Statewide Freight Model Model inputs and structure, and integration with regional truck-touring models Presented by Colin Smith, RSG Freight Issues in Florida Florida has a large, complex,
More informationSUSTAINABLE REVERSE LOGISTICS
SUSTAINABLE REVERSE LOGISTICS Reducing Waste and Emissions in the Retail Supply Chain WHITE PAPER 02.24.2016 ABSTRACT The retail industry faces a large and growing challenge in managing the 3.5 billion
More informationFreight Management for Mid-sized Companies:
WHITE PAPER Freight Management for Mid-sized Companies: Manage Transportation Like a Fortune 500 Company Without Spending Millions Mid-sized companies frequently lack the internal systems and resources
More informationWHAT ARE FREIGHT SERVICES?
FREIGHT SERVICES WHAT ARE FREIGHT SERVICES? As the official service contractor, Freeman is the exclusive provider of freight services. Material handling includes unloading your exhibit material storing
More informationTitle: A Column Generation Algorithm for the Log Truck Scheduling Problem.
Title: A Column Generation Algorithm for the Log Truck Scheduling Problem. Authors: Myrna Palmgren Department of Optimization Linkoping University S-58183 Linkoping, Sweden e-mail: mypal@mai.liu.se Mikael
More informationMulti-resource routing with flexible tasks: an application in drayage operations
Multi-resource routing with flexible tasks: an application in drayage operations Karen Smilowitz Department of Industrial Engineering and Management Sciences Northwestern University January 5, 2006 Abstract
More informationQuestion 1: Why would a company be interested in transportation-oriented supply chain metrics?
Question 1: Why would a company be interested in transportation-oriented supply chain metrics? Answer 1: Any company that buys from a supplier or ships products to a customer should be interested in transportation-oriented
More informationShipping & Mailing Outbound and Inbound Package Management. SendSuite Live. Global logistics management made easy.
Shipping & Mailing Outbound and Inbound Package Management SendSuite Live Global logistics management made easy. Managing an outbound shipping operation is a big expense, regardless of your operation s
More informationTRANSPORTATION NETWORK OPTIMIZATION
Special Report TRANSPORTATION NETWORK OPTIMIZATION Your customers needs are dynamic and constantly changing; your transportation network should be in perfect tune. FLEET LEASING & MAINTENANCE DEDICATED
More informationOptimization in Supply Chain Planning
Optimization in Supply Chain Planning Dr. Christopher Sürie Expert Consultant SCM Optimization Agenda Introduction Hierarchical Planning Approach and Modeling Capability Optimizer Architecture and Optimization
More informationTransportation Problems
C H A P T E R 11 Transportation Problems Learning Objectives: Understanding the feature of Assignment Problems. Formulate an Assignment problem. Hungarian Method Unbalanced Assignment Problems Profit Maximization
More informationCIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS
CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS 1. In the graphical method of solving a Linear Programming problem, the feasible region is the region containing A.
More informationDYNAMIC DECISION SUPPORT FOR REGIONAL LTL CARRIERS
DYNAMIC DECISION SUPPORT FOR REGIONAL LTL CARRIERS A Thesis Presented to The Academic Faculty by Prashant Warier In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Industrial
More informationDetermination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand
Determination of a Fair Price for Blood Transportation by Applying the Vehicle Routing Problem: A Case for National Blood Center, Thailand S. Pathomsiri, and P. Sukaboon Abstract The National Blood Center,
More informationMileage savings from optimization of coordinated trucking 1
Mileage savings from optimization of coordinated trucking 1 T.P. McDonald Associate Professor Biosystems Engineering Auburn University, Auburn, AL K. Haridass Former Graduate Research Assistant Industrial
More informationAN INTEGRATED MODEL OF CROSS DOCKING. A Thesis. presented to. the Faculty of the Graduate School. at the University of Missouri-Columbia
AN INTEGRATED MODEL OF CROSS DOCKING A Thesis presented to the Faculty of the Graduate School at the University of Missouri-Columbia In Partial Fulfillment of the Requirements for the Degree Master of
More informationDayton Freight Lines Improves MPG, Stops per Hour, and Customer Service with Driver Workflow.
Case Study Driver Workflow Dayton Freight Lines Improves MPG, Stops per Hour, and Customer Service with Driver Workflow. Moving ahead in the transportation industry today requires more than dedicated management
More informationMulti-Commodity Network Flow Based Approaches for the Railroad Crew Scheduling Problem
Multi-Commodity Network Flow Based Approaches for the Railroad Crew Scheduling Problem Balachandran Vaidyanathan Department of Industrial & Systems Engineering, University of Florida, Gainesville, FL 32611
More informationLEVERAGING BIG DATA TO MANAGE LOGISTICS
LEVERAGING BIG DATA TO MANAGE LOGISTICS By Andrew Loh, Simon-Pierre Monette, Andres Garro, Dustin Burke, Andreanne Leduc, and Nicholas Malizia For many major B2B enterprises, logistics networks have never
More information5 Must-Haves in 2018 Competitive Buyers Guide: TMS Software
5 Must-Haves in 2018 Competitive Buyers Guide: TMS Software The ideal tool to help streamline your shipping and logistics processses Transportation is costly, time-consuming, and sometimes difficult to
More informationTransportation problem
Transportation problem Operations research (OR) are concerned with scientifically deciding how to best design and operate people machine systems, usually under conditions requiring the allocation of scarce
More informationCrowdsourced Delivery - a Pickup and Delivery Problem with Ad-hoc Drivers
Crowdsourced Delivery - a Pickup and Delivery Problem with Ad-hoc Drivers Alp M. Arslan, Niels Agatz, Leo Kroon, Rob Zuidwijk Rotterdam School of Management, Erasmus University, The Netherlands E-mail:
More informationDiscrete facility location problems
Discrete facility location problems Theory, Algorithms, and extensions to multiple objectives Sune Lauth Gadegaard Department of Economics and Business Economics, Aarhus University June 22, 2016 CORAL
More informationFleet Management As Part of a Robust TMS Platform
Position White Paper Paper Fleet Management As Part of a Robust TMS Platform Modern logistics programs must make use of multiple practices and strategies in order to fully address all the challenges facing
More informationHorizontal Collaboration Value Proposition
The Supply Chain Leadership Forum 2011: Walt Disney World Resort, Lake Buena Vista, FL Horizontal Collaboration Value Proposition Bill Loftis, Senior Principal, Tompkins Associates & Valerie Bonebrake,
More informationROI is Driving Next Generation TMS Adoption
ARC BRIEF FEBRUARY 28, 2017 ROI is Driving Next Generation TMS Adoption By Chris Cunnane Summary A transportation management system (TMS) helps companies efficiently, reliably, and cost effectively move
More informationSimulation approaches for optimization in business and service systems
Simulation approaches for optimization in business and service systems Imed Kacem kacem@univ-metz.fr Professor - Université Paul Verlaine Metz http://kacem.imed.perso.neuf.fr/site/ FUBUTEC 2, Future Business
More informationMAT3A LOGISTICS AND SUPPLY CHAIN MANAGEMENT Unit : I - V MAT3A- LOGISTICS AND SUPPLY CHAIN MANAGEMENT
MAT3A LOGISTICS AND SUPPLY CHAIN MANAGEMENT Unit : I - V MAT3A- LOGISTICS AND SUPPLY CHAIN MANAGEMENT TM Unit I - Syllabus Origin and Definition CONCEPTS IN LOGISTICS OBJECTIVES OF LOGISTICS FUNCTIONS
More informationA Linear Programming Model for Optimization of the Railway Blocking Problem
A Linear Programming Model for Optimization of the Railway Blocking Problem Roberto Gallardo-Bobadilla Department of Mechanical Engineering and Canadian Rail Research Laboratory (CaRRL) University of Alberta,
More informationApplication oriented vehicle problems in public bus transportation
Application oriented vehicle problems in public bus transportation Gábor Galambos University of Szeged, Hungary Joint work with Viktor Árgilán, János Balogh, József Békési, Balázs Dávid, Miklós Krész,
More informationAir Cargo Pickup and Delivery Problem with Alternative Access Airports
Air Cargo Pickup and Delivery Problem with Alternative Access Airports Farshid Azadian, Alper Murat, Ratna Babu Chinnam Department of Industrial and System Engineering, Wayne State University, 4815 Fourth
More informationWAREHOUSING:- CONCEPT OF WAREHOUSING:-
WAREHOUSING:- Warehousing is that part of a firm s logistics system that stores products (raw materials, parts, goods-in-process, finished goods) at & between point-of-origin & point-of consumption, &
More informationLOGISTICS. SmartWay Case. SmartWay Partner: DRIVING RESULTS. Wheels Group Inc. Mississauga, Ontario. Background
SmartWay Case Study LOGISTICS SmartWay Partner: Wheels Group Inc. Mississauga, Ontario DRIVING RESULTS Background Founded in 1988, Wheels is a leading North American 3PL, supply chain logistics provider.
More information