1. A heuristic for a real-life car sequencing problem with multiple requirements Daniel Aloise 1 Thiago Noronha 1 Celso Ribeiro 1,2 Caroline Rocha 2 Sebastián Urrutia 1 1 Universidade Católica do Rio de Janeiro, Brazil 2 Universidade Federal Fluminense, Brazil MIC’2005 Vienna, Austria

2. Heuristics for a multi-objective car sequencing problem 2/49 Summary Problem statement Basic findings Construction heuristics Neighborhoods Local search Other neighborhoods Improvement heuristics ROADEF challenge Implementation issues Numerical results

3. Heuristics for a multi-objective car sequencing problem 3/49 Problem statement Scheduling in a car factory consists in: 1.Assigning a production day to each vehicle, according to production line capacities and delivery dates; 2.Scheduling the order of cars to be put on the production line for each day, while satisfying as many requirements as possible of the plant shops: body shop, paint shop and assembly line. X

4. Heuristics for a multi-objective car sequencing problem 4/49 Paint shop requirements:  The paint shop has to minimize the consumption of paint solvent used to wash spray guns each time the paint color is changed between two consecutive scheduled vehicles.  Therefore, there is a requirement to group vehicles together by paint color. Problem statement Minimize the number of paint color changes (PCC) in the sequence of scheduled vehicles.

5. Heuristics for a multi-objective car sequencing problem 5/49 Color batches have an upper bound on the batch size. HARD CONSTRAINT 7 washes! 2 washes! Problem statement

6. Heuristics for a multi-objective car sequencing problem 6/49 Assembly line requirements:  Vehicles that require special assembly operations have to be evenly distributed throughout the total processed cars.  These cars may not exceed a given quota over any sequence of vehicles.  This requirement is modeled by a ratio constraint N/P: at most N cars in each consecutive sequence of P cars are associated with this constraint. Problem statement

7. Heuristics for a multi-objective car sequencing problem 7/49 N/P = 3/5 There must be no more than 3 constrained cars in any consecutive sequence of 5 vehicles. N/P = 1/P It means that 2 constrained cars must be separated by at least P-1 consecutive non-constrained vehicles. Problem statement X _ _... _ _ X Constrained car Non-constrained car P-1 cars

8. Heuristics for a multi-objective car sequencing problem 8/49 Assembly line requirements (cont.)  There are two classes of ratio constraints: High priority level ratio constraints (HPRC) are due to car characteristics that require a heavy workload on the assembly line. Low priority level ratio constraints (LPRC) result from car characteristics that cause small inconvenience to production. Problem statement Minimize the number of violations of ratio constraints. SOFT CONSTRAINTS

9. Heuristics for a multi-objective car sequencing problem 9/49 Cost function:  Weights are associated to the objectives according to their priorities  Lexicographic formulation is handled as a single- objective problem Solution cost: P1  number of violations of HPRC + P1  number of violations of HPRC + + P2  number of violations of LPRC + + P3  number of paint color changes Solution cost: P1  number of violations of HPRC + P1  number of violations of HPRC + + P2  number of violations of LPRC + + P3  number of paint color changes P1 >> P2 >> P3 Problem statement EP-ENP-RAF

10. Heuristics for a multi-objective car sequencing problem 10/49 Problem: find the sequence of cars that optimizes painting and assembling requirements. Three different lexicographic problems exist: 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of paint color changes 3)* Minimize the number of violations of low priority ratio constraints 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of paint color changes 3)* Minimize the number of violations of low priority ratio constraints 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of violations of low priority ratio constraints 3)Minimize the number of paint color changes 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of violations of low priority ratio constraints 3)Minimize the number of paint color changes 1)Minimize the number of paint color changes 2)Minimize the number of violations of high priority ratio constraints 3)* Minimize the number of violations of low priority ratio constraints 1)Minimize the number of paint color changes 2)Minimize the number of violations of high priority ratio constraints 3)* Minimize the number of violations of low priority ratio constraints EP-RAF-(ENP) EP-ENP-RAF RAF-EP-(ENP) Problem statement

