nach oben

Neural Computing and Applications

Erschienen in:

03.01.2021 | Original Article

Multi-objective migrating bird optimization algorithm for cost-oriented assembly line balancing problem with collaborative robots

verfasst von: Zixiang Li, Mukund Nilakantan Janardhanan, Qiuhua Tang

Erschienen in: Neural Computing and Applications | Ausgabe 14/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Industries are increasingly looking for opportunities at utilizing collaborative robots in assembly lines to perform the tasks independently or assist the human workers due to the advancement of industry 4.0 technologies. Purchasing cost is one of the important factors to be considered by production managers, while designing or redesigning assembly line when collaborative robots are being utilized. Several objectives are to be optimized in an assembly line balancing problem and optimizing line efficiency along with purchasing cost sometimes results in conflicting situation. This paper presents the first study to tackle the cost-oriented assembly line balancing problem with collaborative robots, where several different types of collaborative robots with different purchasing costs are available and selected. A multi-objective mixed-integer programming model is developed to minimize the cycle time and the total collaborative robot purchasing cost. The multi-objective migrating bird optimization algorithm is developed to obtain a set of high-quality Pareto solutions. This algorithm utilizes the fast non-dominated sorting approach to update the population and develops a restart mechanism to select one solution in the permanent Pareto archive to replace the abandoned solution which remains unchanged for several iterations. The computational study validates that the utilization of the multi-objective model is reasonable and developed algorithm produces competing performance in comparison with multi-objective non-dominated sorting genetic algorithm II, multi-objective simulated annealing algorithm and two multi-objective artificial bee colony algorithms.

Vorheriger Artikel An iterative gradient convolutional neural network and its application in endoscopic photoacoustic image formation from incomplete acoustic measurement

Nächster Artikel EchoFakeD: improving fake news detection in social media with an efficient deep neural network

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Battaïa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Int J Prod Econ 142(2):259–277CrossRef

Li Z, Janardhanan MN, Tang Q, Ponnambalam SG (2019) Model and metaheuristics for robotic two-sided assembly line balancing problems with setup times. Swarm Evolution Comput 50:100567. https://doi.org/10.1016/j.swevo.2019.100567CrossRef

Weckenborg C, Kieckhäfer K, Müller C, Grunewald M, Spengler TS (2019) Balancing of assembly lines with collaborative robots. Bus Res. https://doi.org/10.1007/s40685-019-0101-yCrossRef

Gupta S, Deep K (2019) A novel random walk grey wolf optimizer. Swarm Evol Comput 44:101–112. https://doi.org/10.1016/j.swevo.2018.01.001CrossRef

Gupta S, Deep K, Heidari AA, Moayedi H, Chen H (2019) Harmonized salp chain-built optimization. Eng Comput. https://doi.org/10.1007/s00366-019-00871-5CrossRef

Gupta S, Deep K (2019) Hybrid grey wolf optimizer with mutation operator. In: Bansal JC, Das KN, Nagar A, Deep K, Ojha AK (eds) Soft computing for problem solving 2019. Springer, Singapore, pp 961–968

Gupta S, Deep K, Engelbrecht AP (2020) A memory guided sine cosine algorithm for global optimization. Eng Appl Artif Intell 93:103718. https://doi.org/10.1016/j.engappai.2020.103718CrossRef

Gupta S, Deep K (2020) A memory-based Grey Wolf Optimizer for global optimization tasks. Appl Soft Comput 93:106367. https://doi.org/10.1016/j.asoc.2020.106367CrossRef

Gupta S, Deep K (2019) A hybrid self-adaptive sine cosine algorithm with opposition based learning. Expert Syst Appl 119:210–230. https://doi.org/10.1016/j.eswa.2018.10.050CrossRef

10.

Gupta S, Deep K (2018) Cauchy grey wolf optimiser for continuous optimisation problems. J Exp Theor Artif Intell 30(6):1051–1075. https://doi.org/10.1080/0952813X.2018.1513080CrossRef

11.

Li Z, Janardhanan MN, Ashour AS, Dey N (2019) Mathematical models and migrating birds optimization for robotic U-shaped assembly line balancing problem. Neural Comput Appl 31(12):9095–9111. https://doi.org/10.1007/s00521-018-3957-4CrossRef

