Abstract
An ant colony optimization algorithm that accounts for the special requirements of Flexible Manufacturing Systems (FMS) is presented in this paper. The scheduling problem of FMS is conceived as a classical job shop scheduling problem (JSSP). The objective is to minimize the time taken for all jobs to finish execution (i.e. the makespan). The proposed algorithm accounts for the dynamicity of the FMS environment and automates the schedule update by incorporating newly arrived jobs to the existing schedule. The Ant Colony algorithm is applied to solve different discrete optimization problems by artificial ants, using indirect communication to make all routing decisions by reacting to their dynamically changing environment through cooperation between ants and updating their pheromone trails. The effectiveness of the algorithm proposed in this paper is investigated by examining numerical results, and the computational experiments have been executed based on the JSSP data benchmarks.
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 subscriptionsReferences
Dorigo, M., Maniesso, V., Colorni, A.: Distributed Optimization by ant colonies. In: Proceedings of ECAL91—European Conference on Artificial Life- Elsevier, Paris, France, pp. 134–142 (1991)
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolut Comput 1(1), 53–66 (1997)
Sycara, K., Roth, S., Sadeh, N., Fox, M.: Distributed constrained heuristic search. IEEE Trans. Syst. Man Cybern. 21(6), 1446–1461 (1991)
Lawrynowicz, A.: Integration of production planning and scheduling using an export system and a genetic algorithm. J. Oper. Res. Soc. 59(4), 455–463 (2008)
Badr, I.: An agent-based scheduling framework for flexible manufacturing systems. World Acad. Sci. Eng. Technol. Int. J. Mech. Aerosp. Ind. Mechatron. Manuf. Eng. 2(4), (2008)
Chen, J.C., Wu, C.-C., Chen, C.-W., Chen, K.-H.: Flexible Job Shop Scheduling with Parallel Machines Using Genetic Algorithm and Grouping Genetic Algorithm. Elsevier Ltd, Amsterdam (2012)
Muthiah, A., Rajkumar, R., Rajkumar, A.: Hybridization of artificial bee colony algorithm with particle swarm optimization algorithm for flexible job shop scheduling. In: Proceedings of 2016 International Conference on Energy Efficient Technologies for Sustainability (ICEETS). IEEE Xplore Digital Library (2016). https://doi.org/10.1109/iceets.2016.7583875
Nouri, H.E., Driss, O.B., Ghédira, K.: A classification schema for the job shop scheduling problem with transportation resources: state-of-the-art review. In: Artificial Intelligence Perspectives in Intelligent Systems, Advances in Intelligent Systems and Computing, vol. 464. Springer, Switzerland (2016). https://doi.org/10.1007/978-3-319-33625-1_11
Nouri, H.E., Driss, O.B., Ghédira, K.: Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multi-agent model. Comput. Ind. Eng. 102, 488–501 (2016)
Sahin, C., Demirtas, M., Erol, R., Baykasoğlu, A., Kaplanoğlu, V.: A multi-agent based approach to dynamic scheduling with flexible processing capabilities. J. Intell. Manuf., pp. 1–19 (2015)
Nakandhrakumar, R.S., Seralathan, S., Azarudeen, A., Narendran, V.: Optimization of job shop scheduling problem using tabu search optimization technique. Int. J. Innov. Res. Sci. Eng. Technol. 3(3), 1241–1244 (2014)
Gao, K.Z., Suganthan, P.N., Chua, T.J., Chong, C.S., Cai, T.X., Pan, Q.K.: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21), 7652–7663 (2015)
Kamal, A., Badr, I., Darwish, A.: A study on job scheduling problem for flexible manufacturing system based on ant colony system. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 5(10), 6–14 (2015)
Aryo, D.: ACO-Dynamic-JSSP, github.com. https://github.com/dimasaryo/ACO (2011)
Behnke, D., Geiger, M.J.: Test instances for the flexible job shop scheduling problem with work centers. Helmut-Schmidt-Universität der Bundeswehr Hamburg, Lehrstuhl für Betriebswirtschaftslehre, Insbes (2012)
Lawrence, S.: Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh PA (1984)
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149–156 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kamal, A., Badr, I., Darwish, A. (2019). Cooperative Ant Colony Algorithm for Flexible Manufacturing Systems. In: Borangiu, T., Trentesaux, D., Thomas, A., Cavalieri, S. (eds) Service Orientation in Holonic and Multi-Agent Manufacturing. SOHOMA 2018. Studies in Computational Intelligence, vol 803. Springer, Cham. https://doi.org/10.1007/978-3-030-03003-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-03003-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03002-5
Online ISBN: 978-3-030-03003-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)