VEHICLE ROUTING PROBLEM

Transcription

1 VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem (TSP) but with more constraints such as vehicle capacity. Consider a TSP problem: Depot Suppose that the vehicle has a capacity of 0 and each customer has an order size as shown below, then the TSP solution is no longer feasible. Depot

2 A simple method : Use the TSP as usual When exceeding the vehicle capacity, go back to the depot Start another tour with the nearest customer as the first customer Repeat b. and c. until all customers are served. Depot Can we use only three tours to serve all customers? Depot As a Decision Problem Decisions Assignment of orders to vehicles The sequence of orders to be served Constraints Vehicle capacity (in terms of volume or weight normally) Objectives Minimizing mileages or time Considerations Known demand Delivery or pickup

3 Solution Strategy Tour construction heuristics Insertion methods (e.g. nearest insertion, min cost insertion) Savings methods (e.g. ClarkeWright savings) Generalized assignment methods (e.g FisherJaikumar method) Tour improvement Intraroute improvement methods (e.g. Opt, Opt) Interroute improvement methods (e.g. Relocate) Tour construction method : ClarkeWright savings method 0 9 Given depot customers with known demand Vehicle capacity (00) Costs for traveling between customers Demand for customer Depot Basic Steps Identify the distance matrix Identify the savings matrix Combine routes

4

5

6 s(, ) = + 9 = 9 s(, ) = c(, ) + c(, ) c(, ) = + 7 = s(, ) = c(, ) + c(, ) c(, ) = + = 7 7 s(, ) = c(, ) + c(, ) c(, ) = + 7 = 8 Begin combining tours: starting with the highest savings and (a) the combined tour cannot exceed vehicle capacity, (b) insertion cannot be in the interior of a tour Demand () = 60 Demand () = Vehicle capacity = 00 Decision: combine the tour Depo 6

7 Next highest savings: Demand () = 0 Demand (+) = 9 Vehicle capacity = 00 Decision: cannot combine the Depot 7

8 All nodes are visited once and the total cost is. How to speed up the ClarkeWright Savings Method? We can use Heap to store the savings (from the largest to the smallest). The use of Heap can speed up the operations. Tour construction method : Generalized assignment method (also called Fisher Jaikumar Method) Assign seed points for each route Evaluate insertion cost for each customer Assign customers to routes Parameters d i u k : demand of customer i : capacity of vehicle k 8

9 Decision variables y x ik ijk if customer i is assigned to route k = 0 otherwise if i is visited followed by visiting j on route k = 0 otherwise Define: N(y k ) = all nodes on route k f(y k ) = the cost of route k Our objective is to minimize the route cost while satisfying the demand. Therefore, we can write the problem as follows: Example Vehicle y y = = 0 N( y ) = {,, } 0 6 Vehicle y y = 0 = N( y ) = {,, 6} subject to min f( y ) k dy i y k y k i ik ik ik u k k i= 0 = i=,..., n {0,} The cost of route f (y k ) is defined as follows: 9

10 f( y ) = min k c x ij ij ijk subject to x = y j = 0,..., n i x j ijk ijk i Q j Q ik ik x, Q N( y ) A big problem: f (y k ) is a complex, nonlinear function. Solution idea: Approximate f (y k ) by some linear function: ijk = f (y k ) ~ ik ik i The coefficient, c ik, represents the approximated cost of putting customer i on route k. y c y k How do we get c ik? Idea : cheapest insertion cost Idea : use the concept of opportunity cost Steps of the generalized assignment Step : Assign a seed to each vehicle (or route) where the seeds are farthest away from each other (Suppose that we have vehicles) D 0

11 Step : Evaluate the cost of inserting the customers into the existing routes. Option : Approximate by the cheapest insertion cost a 9 9 D Customer 7 Best choice for customer : c cost = 7 Best choice for customer : b cost = Best choice for customer : b not available Second best for customer : a cost = 9 Total cost: 8 c Customer b Customer Option : Approximate by Opportunity cost or Regret Regret = Cost for second best choice cost for the best choice Customer with the highest opportunity cost should be inserted first a 9 9 D Customer 7 c Opportunity cost for customer : Opportunity cost for customer : Opportunity cost for customer : 6 Opportunity cost for customer : Opportunity cost for customer : Customer b Customer customer to b: customer to c: 7 customer to a: Total:

12 Step : Rank customers from highest to lowest regret. Example: Regret () > Regret () a Customer From to c route: From to b route: 7 From to a route: 8 Regret() = 6 From to c route: 0 From to a route: From to b route: D c Regret() = Customer b Step : Insert the customers according to the rank of regrets one at a time. Notice that the regrets may need to be updated. Tour improvement Methods There are general types of methods:. Intraroute improvement (changing the sequence of customers within a route) Examples: Opt Opt. Interroute improvement Exchanging customers between routes Exchanging segments of routes between routes Example of Intraroute improvement: opt algorithm Do a swap of arc pairs in a route if it can reduce the cost (or time). Below we consider a case where customers may impose delivery timewindows.

13 opt Note: the indices i and j are in the order of the nodes being visited in a given tour. For simplicity, we represent the route as a chain and ignore the physical shape of the route opt swapping illustration i i+ j j+ opt i i+ j+ j