12.

Janardhanan MN, Li Z, Bocewicz G, Banaszak Z, Nielsen P (2019) Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times. Appl Math Model 65:256–270. https://doi.org/10.1016/j.apm.2018.08.016MathSciNetCrossRefMATH

13.

Eghtesadifard M, Khalifeh M, Khorram M (2020) A systematic review of research themes and hot topics in assembly line balancing through the web of science within 1990–2017. Comput Ind Eng 139:106182. https://doi.org/10.1016/j.cie.2019.106182CrossRef

14.

Sewell EC, Jacobson SH (2012) A branch, bound, and remember algorithm for the simple assembly line balancing problem. INFORMS J Comput 24(3):433–442. https://doi.org/10.1287/ijoc.1110.0462MathSciNetCrossRefMATH

15.

Li Z, Janardhanan MN, Rahman HF (2020) Enhanced beam search heuristic for U-shaped assembly line balancing problems. Eng Optim. https://doi.org/10.1080/0305215X.2020.1741569CrossRef

16.

Pape T (2015) Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements. Eur J Oper Res 240(1):32–42. https://doi.org/10.1016/j.ejor.2014.06.023MathSciNetCrossRefMATH

17.

Huo J, Wang Z, Chan FTS, Lee CKM, Strandhagen JO (2018) Assembly line balancing based on beam ant colony optimisation. Math Probl Eng 2018:1–17. https://doi.org/10.1155/2018/2481435CrossRef

18.

Li Z, Kucukkoc I, Tang Q (2019) A comparative study of exact methods for the simple assembly line balancing problem. Soft Comput. https://doi.org/10.1007/s00500-019-04609-9CrossRef

19.

Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713. https://doi.org/10.1109/TEVC.2008.919004CrossRef

20.

Li Z, Dey N, Ashour AS, Tang Q (2018) Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Comput Appl 30(9):2685–2696. https://doi.org/10.1007/s00521-017-2855-5CrossRef

21.

Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007CrossRef

22.

Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008CrossRef

23.

Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRef

24.

Zhang Z, Tang Q, Li Z, Zhang L (2019) Modelling and optimisation of energy-efficient U-shaped robotic assembly line balancing problems. Int J Prod Res 57(17):5520–5537. https://doi.org/10.1080/00207543.2018.1530479CrossRef

25.

Zhang Z, Tang Q, Zhang L (2019) Mathematical model and grey wolf optimization for low-carbon and low-noise U-shaped robotic assembly line balancing problem. J Clean Prod 215:744–756. https://doi.org/10.1016/j.jclepro.2019.01.030CrossRef

26.

Li Z, Tang Q, Zhang L (2016) Minimizing energy consumption and cycle time in two-sided robotic assembly line systems using restarted simulated annealing algorithm. J Cleaner Prod 135:508–522. https://doi.org/10.1016/j.jclepro.2016.06.131CrossRef

27.

Zhang Z, Tang Q, Ruiz R, Zhang L (2020) Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach. Comput Oper Res 118:104905. https://doi.org/10.1016/j.cor.2020.104905MathSciNetCrossRefMATH

28.

Rubinovitz J (1991) Design and balancing of robotic assembly lines. In: Proceedings of the fourth world conference on robotics research, Pittsburgh, PA, 1991

29.

Rubinovitz J, Bukchin J, Lenz E (1993) RALB–a heuristic algorithm for design and balancing of robotic assembly lines. CIRP Ann 42(1):497–500. https://doi.org/10.1016/s0007-8506(07)62494-9CrossRef

30.

Borba L, Ritt M, Miralles C (2018) Exact and heuristic methods for solving the robotic assembly line balancing problem. Eur J Oper Res 270(1):146–156. https://doi.org/10.1016/j.ejor.2018.03.011MathSciNetCrossRefMATH

31.

Kim H, Park S (1995) A strong cutting plane algorithm for the robotic assembly line balancing problem. Int J Prod Res 33(8):2311–2323. https://doi.org/10.1080/00207549508904817CrossRefMATH

32.

