Presentation on theme: "Integrated Production Scheduling and Vehicle Routing Problem to Minimum Total Cost Student: Bing-Yu Gao Student ID: M10021024 Advisor: Chin-Yao Low, Ph.D."— Presentation transcript:
Integrated Production Scheduling and Vehicle Routing Problem to Minimum Total Cost Student: Bing-Yu Gao Student ID: M10021024 Advisor: Chin-Yao Low, Ph.D.
Outline Introduction – Background – Motivation Literature review – HVRP – Integration problem (Type I & Type II) Research method – MILP/ and verification Conclusions
Background Pull based –H–How to response customer at once In the Past year: –P–Production scheduling. –V–Vehicle routing planning. But most of literatures of above are discussed individually. ‧ Push based supply chain Forecast accurately
Background IndividualIntegration Advantage1.It can make the best of object of production scheduling. 2.It can make the best of object of VRP problem. 1.The global optimal solution can be found. 2.Because the mutual cost will be considered Integrally. DefectThe mutual cost considerations will be ignored. The algorithm will be more complexly. – Comparison as following table:
Motivation Based on above description, 2 motivations are presented as follows: –T–The plant needs more effect that pick goods and delivering plan. –M–Most of problems are discussed individually by literatures.
Research process Theme direction decided conclusions Similar literatures review Theme decided Single machine scheduling HVRP literature review Integrated Scheduling and Delivering Include type I and type II Integrated Scheduling and Delivering Include type I and type II Literature review Research method comparison results Formula MILP model Meta-algorithm
Literature review – VRP with heterogeneous fleet Variety of the meta-algorithm Time windows yearreference Heuristic algorithmx1984Golden et al. Tabu searchx1996 Osman and Salhi Tabu searchx1999Gendreau et al. Tabu searchx2002 Wassan and Osman B & B v 2007Choi and tcha Scatter search v 2007 Belfiore & Favero
Literature review – VRP with heterogeneous fleet Variety of the meta-algorithm Time windows yearreference Heuristic algorithm v 2007Dell’Amico et al. EM-SA v 2008Oili Bräysy et al. Memetic algorithmX2009Christian Prins --V This research
Literature review – Integrated Scheduling and Delivering Type I: Single machine or parallel machine and deliver to single customer with multiple orders. Plant Customer How many times of delivering? How to schedule? When to deliver? AND Fixed distance.
Literature review – Integrated Scheduling and Delivering meta-algorithmMDObjectyearreference Heuristic algorithm 11 Min makespan2004Chang & Lee 21 12 Heuristic algorithm11 min delivery cost and mean of travel time 2005 Chen & Vairaktarakis Heuristic algorithm21Min makespan2009Su et al. Heuristic algorithm11 Min weighted sum of the last arrival time With independent setup time 2010T.C.E. Cheng Heuristic algorithm11Min makespan2011Liu & Lu Tabu search Long-term memory 11min Travel time, and lateness time2012 Condotta et al. M: number of Parallel Machines.(1 denotes no parallel machine) D: number of Demands.
Literature review – Integrated Scheduling and Delivering Type II: Single machine and deliver to multiple customers with multiple orders but release one time. Plant Customer How to do the production schedule?
Literature review – Integrated Scheduling and Delivering Type II: Single machine and deliver to multiple customers with multiple orders but release one time. Plant Customer When to deliver? How to solve the VRP problem?
Literature review – Integrated Scheduling and Delivering meta-algorithmMVObjectyearreference Tabu search short-term memory P1 Max profit of supplier (time windows and travel time) 2005 Garcia & Lozano Dynamic programming P1 Min weighted sum of Delivery time and total distribution cost 2005 Chen & Vairaktarakis Heuristic algorithm11Max profit of supplier2009 Huey-Kuo Chen Dynamic programming 11 Min weighted sum of the last arrival time With independent setup time 2010T.C.E. Cheng --1T Min total cost With fixed cost of vehicle -- This Research M: number of Parallel Machines.(1 denotes no parallel machine) V: Variety of the vehicle capacity.(1 denotes only one type)
Research method – Another Question restrict All of out of control aren’t considered whether conveyer or vehicle. The state of road aren’t considered. All orders are released on time zero. All customer site can be visited only once, and all vehicles back to plant are needed.
Research method – Question description Example: 2413 0 0 Production scheduling stage VRP stage 0 0 2 Time 0 0 0 0 4 e2e2 l2l2 e4e4 l4l4
Research method – Question description If the routing costs are considered, then it may give an integration solution as follow picture. 2413 0 0 Production scheduling stage VRP stage 2 Time 0 0 4 e2e2 l2l2 e4e4 l4l4
Research method – Question description How to scheduling involve HVRP problem is this research want to present mainly. ?…?? 0 0 Production scheduling stage VRP stage ? Time 0 0 0 0 0 0 ? … …
Min Total cost = fixed cost + travel cost + delay penalty + early penalty Flow constraints Connection and subtour-breaking constraints Vehicle capacity constraints
Research method – Formula the MILP model Production stage Scheduling constraints, and the sequence only has one combination. Production constraints When customer i is processed before j then do the above constraint.
Research method – Formula the MILP model Transportation stage Arrival time calculation constraints. Soft time windows constraints.
Research method – Formula the MILP model Nonnegative constraints: All decision variables are nonnegative. But this model has some problems need to modified. In the next chapter will describe in detail.
Research method – MILP model verification CustomerPlant1234 EiEi 0189198150168 LiLi 630225227180190 Type of vehicle 123 Fixed cost 101518 C ij Plant 1234 02458 120769 247035 356308 489580 CustomerPlant 1234 EPT i 015758 LPT i 2014986 Type of vehicle 123 Capacity 105070 Customer 1234 didi 50302015 titi 2824 Ct ij plant 1234 017151315 1170191821 215190158 313181506 4 21860 Customer 1234 sisi 3289
Research method – MILP model verification The scheduling result as follows: – 4-3-1-2 The VRP result as follows: – 0-2-0 use type 2 – 0-3-4-1-0 use type 3
Research method – MILP model verification All completion of the production time as follows: Hand calculations: – Demands of customer 4: d 4 *t 4 = 60 – And as follow is 3, 20*2 + 60 = 100 – 1 is 20*2 + 100 = 140 – And the customer 2 is 380. Customer4312 Completion of the production time60100140380
Research method – MILP model verification Customer3412 Arrival time176190225395 All Arrival time as follows: Hand calculations: Customer 3:140+13=153→176 (it can be accepted) At the same route, customer 4:176 + c 34 + s 3 =190 Customer 1: 190 + 8 + 18 = 216→225 (Final maturity date) And the customer 2 is another route: Completion time is 380 + C 02 = 395
Research method – MILP model verification Hand calculations the object as follows: Penalty cost : – only customer 2 is delayed 395-227=168 units 168*penalty cost = 168*9=1512 – Route cost is c 03 + c 34 + c 41 + c 10 + c 02 + c 20 =32 – Fixed cost = 15+18=33 – Total cost = 1512+32+33=1577
Conclusions The model still has shortage, and needs to be modified. Design of meta-heuristic algorithm: – Literature review – Design and application to solve in this problem