Abstract
This paper analyses the application of the Chaos driven Discrete Artificial Bee Algorithm to the flowshop with zero intermediate storage problem. Nine unique chaos maps are embedded in the Discrete Artificial Bee Algorithm alongside the Mersenne twister and evaluated on the Taillard problem sets for the total flowtime criterion. Based on the obtained results and statistical analysis, it is shown that a number of chaos driven algorithms significantly performed better than the Mersenne Twister variant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alatas, B., Akin, E., Ozer, A.: Chaos embedded particle swarm optimization algorithms. Chaos, Solitons and Fractals 40(4), 1715–1734 (2009)
Caponetto, R., Fortuna, L., Fazzino, S., Xibilia, M.: Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7(3), 289–304 (2003)
Chang, J.H., Chiu, H.N.: A comprehensive review of lot streaming. International Journal of Production Research 43(8), 1515–1536 (2005)
Davendra, D., Zelinka, I., Senkerik, R., Bialic-Davendra, M.: Chaos driven evolutionary algorithm for the traveling salesman problem. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications, pp. 55–70. InTech Publishing, Croatia (2010)
Davendra, D., Senkerik, R., Zelinka, I., Pluhacek, M., Bialic-Davendra, M.: Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time. Soft Computing (2014), doi:10.1007/s00500-014-1219-7
Davendra, D., Zelinka, I., Senkerik, R.: Chaos driven evolutionary algorithms for the task of pid control. Computers & Mathematics with Applications 60(4), 1088–1104 (2010)
Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research, 535–550 (2000)
Hall, N., Sriskandarayah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 510–525 (1996)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey (2005)
Karaboga, D., Akay, B.: A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214, 108–132 (2009)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. Journal of Global Optimization 39, 459–471 (2007)
Karaboga, D., Basturk, B.: On the performance of artificial bee colony (abc) algorithm. Applied Soft Computing 8, 687–697 (2008)
Li, J.Q., Pan, Q.K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Applied Mathematical Modelling (2013)
Lozi, R.: New enhanced chaotic number generators. Indian Journal of Industrial and Applied Mathematics 1(1), 1–23 (2008)
Lu, Y., Zhou, J., Qin, H., Wang, Y., Zhang, Y.: Chaotic differential evolution methods for dynamic economic dispatch with valve-point effects. Engineering Applications of Artificial Intelligence 24(2), 378–387 (2011)
Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transaction on Modeling and Computer Simulation 8(1), 3–30 (1998)
Ozer, A.B.: Cide: Chaotically initialized differential evolution. Expert Systems with Applications 37(6), 4632–4641 (2010)
Pan, Q.K., Tasgetiren, M.F., Suganthan, P., Chua, T.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences 181, 2455–2468 (2011)
Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice Hall, Inc., New Jersey (1995)
Pluhacek, M., Senkerik, R., Davendra, D., Kominkova Oplatkova, Z., Zelinka, I.: On the behavior and performance of chaos driven pso algorithm with inertia weight. Computers and Mathematics with Applications 66(2), 122–134 (2013)
Pluhacek, M., Senkerik, R., Zelinka, I., Davendra, D.: Chaos pso algorithm driven alternately by two different chaotic maps-an initial study, pp. 2444–2449 (2013)
Raaymakers, W., Hoogeveen, J.: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 131–151 (2000)
Rajendran, C.: A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 472–478 (1994)
Senkerik, R., Pluhacek, M., Davendra, D., Zelinka, I., Kominkova Oplatkova, Z.: Chaos driven evolutionary algorithm: A new approach for evolutionary optimization. International Journal of Mathematics and Computers in Simulation 7(4), 363–368 (2013)
Sprott, J.: Chaos and Time-Series Analysis. Oxford University Press, UK (2003)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operations Research 64, 278–285 (1993)
Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Chen, A.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences 181, 3459–3475 (2011)
Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Oner, A.: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling 37, 6758–6799 (2013)
Wang, L.: Shop Scheduling with Genetic Algorithms. Tsinghua Univ. Press, Beijing (2003)
Yuan, X., Cao, B., Yang, B., Yuan, Y.: Hydrothermal scheduling using chaotic hybrid differential evolution. Energy Conversion and Management 49(12), 3627–3633 (2008)
Zelinka, I., Chadli, M., Davendra, D., Senkerik, R., Pluhacek, M., Lampinen, J.: Do evolutionary algorithms indeed require random numbers? extended study. Advances in Intelligent Systems and Computing 210, 61–75 (2013)
Zuo, X., Fan, Y.: A chaos search immune algorithm with its application to neuro-fuzzy controller design. Chaos, Solitons and Fractals 30(1), 94–109 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Metlická, M., Davendra, D. (2014). Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm. In: Zelinka, I., Suganthan, P., Chen, G., Snasel, V., Abraham, A., Rössler, O. (eds) Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems. Advances in Intelligent Systems and Computing, vol 289. Springer, Cham. https://doi.org/10.1007/978-3-319-07401-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-07401-6_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07400-9
Online ISBN: 978-3-319-07401-6
eBook Packages: EngineeringEngineering (R0)