Abstract
This paper proposes a self-adaptive hybrid population-based incremental learning algorithm (SHPBIL) for the m-machine reentrant permutation flow-shop scheduling problem (MRPFSSP) with makespan criterion. At the initial phase of SHPBIL, the information entropy (IE) of the initial population and an Interchange-based search are utilized to guarantee a good distribution of the initial population in the solution space, and a training strategy is designed to help the probability matrix to accumulate information from the initial population. In SHPBIL’s global exploration, the IE of the probability matrix at each generation is used to evaluate the evolutionary degree, and then the learning rate is adaptively adjusted according to the current value of IE, which is helpful in guiding the search to more promising regions. Moreover, a mutation mechanism for the probability model is developed to drive the search to quite different regions. In addition, to enhance the local exploitation ability of SHPBIL, a local search based on critical path is presented to execute the search in some narrow and promising search regions. Simulation experiments and comparisons demonstrate the effectiveness of the proposed SHPBIL.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Choi, S.W., Kim, Y.D.: Minimizing Makespan on an M-machine Re-entrant Flowshop. Computers & Operations Research 35(5), 1684–1696 (2008)
Choi, S.W., Kim, Y.D.: Minimizing Makespan on a Two-machine Re-entrant Flowshop. In: Proceedings of the Fifth Asia Pacific Industrial Engineering and Management Systems Conference, vol. 31(19), pp. 1–10 (2004)
Chen, J.S., Pan, J.C.H., Lin, C.M.: A Hybrid Genetic Algorithm for the Re-entrant Flow-shop Scheduling Problem. Expert Systems with Applications 34(1), 570–577 (2008)
Chen, J.S., Pan, J.C.H., Lin, C.M.: Solving the Reentrant Permutation Flow-shop Scheduling Problem with a Hybrid Genetic Algorithm. International Journal of Industrial Engineering 16(1), 23–31 (2009)
Baluja, S.: Population-based Incremental Learning: a Method for Integrating Genetic Search based Function Optimization and Competitive Learning. Technical Report CMU-CS-94-193. Carnegie Mellon University, Pittsburgh (1994)
Salhi, A., Rodriguez, J.A.V., Zhang, Q.F.: An Estimation of Distribution Algorithm with Guided Mutation for a Complex Flow Shop Scheduling Problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, London, UK, pp. 570–576 (2007)
Wang, S., Wang, L., Zhou, G., Xu, Y.: An Estimation of Distribution Algorithm for the Flexible Job-shop Scheduling Problem. In: Huang, D.-S., Gan, Y., Gupta, P., Gromiha, M.M. (eds.) ICIC 2011. LNCS (LNAI), vol. 6839, pp. 9–16. Springer, Heidelberg (2012)
Pang, H., Hu, K., Hong, Z.: Adaptive PBIL Algorithm and Its Application to Solve Scheduling Problems. In: Proceedings of the 2006 IEEE Conference on Computer Aided Control Systems Design, Munich, Germany, pp. 784–789 (2006)
Hong, S.K.: Shape Optimization of Electromagnetic Devices Using Immune Algorithm. IEEE Transactions on Magnetics 33(2), 1876–1879 (1997)
Baluja, S., Caruana, R.: Removing the Genetics From the Standard Genetic Algorithm. In: Proceeding of the International Conference on Machine Learning, Lake Tahoe, CA, pp. 38–46 (1995)
Grabowski, J., Wodecki, M.: A very Fast Tabu Search Algorithm for the Permutation Flow Shop Problem with Makespan Criterion. Computers & Operations Research 31(11), 1891–1909 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, ZC., Qian, B., Hu, R., Zhang, CS., Li, K. (2013). A Self-adaptive Hybrid Population-Based Incremental Learning Algorithm for M-Machine Reentrant Permutation Flow-Shop Scheduling. In: Huang, DS., Bevilacqua, V., Figueroa, J.C., Premaratne, P. (eds) Intelligent Computing Theories. ICIC 2013. Lecture Notes in Computer Science, vol 7995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39479-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39479-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39478-2
Online ISBN: 978-3-642-39479-9
eBook Packages: Computer ScienceComputer Science (R0)