11. Heuristics for a multi-objective car sequencing problem 11/49 Notation Some notation:  Paint color changes: PCC  High priority ratio constraints: HPRC  Low priority ratio constraints: LPRC  Ratio constraint N/P: at most N cars associated with this constraint in any sequence of P cars  Number of cars: n  Number of constraints: m

12. Heuristics for a multi-objective car sequencing problem 12/49 Basic findings Heuristics are very sensitive to initial solutions:  Effective quick construction heuristics are a must. Same algorithm behaves differently for each problem:  Specific heuristics for each problem. Weight structure strongly differentiates the three objectives:  Algorithms should handle one objective at a time.  Specific algorithms for each objective of each problem.  All objectives should be taken into account: triggering strategies.

13. Heuristics for a multi-objective car sequencing problem 13/49 Four step approach: Construction heuristic First objective optimization Second objective optimization Third objective optimization Basic findings

14. Heuristics for a multi-objective car sequencing problem 14/49 Basic findings Algorithms:EP-RAF-(ENP)EP-ENP-RAFRAF-EP-(ENP) Construction H6 H5 First objective ILS Second objective VNS ILS Third objective ILSVNSILS

15. Heuristics for a multi-objective car sequencing problem 15/49 Basic findings Many neighborhood definitions exist:  Explore simple neighborhoods for local search.  Use complex moves as perturbations. Time limit is restrictive:  Optimize move evaluations and local search.  Use appropriate data structures. Optimal number of paint color changes can be exactly computed in polynomial time:  Initial solutions for problem RAF-EP-(ENP) will have the minimum number of paint color changes.

16. Heuristics for a multi-objective car sequencing problem 16/49 Construction heuristics Heuristic H5:  Starts with the sequence of cars from day D-1.  At each iteration, a yet unselected car is considered for insertion into the partial solution.  Best position (possibly in the middle) to schedule this car into the sequence of cars already scheduled is that with the smallest increase in the cost function.  Insertions into positions corresponding to infeasible partial solutions are discarded.  Obtains a solution minimizing PCC.  Complexity: O(m.n 2 )

17. Heuristics for a multi-objective car sequencing problem 17/49 Construction heuristics Heuristic H6:  Greedy strategy using the number of additional HPRC violations to define the next car to be placed at the end of the partial sequence.  Ties are broken in favor of more equilibrated car distributions.  Second tie breaking criterion based on the hardness of each constraint: Harder constraints are those applied to more cars and that have smaller ratios. Cars with harder constraints are scheduled first.  Complexity: O(m.n 2 )

18. Heuristics for a multi-objective car sequencing problem 18/49 Neighborhoods Local search explores two different types of moves (neighborhoods) evaluated in time O(1):  swap: the positions of two cars are exchanged  shift: a car is moved from its current position to a new specific position

19. Heuristics for a multi-objective car sequencing problem 19/49 Local search Local search uses swap and shift moves.  Quick local search: only cars involved in violations.  Full search: too many cars involved in violations. For each car, select the best improving move.  In case of ties, best moves are kept in a candidate list from which one of them is randomly selected.  Better and same cost solutions are accepted. Move evaluations quickly performed in time O(m). Search stops when all cars have been investigated without improvement.

20. Heuristics for a multi-objective car sequencing problem 20/49 Other neighborhoods Four types of moves are explored as perturbations:  k-swap: k pairs of cars have their positions exchanged

21. Heuristics for a multi-objective car sequencing problem 21/49 Other neighborhoods Four types of moves are explored as perturbations:  group swap: two groups of cars painted with different colors are exchanged

22. Heuristics for a multi-objective car sequencing problem 22/49 Other neighborhoods Four types of moves are explored as perturbations:  inversion: order of the cars in a group painted with the same color is reverted

