Pareto lexicographic α-robust approach and its application in robust multi objective assembly line balancing problem

Abstract

Robustness in most of the literature is associated with min-max or min-max regret criteria. However, these criteria of robustness are conservative and therefore recently new criteria called, lexicographic α-robust method has been introduced in literature which defines the robust solution as a set of solutions whose quality or jth largest cost is not worse than the best possible jth largest cost in all scenarios. These criteria might be significant for robust optimization of single objective optimization problems. However, in real optimization problems, two or more than two conflicting objectives are desired to optimize concurrently and solution of multi objective optimization problems exists in the form of a set of solutions called Pareto solutions and from these solutions it might be difficult to decide which Pareto solution can satisfy min-max, min-max regret or lexicographic α-robust criteria by considering multiple objectives simultaneously. Therefore, lexicographic α-robust method which is a recently introduced method in literature is extended in the current research for Pareto solutions. The proposed method called Pareto lexicographic α-robust approach can define Pareto lexicographic α-robust solutions from different scenarios by considering multiple objectives simultaneously. A simple example and an application of the proposed method on a simple problem of multi objective optimization of simple assembly line balancing problem with task time uncertainty is presented to get their robust solutions. The presented method can be significant to implement on different multi objective robust optimization problems containing uncertainty.

Keywords

Pareto / lexicographic α-robust / assembly line balancing

References

[1] Chica M, Cordón Ó, Damas S. An advanced multi objective genetic algorithm design for the time and space assembly line balancing problem. Computers & Industrial Engineering, 2011, 61(1): 103-117

[2] Hamta N, Fatemi Ghomi S M T, Jolai F, Akbarpour Shirazi M. A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect. International Journal of Production Economics, 2013, 141(1): 99-111

[3] Ponnambalam S G, Aravindan P, Mogileeswar Naidu G. A multi-objective genetic algorithm for solving assembly line balancing problem. International Journal of Advanced Manufacturing Technology, 2000, 16(5): 341-352

[4] Wei N C, Chao I M. A solution procedure for type E-simple assembly line balancing problem. Computers & Industrial Engineering, 2011, 61(3): 824-830

[5] Shin D. An efficient heuristic for solving stochastic assembly line balancing problems. Computers & Industrial Engineering, 1990, 18(3): 285-295

[6] Cakir B, Altiparmak F, Dengiz B. Multi-objective optimization of a stochastic assembly line balancing: a hybrid simulated annealing algorithm. Computers & Industrial Engineering, 2011, 60(3): 376-384

[7] McMullen P R, Tarasewich P. Multi-objective assembly line balancing via a modified ant colony optimization technique. International Journal of Production Research, 2006, 44(1): 27-42

[8] Aydemir-Karadag A, Turkbey O. Multi-objective optimization of stochastic disassembly line balancing with station paralleling. Computers & Industrial Engineering, 2013, 65(3): 413-425

[9] Hop N V. A heuristic solution for fuzzy mixed-model line balancing problem. European Journal of Operational Research, 2006, 168(3): 798-810

[10] Xu W, Xiao T. Mixed model assembly line balancing problem with fuzzy<?Pub Caret?> operation times and drifting operations. In: Proceeding of Winter Simulation Conference, Miami, FL, USA, 2008, 1752-1760

[11] Gen M, Tsujimura Y, Li Y. Fuzzy assembly line balancing using genetic algorithms. Computers & Industrial Engineering, 1996, 31(3-4): 631-634

[12] Kara Y, Paksoy T, Chang C T. Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing. European Journal of Operational Research, 2009, 195(2): 335-347

[13] Kouvelis P, Yu G. Robust Discrete Optimization and Its Applications. Boston, MA, USA: Kluwer Academic Publishers, 1997

[14] Xu W, Xiao T. Strategic robust mixed model assembly line balancing based on scenario planning. Tsinghua Science and Technology, 2011, 16(3): 308-314

[15] Assavapokee T, Realff M J, Ammons J C, Hong I H. Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization. Computers & Operations Research, 2008, 35(6): 2093-2102

[16] Roy B. Robustness in operational research and decision aiding: a multi-faceted issue. European Journal of Operational Research, 2010, 200(3): 629-638

[17] Blanquero R, Carrizosa E, Hendrix E M T. Locating a competitive facility in the plane with a robustness criterion. European Journal of Operational Research, 2011, 215(1): 21-24

[18] Dolgui A, Kovalev S. Scenario based robust line balancing: Computational complexity. Discrete Applied Mathematics, 2012, 160(13-14): 1955-1963

[19] Hazir Ö, Dolgui A. Assembly line balancing under uncertainty: Robust optimization models and exact solution method. Computers & Industrial Engineering, 2013, 65(2): 261-267

[20] Daniels R L, Carrillo J E. β-Robust scheduling for single-machine systems with uncertain processing times. IIE Transactions, 1997, 29(11): 977-985

[21] Ullah S, Liu Q, Zhang C Y, Yasser R. Scheduling with uncertain processing times: applying β-robust schedule on two-machine flow-shop with constraints. Proceedings of IEEM, 2009, 1946-1951

[22] Liu Q, Ullah S, Zhang C Y. An improved genetic algorithm for robust permutation flowshop scheduling. International Journal of Advanced Manufacturing Technology, 2011, 56(1-4): 345-354

[23] Snyder L. Facility location under uncertainty: a review. IIE Transactions, 2006, 38(7): 547-554

[24] Kalai R, Lamboray C, Vanderpooten D. Lexicographic α-robustness: An alternative to min-max criteria. European Journal of Operational Research, 2012, 220(3): 722-728

[25] Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multi objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197

[26] Boysen N, Fliedner M, Scholl A. Assembly line balancing: Which model to use when? International Journal of Production Economics, 2008, 111(2): 509-528

Acknowledgements

This work has been supported by MOST (the Ministry of Science & Technology of China) under the Grant Nos. 2012AA040909, 2012BAH08F04 and 2013AA040206, and by the National Natural Science Foundation of China (Grant Nos. 51035001 and 71271156).

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg