Skip to main content
Top
Published in: Soft Computing 18/2018

26-02-2018 | Focus

Solving permutation flow-shop scheduling problem by rhinoceros search algorithm

Published in: Soft Computing | Issue 18/2018

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, a novel meta-heuristic search algorithm inspired by rhinoceros’ natural behaviour is proposed, namely rhinoceros search algorithm (RSA). Similar to our earlier version called elephant search algorithm, RSA simplifies certain habitual characteristics of rhinoceros and stream-lines the search operations, thereby reducing the number of operational parameters required to configure the model. Via computer simulation, it is shown that RSA is able to outperform certain classical meta-heuristic algorithms. Different dimensions of optimization problems are tested, and good results are observed by RSA. The RSA is also implemented on permutation flow-shop scheduling problem (PFSP) with some representation method. Four different problem scales are used. Compared with partible swarm optimization (PSO) on PFSP, the RSA outperforms PSO on different problem scales with a 3% improvement.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

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!

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!

Literature
go back to reference Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138CrossRef Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138CrossRef
go back to reference Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the \(n\) job, \(m\) machine sequencing problem. Manag Sci 16(10):B-630CrossRefMATH Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the \(n\) job, \(m\) machine sequencing problem. Manag Sci 16(10):B-630CrossRefMATH
go back to reference Chen C-L, Huang S-Y, Tzeng Y-R, Chen C-L (2014) Revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18(11):2271–2282CrossRef Chen C-L, Huang S-Y, Tzeng Y-R, Chen C-L (2014) Revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem. Soft Comput 18(11):2271–2282CrossRef
go back to reference Deb S, Fong S, Tian Z (2015) Elephant search algorithm for optimization problems. In: 2015 10th international conference on digital information management (ICDIM). IEEE, pp 249–255 Deb S, Fong S, Tian Z (2015) Elephant search algorithm for optimization problems. In: 2015 10th international conference on digital information management (ICDIM). IEEE, pp 249–255
go back to reference Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593–606MathSciNetCrossRefMATH Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593–606MathSciNetCrossRefMATH
go back to reference Lee CY, Yao X (2004) Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans Evol Comput 8(1):1–13CrossRef Lee CY, Yao X (2004) Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans Evol Comput 8(1):1–13CrossRef
go back to reference Liu Y-F, Liu S-Y (2013) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput 13(3):1459–1463CrossRef Liu Y-F, Liu S-Y (2013) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput 13(3):1459–1463CrossRef
go back to reference Malakooti B (2013) Operations and production systems with multiple objectives. Wiley, London Malakooti B (2013) Operations and production systems with multiple objectives. Wiley, London
go back to reference Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159–1173CrossRefMATH Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159–1173CrossRefMATH
go back to reference Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. Omega 11(1):91–95CrossRef Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. Omega 11(1):91–95CrossRef
go back to reference Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160–175CrossRefMATH Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160–175CrossRefMATH
go back to reference Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. J Oper Res Soc 16(1):101–107CrossRef Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. J Oper Res Soc 16(1):101–107CrossRef
go back to reference Tasgetiren MF et al (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930–1947CrossRefMATH Tasgetiren MF et al (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930–1947CrossRefMATH
go back to reference Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307CrossRef Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307CrossRef
go back to reference Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41(2):186–193CrossRefMATH Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41(2):186–193CrossRefMATH
go back to reference Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801CrossRefMATH Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801CrossRefMATH
go back to reference Zou F, Chen D, Lu R, Wang P (2016) Hierarchical multi-swarm cooperative teaching-learning-based optimization for global optimization. Soft Comput 21:1–22 Zou F, Chen D, Lu R, Wang P (2016) Hierarchical multi-swarm cooperative teaching-learning-based optimization for global optimization. Soft Comput 21:1–22
Metadata
Title
Solving permutation flow-shop scheduling problem by rhinoceros search algorithm
Publication date
26-02-2018
Published in
Soft Computing / Issue 18/2018
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-018-3075-3

Other articles of this Issue 18/2018

Soft Computing 18/2018 Go to the issue

Premium Partner