Çil ZA, Mete S, Ağpak K (2017) Analysis of the type II robotic mixed-model assembly line balancing problem. Eng Optim 49(6):990–1009. https://doi.org/10.1080/0305215X.2016.1230208MathSciNetCrossRef

33.

Levitin G, Rubinovitz J, Shnits B (2006) A genetic algorithm for robotic assembly line balancing. Eur J Oper Res 168(3):811–825. https://doi.org/10.1016/j.ejor.2004.07.030MathSciNetCrossRefMATH

34.

Gao J, Sun L, Wang L, Gen M (2009) An efficient approach for type II robotic assembly line balancing problems. Comput Ind Eng 56(3):1065–1080. https://doi.org/10.1016/j.cie.2008.09.027CrossRef

35.

Daoud S, Chehade H, Yalaoui F, Amodeo L (2014) Solving a robotic assembly line balancing problem using efficient hybrid methods. J Heuristics 20(3):235–259. https://doi.org/10.1007/s10732-014-9239-0CrossRef

36.

Nilakantan JM, Huang GQ, Ponnambalam S (2015) An investigation on minimizing cycle time and total energy consumption in robotic assembly line systems. J Clean Prod 90:311–325CrossRef

37.

Nilakantan M, Ponnambalam S (2016) Robotic U-shaped assembly line balancing using particle swarm optimization. Eng Optim 48(2):231–252MathSciNetCrossRef

38.

Nilakantan JM, Ponnambalam SG, Jawahar N, Kanagaraj G (2015) Bio-inspired search algorithms to solve robotic assembly line balancing problems. Neural Comput Appl 26(6):1379–1393. https://doi.org/10.1007/s00521-014-1811-xCrossRef

39.

Nilakantan JM, Nielsen I, Ponnambalam SG, Venkataramanaiah S (2017) Differential evolution algorithm for solving RALB problem using cost- and time-based models. Int J Adv Manuf Technol 89(1):311–332. https://doi.org/10.1007/s00170-016-9086-2CrossRef

40.

Li Z, Janardhanan MN, Nielsen P, Tang Q (2018) Mathematical models and simulated annealing algorithms for the robotic assembly line balancing problem. Assembly Autom 38(4):420–436. https://doi.org/10.1108/Aa-09-2017-115CrossRef

41.

Yoosefelahi A, Aminnayeri M, Mosadegh H, Ardakani HD (2012) Type II robotic assembly line balancing problem: An evolution strategies algorithm for a multi-objective model. J Manuf Syst 31(2):139–151. https://doi.org/10.1016/j.jmsy.2011.10.002CrossRef

42.

Zhou B, Wu Q (2020) Decomposition-based bi-objective optimization for sustainable robotic assembly line balancing problems. J Manuf Syst 55:30–43. https://doi.org/10.1016/j.jmsy.2020.02.005CrossRef

43.

Pereira J, Ritt M, Vásquez ÓC (2018) A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Comput Oper Res 99:249–261. https://doi.org/10.1016/j.cor.2018.07.001MathSciNetCrossRefMATH

44.

Nilakantan JM, Li Z, Tang Q, Nielsen P (2017) Multi-objective co-operative co-evolutionary algorithm for minimizing carbon footprint and maximizing line efficiency in robotic assembly line systems. J Clean Prod 156:124–136. https://doi.org/10.1016/j.jclepro.2017.04.032CrossRef

45.

Zhou B, Wu Q (2019) An improved immune clonal selection algorithm for bi-objective robotic assemble line balancing problems considering time and space constraints. Eng Comput 36(6):1868–1892. https://doi.org/10.1108/ec-11-2018-0512CrossRef

46.

Li Z, Janardhanan MN, Tang Q, Nielsen P (2016) Co-evolutionary particle swarm optimization algorithm for two-sided robotic assembly line balancing problem. Adv Mech Eng 8(9):1–14. https://doi.org/10.1177/1687814016667907CrossRef

47.

Rabbani M, Mousavi Z, Farrokhi-Asl H (2016) Multi-objective metaheuristics for solving a type II robotic mixed-model assembly line balancing problem. J Ind Prod Eng 33(7):472–484. https://doi.org/10.1080/21681015.2015.1126656CrossRef

48.

