Skip to main content
SpringerLink
Log in

A hyper-heuristic approach for stochastic parallel assembly line balancing problems with equipment costs

  • Original paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

This study addresses the stochastic parallel assembly line balancing problem with equipment costs and presents a hyper-heuristic approach based on simulated annealing for solving it. A cost-based objective function is employed to represent the incompletion, equipment, and station installation costs. The hyper-heuristic approach is utilized to search on sequencing heuristics search space, rather than a problem-specific solution space. This study focuses on the consideration of equipment costs while balancing a stochastic parallel assembly line. The performance of the solution approach is also tested on the single-model stochastic assembly line balancing problems and stochastic parallel assembly line balancing problems due to the generalizability of hyper-heuristics. The results of the benchmark problems show that in most cases the proposed algorithm provides better solutions than the best-known solutions in literature. An extensive computational study performed to determine the parameter levels derived from the problem and the solution method. The effect of the equipment costs for stochastic parallel assembly lines is also analyzed in detail.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Ağpak K, Gökçen H (2007) A chance-constrained approach to stochastic line balancing problems. Eur J Oper Res 180(3):1098–1115

    Google Scholar 

  • Amen M (2006) Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds. Eur J Oper Res 168(3):747–770

    Google Scholar 

  • Arcus AL (1966) COMSOAL: A computer method of sequencing operations for assembly lines. Int J Prod Res 4(4):259–277

    Google Scholar 

  • Bai R, Blazewicz J, Burke EK, Kendall G, McCollum B (2012) A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR. Q J Oper Res 10(1):43–66

    Google Scholar 

  • Baykasoğlu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17:217–232

    Google Scholar 

  • Baykasoğlu A, Özbakir L (2015) Discovering task assignment rules for assembly line balancing via genetic programming. Int J Adv Manuf Technol 76:417–434

    Google Scholar 

  • Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694–715

    Google Scholar 

  • Benzer R, Gökçen H, Çetinyokuş T, Çerçioğlu H (2007) A network model for parallel line balancing problem. Math Probl Eng. https://doi.org/10.1155/2007/10106

    Article  Google Scholar 

  • Bilgin B, Diemester P, Misir M, Vancroonenburg W, Vanden Berghe G (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18:401–438

    Google Scholar 

  • Blazewicz J, Burke EK, Kendall G, Mruczkiewicz Wojciech, Oguz Ceyda, Swiercz Aleksandra (2013) A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Ann Oper Res 207:27–41

    Google Scholar 

  • Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 2:674–693

    Google Scholar 

  • Boysen N, Fliedner M, Scholl A (2008) Assembly line balancing: Which model to use when? Int J Prod Econ 111:509–528

    Google Scholar 

  • Bukchin J, Tzur M (2000) Design of flexible assembly line to minimize equipment cost. IIE Trans 32:585–598

    Google Scholar 

  • Burke E, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176:177–192

    Google Scholar 

  • Burke EK, Hyde M, Kendall G, Ochoa G, Özcan E, Woodward J (2010) A classification of hyper-heuristic approaches. Handbook of metaheuristics (International Series in Operations Research and Management Science), vol 146. Springer, New York, pp 449–468

    Google Scholar 

  • Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, Özcan E, Qu R (2013) Hyper-heuristics: A survey of the state of the art. J Oper Res Soc 64(12):1695–1724

    Google Scholar 

  • Çakır B, Altıparmak F, Dengiz B (2011) Multi-objective optimization of a stochastic assembly line balancing: a hybrid simulated annealing algorithm. Comput Ind Eng 60:376–384

    Google Scholar 

  • Çercioğlu H (2009) New models for stochastic parallel assembly line balancing problem, Ph.D. Thesis, Gazi University Graduate School of Natural and Applied Sciences, Department of Industrial Engineering, Thesis No. 233913, Ankara, Turkey

  • Çerçioğlu H, Özcan U, Gökçen H, Toklu B (2009) A simulated annealing approcah for parallel assembly line balancing problem. J Fac Eng Archi Gazi Univ 24(2):331–341

    Google Scholar 

  • Chiang WC, Kouvelis P, Urban TL (2007) Line balancing in a just in time production environment: balancing multiple U-lines. IIE Trans 39:347–359

    Google Scholar 

  • Dowsland KA, Soubeiga E, Burke EK (2007) A simulated annealing hyper-heuristic for determining shipper sizes. Eur J Oper Res 179(3):759–774

    Google Scholar 

  • Drake JH, Özcan E, Burke EK (2016) A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem. Evol Comput 24(1):113–141

    Google Scholar 

  • Ege Y, Azizoğlu M, Özdemirel NE (2009) Assembly line balancing with station paralleling. Comput Ind Eng 57:1218–1225

    Google Scholar 

  • El-Abd M, Kamel M (2005) A taxonomy of cooperative search algorithms. In: Blesa MJ, Blume C, Roli A, Samples M (eds) Hybrid Metaheuristic. Heidelberg, Germany), pp 32–42

    Google Scholar 

  • Erel E, Sabuncuoğlu I, Şekerci H (2005) Stochastic assembly line balancing using beam search. Int J Prod Res 43(7):1411–1426

    Google Scholar 

  • Fialho A (2010) Adaptive operator selection for optimization, Ph.D. Thesis, Computer Science, Universit´e Paris Sud-Paris XI

  • Garrido P, Riff M (2010) Dvrp: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristics. J Heuristics 16(6):795–834

    Google Scholar 

  • Gökçen H, Ağpak K, Benzer R (2006) Balancing of parallel assembly lines. Int J Prod Econ 103(2):600–609

    Google Scholar 

  • Kara Y, Özcan U, Peker A (2007) An approach for balancing and sequencing mixed-model JIT U-lines. Int J Adv Manuf Technol 32(11–12):1218–1231

    Google Scholar 

  • Kara Y, Gökçen H, Atasagun Y (2010) Balancing parallel assembly lines with precise and fuzzy goals. Int J Prod Res 48(6):1685–1703

    Google Scholar 

  • Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computation. Plenum Press, New York, pp 85–103

    Google Scholar 

  • Kottas JF, Lau HS (1981) A stochastic line balancing procedure. Int J Prod Res 19(2):177–193

    Google Scholar 

  • Küçükkoç I, Zhang DZ (2014) Mathematical model and agent-based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines. Int J Prod Econ 158:314–333

    Google Scholar 

  • Küçükkoç I, Zhang DZ (2015a) Type-E parallel two-sided assembly line balancing problem: Mathematical model and ant colony optimization based approach with optimized parameters. Comput Ind Eng 84:56–69

    Google Scholar 

  • Küçükkoç I, Zhang DZ (2015b) Balancing of parallel U-shaped assembly lines. Comput Oper Res 64:233–244

    Google Scholar 

  • Küçükkoç I, Zhang DZ (2016) Mixed-model parallel two-sided assembly line balancing problem: a flexible agent-based ant colony optimization approach. Comput Ind Eng 97:58–72

    Google Scholar 

  • Küçükkoç I, Zhang DZ, Keedwell EC (2013a) Balancing parallel two-sided assembly lines with ant colony optimisation algorithm. In: Proceedings of the 2nd symposium on nature-inspired computing and applications (NICA) at artificial intelligence and the simulation of behavior (AISB) 2013 convention, University of Exeter, Exeter, pp 21–28

  • Küçükkoç I, Zhang DZ, Keedwell EC, Pakgohar A (2013b) An improved ant colony optimization algorithm for type-1 parallel two-sided assembly line balancing problem. In: The OR society YOR18 biennial conference. University of Exeter, Exeter

  • Lan C-H (2007) The design of multiple production lines under deadline constraint. Int J Prod Econ 106:191–203

    Google Scholar 

  • Lusa A (2008) A survey of the literature on the multiple or parallel assembly line balancing problem. Eur J Ind Eng 2(1):50–72

    Google Scholar 

  • Mardani-Fard HA, Hadi-Vencheh A, Mahmoodirad A, Niroomand S (2018) An efective hybrid goal programming approach for multi objective straight assembly line balancing problem with stochastic parameters. Oper Res. https://doi.org/10.1007/s12351-018-0428-8

    Article  Google Scholar 

  • McMullen P, Frazier G (1998) Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations. Int J Prod Res 36:2717–2741

    Google Scholar 

  • Mısır M, Verbeeck K, Causmaecker P De, Vanden Berghe G (2013) An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl Soft Comput 13(7):3335–3353

    Google Scholar 

  • Ortis-Bayliss J, Özcan E, Parkes A, Terashima-Marin H (2010) Mapping the performance of heuristics for constraint satisfaction. IEEE congress on evolutionary computation (CEC2010), Barcelona, pp 1–8

  • Özbakır L, Baykasoğlu A, Görkemli B, Görkemli L (2011) Multiple-colony ant algorithm for parallel assembly line balancing problem. Appl Soft Comput 11:3186–3198

    Google Scholar 

  • Özcan U (2018) Balancing stochastic parallel assembly lines. Comput Oper Res 99:109–122

    Google Scholar 

  • Özcan U, Çerçioğlu H, Gökçen H, Toklu B (2009) A tabu search algorithm for the parallel assembly line balancing problem. Gazi Univ J Sci 22(4):313–323

    Google Scholar 

  • Özcan U, Çerçioğlu H, Gökçen H, Toklu B (2010) Balancing and sequencing of parallel mixed-model assembly lines. Int J Prod Res 48(17):5089–5113

    Google Scholar 

  • Ritt M, Costa AM, Miralles C (2016) The assembly line worker assignment and balancing problem with stochastic worker availability. Int J Prod Res 54(3):907–922

    Google Scholar 

  • Rosenberg O, Ziegler H (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Zeitschrift für Oper Res 36:477–495

    Google Scholar 

  • Saif U, Guan Z, Zhang L, Mirza J, Lei Y (2017) Hybrid pareto artificial bee colony algorithm for assembly line balancing with task time variations. Int J Comput Integr Manuf 30(2–3):255–270

    Google Scholar 

  • Sarin S, Erel E, Dar-El E (1999) A methodology for solving single-model, stochastic assembly line balancing problem. Omega 27:525–535

    Google Scholar 

  • Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666–693

    Google Scholar 

  • Scholl A, Boysen N (2009) Designing parallel assembly lines with split workplaces: model and optimization procedure. Int J Prod Econ 119(1):90–100

    Google Scholar 

  • Shin D (1990) An Efficient heuristic for solving stochastic assembly line balancing problems. Comput Ind Eng 18(3):285–295

    Google Scholar 

  • Silverman F, Carter J (1986) A cost-based methodology for stochastic line balancing with intermittent line stoppages. Manage Sci 32:455–463

    Google Scholar 

  • Süer GA (1998) Designing parallel assembly lines. Comput Ind Eng 35(3–4):467–470

    Google Scholar 

  • Suresh G, Sahu S (1994) Stochastic assembly line balancing using simulated annealing. Int J Prod Res 32:1801–1810

    Google Scholar 

  • Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes. Asian Productivity Organization/UNIPUB, White Plain

    Google Scholar 

  • Talbi EG (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8:541–564

    Google Scholar 

  • Tapkan P, Özbakir L, Baykasoğlu A (2016) Bee algorithms for parallel two-sided assembly line balancing problem with walking times. Appl Soft Comput 39(275–291):2016

    Google Scholar 

  • Terashima-Marin H, Ross P, Farias-Zarate C, Lopez-Camacho E, Valenzuela-Rendon M (2009) Generalized hyper-heuristics for solving regular and irregular bin packing problems. Ann Oper Res 179(1):369–392

    Google Scholar 

  • Vazquez-Rodriguez J, Petrovic S (2010) A new dispatching rule based genetic algorithm for the multi-objective job shop problem. J Heuristics 16(6):771–793

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Erciyes University, Kayseri, Turkey

    Lale Özbakır

  2. Nevşehir Hacı Bektaş Veli University, Nevşehir, Turkey

    Gökhan Seçme

Authors
  1. Lale Özbakır
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gökhan Seçme
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lale Özbakır.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Özbakır, L., Seçme, G. A hyper-heuristic approach for stochastic parallel assembly line balancing problems with equipment costs. Oper Res Int J 22, 577–614 (2022). https://doi.org/10.1007/s12351-020-00561-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-020-00561-x

Keywords

Search

Navigation