14 o Flow chart: For the node pairs of i, j, consider swapping? Y d(i,j)+d(i+, j+)< d(i, i+) +d(j, j+)? N Y After the swap, is the resulting tour feasible? N Y Swap the arcs (Note that the arcs from i+ to j are reversed Stop? N Y Return new solution We can continue the swapping until the two cost savings of two consecutive swaps is smaller than some small values or the number of swapping has reached a predefined maximum number of swaps. In implementing Opt algorithm, there are several possible ways to select which pairs of arcs to be considered for swapping. Select the pair of arcs with the best cost savings and then make swap; Select several pair of arcs with the best cost savings and swap the best pair. From the second swap on, this method will check the feasibility before making it since the route has been changed after the first swap.

15 Randomly consider a pair of arcs and makes swap if it is feasible and can produce cost savings; Traverse the route from the starting point and make the swap once an eligible pair of arcs (feasible and cost savings) is found. Example of Interroute improvement: Relocate Consider the swapping between two existing routes. One way is to relocate a node in a route (say route B) to another route (say route A) i Route A j j+ i i+ Route B Depot We need to choose the route from which one node will be removed (route B) and the route to which the node will be inserted (route A). Then, we can follow the procedure below:

16 Expanding route A, Shrinking route B For each node i in B Y Find a new feasible position for i in Route A, say between j and j+ Y d(j,i)+d(i, j+) +d(i, i+)< d(i, i+) +d(j, j+) +d(i, i)? N Y Insert i between (j, j+) & Connect i, i+ Y Finish expanding/shrinking N Return In implementing the relocate algorithm, we have several options: For each node in the shrinking route, find the first position in the expanding route after which the node can be inserted and the relocation of the node results in cost saving. Similar to the above, except that for each node in the shrinking route, it will find the position in the expanding route that the relocation will result in the largest saving. For each node in the shrinking route, find the best position as well as the best expanding route Other Implementation issues Time window constraints Each customer has a specified time period during which the vehicle can visit 6

17 Backhaul (pickup and delivery) Not just delivery goods from the depot, but also pick up goods from customers Multiple depots Vehicles can be coming from different depots Split orders May have more than one delivery to a customer The case of a chemical product manufacturer: orders Customer service Production unit Warehouse Information system Fleet unit delivery Sites Multiple factories in Pearl River Delta Supply petrol chemical products to customers in PRD 7

18 Production Justintime production Distribution 0 0 trucks per factory Order cutoff at pm More than trip per vehicle Divide region in zones and one route per zone Process Receive an order Estimate the order finishing time Sort the orders to be finished on tomorrow Estimate the delivery schedules According to the delivery schedules, reestimate the production schedules When the orders are ready, ask warehouse people prepare for the loading Ask fleet unit to send trucks to warehouse for loading Operation Issues Information is not synchronized Paper work between units Spend hours in determining initial delivery schedules Low truck utilization Difficult to entertain customer s request on exact/approximate delivery time Urgent orders (some trucks are reserved to handle urgent order) DECISION SUPPORT SYSTEMS FOR What is a decision support system? What are the differences between Databases, Enterprise systems, Decision support systems? Database Organized storage of data Minimize data redundancy and inconsistency Data retrieval, search, and sort Enterprise system Minimize inconsistency across databases Realtime data Integrating databases Decision support system A system to support decision making Extract data and process data intelligently 8

19 The Components of DSS:. Database. Modelbase. User interface Decision support system development Analyzing the needs o Focus on causes, not symptoms o What will be the reasonable expectation? Data Development o Data administration is a critical requirement for longterm success o DSS requires their own database to produce effective results o Is historical data available? Is the data telling the truth? Modelbase o Model contents should be consistent with its goals: strategic, tactical, or operational? o What class of models do you want? Descriptive? Prescriptive? Performance how to measure? What assumptions do you make? Are we assuming: o Perfect data o Dispatchers follow instruction exactly o Drivers follow instruction exactly o Shippers with perfectly predictable demands o Personnel from different department have the same goal 9

20 Source: P.7, Mazza, Faircloug, Melton, de Pablo, Scheffer, Stevens, Software Engineering Standards, Prentice Hall Major phases in DSS development (and examples of activities) User Requirement Definition Capture, determine, specify and verify user requirements Software Requirement Definition Construct logical model Specify functional, performance, documentation, acceptance testing requirements, etc. Architectural Design Decompose software into components Define data input and output requirement, data structure, etc. Select programming languages Detailed Design and Production Detailed design of lowerlevel components Coding Integrating components Testing Transfer Installation Acceptance tests Operations and Maintenance Final acceptance 0

21 Data Preparation for DSS: Customer independent Customer dependent Static Raw location data: Road, speed limit, tolls, major intersections, landmarks, etc. Processed data: Distances, costs, times, etc. between points of interests (via shortest path methods on raw location data) Locations Trucks Details (e.g. capacity, loading and unloading time, running cost) Drivers Details (e.g. salary, overtime) Products Details (e.g. size, weight, price) Dynamic Travel flow pattern Road restriction Demand data: Orders Details (e.g. daily demand, amount) Items Details (e.g. product to be ordered, quantity) Processing on preliminary static data: Use shortest path engine to compute the distance, cost, or time, etc. between customers or between depot and customers.

22 Engine for the DSS A combination of Saving Heuristics, Generalized assignment (FisherJaikumar method), tour improvement (Opt, OrOpt), and different insertion methods. Resulting handling and tools for analysis Visualizing results o Gantt charts o Static route display o Animation Allow users to make changes Measure performance Compare scenarios Whatif analysis Typical decision support What are some good suggested solutions? What is the impact of changing the sequence of orders being served? What orders should be outsourced? Can an urgent pickup order be accepted? By what vehicle? At what time? What are the costs if different numbers of vehicles are used?