Aghajani M, Ghodsi R, Javadi B (2014) Balancing of robotic mixed-model two-sided assembly line with robot setup times. Int J Adv Manuf Tech 74(5–8):1005–1016. https://doi.org/10.1007/s00170-014-5945-xCrossRef

49.

Çil ZA, Mete S, Özceylan E, Ağpak K (2017) A beam search approach for solving type II robotic parallel assembly line balancing problem. Appl Soft Comput 61:129–138. https://doi.org/10.1016/j.asoc.2017.07.062CrossRef

50.

Li Z, Janardhanan MN, Tang Q, Nielsen P (2018) Mathematical model and metaheuristics for simultaneous balancing and sequencing of a robotic mixed-model assembly line. Eng Optim 50(5):877–893. https://doi.org/10.1080/0305215x.2017.1351963MathSciNetCrossRef

51.

Çil ZA, Mete S, Özceylan E (2018) A mathematical model for semi-robotic assembly line balancing problem: a case study. Int J Lean Think 9(1):70–76

52.

Samouei P, Ashayeri J (2019) Developing optimization & robust models for a mixed-model assembly line balancing problem with semi-automated operations. Appl Math Model 72:259–275. https://doi.org/10.1016/j.apm.2019.02.019MathSciNetCrossRefMATH

53.

Dalle Mura M, Dini G (2019) Designing assembly lines with humans and collaborative robots: a genetic approach. CIRP Ann 68(1):1–4. https://doi.org/10.1016/j.cirp.2019.04.006CrossRef

54.

Yaphiar S, Nugraha C, Ma’ruf A (2020) Mixed model assembly line balancing for human-robot shared tasks. In: International manufacturing engineering conference & The Asia Pacific conference on manufacturing systems 2019, Singapore. iMEC-APCOMS 2019. Springer Singapore, pp 245–252

55.

Rabbani M, Behbahan SZB, Farrokhi-Asl H (2020) The Collaboration of human-robot in mixed-model four-sided assembly line balancing problem. J Intell Robot Syst 100(1):71–81. https://doi.org/10.1007/s10846-020-01177-1CrossRef

56.

Zhang B, Pan Q-k, Gao L, Zhang X-l, Peng K-k (2019) A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem. Soft Comput 23(17):8101–8129. https://doi.org/10.1007/s00500-018-3447-8CrossRef

57.

Faccio M, Gamberi M, Bortolini M (2016) Hierarchical approach for paced mixed-model assembly line balancing and sequencing with jolly operators. Int J Prod Res 54(3):761–777CrossRef

58.

Ciavotta M, Minella G, Ruiz R (2013) Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. Eur J Oper Res 227(2):301–313. https://doi.org/10.1016/j.ejor.2012.12.031MathSciNetCrossRef

59.

Salehi M, Maleki HR, Niroomand S (2020) Solving a new cost-oriented assembly line balancing problem by classical and hybrid meta-heuristic algorithms. Neural Comput Appl 32:8217–8243. https://doi.org/10.1007/s00521-019-04293-8CrossRef

60.

Li Z, Çil ZA, Mete S, Kucukkoc I (2019) A fast branch, bound and remember algorithm for disassembly line balancing problem. Int J Prod Res. https://doi.org/10.1080/00207543.2019.1630774CrossRef

Titel: Multi-objective migrating bird optimization algorithm for cost-oriented assembly line balancing problem with collaborative robots
verfasst von: Zixiang Li
Mukund Nilakantan Janardhanan
Qiuhua Tang
Publikationsdatum: 03.01.2021
Verlag: Springer London
Erschienen in: Neural Computing and Applications / Ausgabe 14/2021
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI: https://doi.org/10.1007/s00521-020-05610-2

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Weitere Artikel der Ausgabe 14/2021

Negative-ResNet: noisy ambulatory electrocardiogram signal classification scheme

Optimized ensemble of regression tree-based location of evolving faults in dual-circuit line

Coupling artificial neural networks with the artificial bee colony algorithm for global calibration of hydrological models

Enhanced coyote optimizer-based cascaded load frequency controllers in multi-area power systems with renewable

Short-term traffic flow prediction based on improved wavelet neural network

Incorporating Actor-Critic in Monte Carlo tree search for symbolic regression

Premium Partner