23. Heuristics for a multi-objective car sequencing problem 23/49 Other neighborhoods Four types of moves are explored as perturbations:  reinsertion: cars involved in violations are eliminated and greedily reinserted

24. Heuristics for a multi-objective car sequencing problem 24/49 Iterated Local Search procedure ILS while stopping criterion not satisfied do s 0  BuildRandomizedInitialSolution() s*  LocalSearch(s 0 ) repeat s’  Perturbation(s*) s’  LocalSearch(s’) s*  AcceptanceCriterion(s*,s’) until reinitialization criterion satisfied end-while end

25. Heuristics for a multi-objective car sequencing problem 25/49 Variable Neighborhood Search procedure VNS s*  BuildInitialSolution() Select neighborhoods N k, k = 1,...,k max while stopping criterion not satisfied do k  1 while k  k max do s’  Shaking(s*, N k ) s”  LocalSearch(s’) s*  AcceptanceCriterion(s*,s”) if s* = s” then k  1 else k  k + 1 end-while end

26. Heuristics for a multi-objective car sequencing problem 26/49 Problem EP-RAF-(ENP) 1.Build initial solution: H6 2.Improve 1st objective: ILS with restarts 3.Make solution feasible for PCC 4.Improve 2nd objective without deteriorating the 1st: VNS 5.Improve 3rd objective without deteriorating the 1st and 2nd: ILS with restarts 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of paint color changes 3)* Minimize the number of violations of low priority ratio constraints 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of paint color changes 3)* Minimize the number of violations of low priority ratio constraints EP-RAF-(ENP)

27. Heuristics for a multi-objective car sequencing problem 27/49 Problem EP-RAF-(ENP) Optimization of the first objective HPRC:  Build initial solution: H6  Improvement: Iterated Local Search (ILS) with restarts  Only first objective is considered.  Local search: swap moves  Intensification: shift followed by swap moves  Perturbations: reinsertion moves  Reinitializations: H6 or reinsertions  Stopping criterion: number of reinitializations without improvement or given fraction of total time

28. Heuristics for a multi-objective car sequencing problem 28/49 Problem EP-RAF-(ENP) Optimization of the second objective PCC:  Repair heuristic to make solution feasible for PCC  Improvement: Variable Neighborhood Search (VNS)  First and second objectives are considered.  First objective does not deteriorate.  Local search: swap moves  Shaking: k-swap moves (k max =20)  Intensification: shift followed by swap moves  Stopping criterion: number of intensifications without improvement or given fraction of total time

29. Heuristics for a multi-objective car sequencing problem 29/49 Problem EP-RAF-(ENP) Optimization of the third objective LPRC:  Improvement: Iterated Local Search (ILS) with restarts  All three objectives are simultaneously considered.  First and second objectives do not deteriorate.  Local search: swap moves  Intensification: shift followed by swap moves  Perturbations: inversion and group swap moves  Reinitializations: variant of H6 that do not deteriorate the first and second objectives  Stopping criterion: time limit

30. Heuristics for a multi-objective car sequencing problem 30/49 Problem EP-ENP-RAF 1.Build initial solution: H6 2.Improve 1st objective: ILS with restarts 3.Improve 2nd objective without deteriorating the 1st: VNS 4.Make solution feasible for PCC 5.Improve 3rd objective without deteriorating the 1st and 2nd: VNS 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of violations of low priority ratio constraints 3)Minimize the number of paint color changes 1)Minimize the number of violations of high priority ratio constraints 2)Minimize the number of violations of low priority ratio constraints 3)Minimize the number of paint color changes EP-ENP-RAF

31. Heuristics for a multi-objective car sequencing problem 31/49 Problem EP-ENP-RAF Optimization of the first objective HPRC:  Build initial solution: H6  Improvement: Iterated Local Search (ILS) with restarts  Only first objective is considered.  Local search: swap moves  Intensification: shift followed by swap moves  Perturbations: reinsertion moves  Reinitializations: H6 or reinsertions  Stopping criterion: number of reinitializations without improvement or given fraction of total time

