Advertisement

Soft Computing

, Volume 22, Issue 18, pp 6025–6034 | Cite as

Solving permutation flow-shop scheduling problem by rhinoceros search algorithm

  • Suash Deb
  • Zhonghuan Tian
  • Simon Fong
  • Rui Tang
  • Raymond Wong
  • Nilanjan Dey
Focus
  • 229 Downloads

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.

Keywords

Rhinoceros search algorithm Elephant search algorithm Meta-heuristic Optimization problems 

Notes

Acknowledgements

The authors are grateful for financial support from the research Grants (1) ‘Nature-Inspired Computing and Metaheuristics Algorithms for Optimizing Data Mining Performance’ from the University of Macau (Grant No. MYRG2016-00069-FST); (2) ‘Temporal Data Stream Mining by Using Incrementally Optimized Very Fast Decision Forest (iOVFDF)’, which are offered by the University of Macau (Grant No. MYRG2015-00128-FST); and (3) ‘A Scalable Data Stream Mining Methodology: Stream-based Holistic Analytics and Reasoning in Parallel‘, from FDCT, Macau SAR government (Grant No. FDCT/126/2014/A3).

Compliance with ethical standards

Conflict of interest

All authors declare that they have no conflict of interest.

Human and Animal Rights

This article does not contain any studies with human participants or animals performed by any of the authors.

References

  1. Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138CrossRefGoogle Scholar
  2. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the \(n\) job, \(m\) machine sequencing problem. Manag Sci 16(10):B-630CrossRefzbMATHGoogle Scholar
  3. 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–2282CrossRefGoogle Scholar
  4. 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–255Google Scholar
  5. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129MathSciNetCrossRefzbMATHGoogle Scholar
  6. Iyer SK, Saxena B (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31(4):593–606MathSciNetCrossRefzbMATHGoogle Scholar
  7. Lee CY, Yao X (2004) Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans Evol Comput 8(1):1–13CrossRefGoogle Scholar
  8. 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–1463CrossRefGoogle Scholar
  9. Malakooti B (2013) Operations and production systems with multiple objectives. Wiley, LondonGoogle Scholar
  10. Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159–1173CrossRefzbMATHGoogle Scholar
  11. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. Omega 11(1):91–95CrossRefGoogle Scholar
  12. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160–175CrossRefzbMATHGoogle Scholar
  13. 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–107CrossRefGoogle Scholar
  14. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Ope Res 64(2):278–285CrossRefzbMATHGoogle Scholar
  15. 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–1947CrossRefzbMATHGoogle Scholar
  16. 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–4307CrossRefGoogle Scholar
  17. Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41(2):186–193CrossRefzbMATHGoogle Scholar
  18. Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801CrossRefzbMATHGoogle Scholar
  19. Zou F, Chen D, Lu R, Wang P (2016) Hierarchical multi-swarm cooperative teaching-learning-based optimization for global optimization. Soft Comput 21:1–22Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IT and Educational ConsultantRanchiIndia
  2. 2.Decision Sciences and Modelling ProgramVictoria UniversityMelbourneAustralia
  3. 3.Department of Computer and Information ScienceUniversity of MacauTaipaChina
  4. 4.School of Computer Science and EngineeringUniversity of New South WalesSydneyAustralia
  5. 5.Department of Information TechnologyTechno India College of TechnologyKolkataIndia

Personalised recommendations