Abstract
For Job-Shop schedule problem‘s unique characteristic, we proposed a method whose encode method is based on the ranking job number named GA-ACO(Genetic Algorithm – Ant Colony Optimization algorithm) to solve this problem. The algorithm attempts to integrate the two algorithms dynamically to solve Job-Shop schedule problem. The dynamic fusion idea of the two algorithms is: before the best point (the genetic algorithm and ant colony integration point), use the characteristics of the genetic algorithm, quickly and comprehensively generate excellent chromosomes, from which select the part of the most outstanding and convert them to initial chromosome distribution for ant colony optimization algorithem, after the best fusion point use ant colony algorithm’s positive feedback, efficiently to obtain the optimal solution of shop schedule problems[1].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jiang, H.: Hybrid ant colony algorithm and its application in the shop scheduling problem. Wuhan University of Technology, Wuhan (2007)
Akyol, D.E., Mirac Bayhan, G.: A review on evolution of production schedule with neural networks. Computers and Industrial Engineering 53(1), 95–122 (2007)
Zhang, C.Y., Li, P., Guan, Z., et al.: A tabu search algorithm with a new neighborhood structure for the job shop schedule problem. Computers and Operations Research (2007)
Zhang, L., Wu, Z., Wang, K., Wang, W.: Application of Improved Ant Colony Algorithm to JSP. College of Mechanical & Material Engineering, China Three Gorges Univ. (Natuural Sciences), Yichang 443002, China, 4 (2009)
Huang, R.-H., Yang, C.-L.: Ant colony system for job shop schedule with time windows [J]. The International Journal of Advanced Manufacturing Technology 9, 2010–2018 (2007)
Duan, H.: Ant colony algorithm and its application, vol. 12. Science Press, Beijing (2005) ISBN 7-03-016204-8
Pan, H., Jiang, H., Zhang, C.: Improved Ant Genetic Algorithm and Application. Software Guide 12 (2006)
Fan, D., Zhen, L.: Mixed shop schedule problem of multi-chromosome genetic algorithm. Computer Simulation 23(2), 157–160 (2006)
Jin, F., Song, S., Wu, C.: Based on genetic algorithm NDP JSP application [J]. Tsinghua University (Natural Science) 46(4), 488–491 (2006)
A genetic algorithm for the Flexible Job-shop Schedule Problem. Computers & OperationsResearch 35, 3202–3204 (2008)
Wang, L.: Shop scheduling and genetic algorithms [M]. Tsinghua University Press, Beijing (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, M., Wu, T., Liang, X. (2010). GA-ACO in Job-Shop Schedule Problem Research. In: Cai, Z., Tong, H., Kang, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2010. Communications in Computer and Information Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16388-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-16388-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16387-6
Online ISBN: 978-3-642-16388-3
eBook Packages: Computer ScienceComputer Science (R0)