32. Heuristics for a multi-objective car sequencing problem 32/49 Problem EP-ENP-RAF Optimization of the second objective LPRC:  Improvement: Variable Neighborhood Search (VNS)  First and second objectives are considered.  First objective does not deteriorate.  Local search: swap moves  Shaking: reinsertion and k-swap moves  Intensification: shift followed by swap moves  Stopping criterion: number of intensifications without improvement or given fraction of total time

33. Heuristics for a multi-objective car sequencing problem 33/49 Problem EP-ENP-RAF Optimization of the third objective PCC:  Repair heuristics to make solution feasible for PCC: 1.Antecipatory analysis: build good solution for PCC 2.Swap moves to find feasible solution for PCC 3.Shift moves to ensure feasibility: solution may deteriorate  Improvement: Variable Neighborhood Search (VNS)  All three objectives are simultaneously considered.  First and second objectives do not deteriorate.  Local search: swap moves  Shaking: reinsertion and k-swap moves  Intensification: shift followed by swap moves  Stopping criterion: time limit

34. Heuristics for a multi-objective car sequencing problem 34/49 Problem RAF-EP-(ENP) 1. Build initial solution minimizing 1st objective PCC: H5 2. Improve 2nd objective without deteriorating the 1st: ILS with restarts 3. Improve 3rd objective without deteriorating the 1st and 2nd: ILS with restarts 1)Minimize the number of paint color changes 2)Minimize the number of violations of high priority ratio constraints 3)* Minimize the number of violations of low priority ratio constraints 1)Minimize the number of paint color changes 2)Minimize the number of violations of high priority ratio constraints 3)* Minimize the number of violations of low priority ratio constraints RAF-EP-(ENP)

35. Heuristics for a multi-objective car sequencing problem 35/49 Problem RAF-EP-(ENP) Optimization of the second objective HPRC:  Improvement: Iterated Local Search (ILS) with restarts  First and second objectives are considered.  First objective does not deteriorate.  Local search: swap moves  Intensification: shift followed by swap moves  Perturbations: group swap and inversion moves  Reinitializations: H5  Stopping criterion: same solution hit many times after given fraction of total time

36. Heuristics for a multi-objective car sequencing problem 36/49 Problem RAF-EP-(ENP) Optimization of the third objective LPRC:  Improvement: Iterated Local Search (ILS) with restarts  All three objectives are simultaneously considered.  First and second objectives do not deteriorate.  Local search: swap moves  Intensification: shift followed by swap moves  Perturbations: inversion and group swap moves  Reinitializations: variant of H6 that do not deteriorate the first and second objectives  Stopping criterion: time limit

37. Heuristics for a multi-objective car sequencing problem 37/49 ROADEF Challenge Real life problem proposed by Renault First phase:  Test set A provided by Renault (16 instances)  Results evaluated for instances in test set A  Best teams selected (52 candidates) Second phase:  Test set B provided by Renault (45 instances)  Teams improved their codes using test set B Third and final phase:  Renault evaluated the algorithms using test set X of unknown instances (19 instances) Instances of the three types in each test set

38. Heuristics for a multi-objective car sequencing problem 38/49 ROADEF Challenge ID Instances EP-ENP-RAF X1 025_S49_J1 X2028_CH1_S50_J4 X3028_CH2_S51_J1 ID Instances EP-RAF-ENP X4023_S49_J2 X5024_S49_J2 X6029_S49_J5 X7034_VP_S51_J1_J2_J3 X8034_VU_S51_J1_J2_J3 X9039_CH1_S49_J1 X10039_CH3_S49_J1 X11048_CH1_S50_J4 X12048_CH2_S49_J5 X13064_CH1_S49_J1 X14064_CH2_S49_J4 X15655_CH1_S51_J2_J3_J4 X16655_CH2_S52_J1_J2_S01_J1 ID Instances RAF-EP-(ENP) X17022_S49_J2 X18035_CH1_S50_J4* X19035_CH2_S50_J4*

39. Heuristics for a multi-objective car sequencing problem 39/49 Implementation issues Same quality solutions (ties) encouraged, accepted, and explored to diversify the search. Neighbors that cannot improve the current solution are not investigated, for example:  To do not deteriorate PCC, a car inside (but not in the border of) a color group may only be exchanged with another car with the same color.  Swap of two cars not involved in violations cannot improve the total number of violations.  Only shift moves of isolated cars can reduce the number of paint color changes.

40. Heuristics for a multi-objective car sequencing problem 40/49 Implementation issues Codes in C++ compiled with version 3.2.2 of the gcc compiler with the optimization flag -O3. Extensive use of profiling for code optimization. Approximately 27000 lines of code. C++ library routines linked with flag -static -lstdc++ Computational experiments on a Pentium IV with 1.8 GHz clock and 512 Mbytes of RAM memory. Time limit: 600 seconds (imposed by Renault). Schrage’s random number generator.

41. Heuristics for a multi-objective car sequencing problem 41/49 Numerical results Instances EP-ENP-RAF Our average results (5 runs)Best average results (5 runs) HPRCLPRCPCCCostHPRCLPRCPCCCost X10.0160.0602.2160602.20.0160.0407.6160407.6 X236.0341.495.436341495.436.0341.495.436341495.4 X30.0 3.0 0.0 3.0 Team A PUC-UFF PUC-UFF+

42. Heuristics for a multi-objective car sequencing problem 42/49 Numerical results Instances EP-RAF-(ENP) Our average results (5 runs)Best average results (5 runs) HPRCLPRCPCCCostHPRCLPRCPCCCost X40.077.2193.0193077.20.066.0192.4192466.0 X50.012.0352.8352812.00.06.0337.0337006.0 X60.066.0111.8111866.00.098.4110.2110298.4 X70.0643.658.058643.60.0794.855.255994.8 X88.035.887.08087035.88.035.887.08087035.8 X90.0479.669.069479.60.0239.069.069239.0 Team A Team C Team E PUC-UFF Team A

43. Heuristics for a multi-objective car sequencing problem 43/49 Numerical results Instances EP-RAF-(ENP) Our average results (5 runs)Best average results (5 runs) HPRCLPRCPCCCostHPRCLPRCPCCCost X100.02162.6231.0233162.60.030.0231.0231030.0 X110.01016.0196.0197016.00.01005.6196.0197005.0 X1231.01128.479.031080128.431.01116.276.831077916.2 X1361.081.4190.861190881.461.029.8187.261187229.8 X140.037.00.037000.00.037.00.037000.0 X150.030.00.030000.00.030.00.030000.0 X16153.00.034.0153034000.0153.00.034.0153034000.0 Team B Team D Team A PUC-UFF+ PUC-UFF+ PUC-UFF+

44. Heuristics for a multi-objective car sequencing problem 44/49 Numerical results Instances RAF-EP-(ENP) Our average results (5 runs)Best average results (5 runs) HPRCLPRCPCCCostHPRCLPRCPCCCost X172.03.012.012002003.02.03.012.012002003.0 X1810.00.05.05010000.010.00.05.05010000.0 X1956.00.06.06056000.056.00.06.06056000.0 PUC-UFF+PUC-UFF+ PUC-UFF+

45. Heuristics for a multi-objective car sequencing problem 45/49 Numerical results running time (s) average cost

46. Heuristics for a multi-objective car sequencing problem 46/49 Numerical results running time (s) average cost

47. Heuristics for a multi-objective car sequencing problem 47/49 Numerical results running time (s) average cost

48. Heuristics for a multi-objective car sequencing problem 48/49 Numerical results

49. Heuristics for a multi-objective car sequencing problem 49/49 Numerical results Team A: B. Estelllon, F. Gardi, K. Nouioua Team PUC-UFF: D. Aloise, T. Noronha, C. Ribeiro, C. Rocha, S. Urrutia