Abstract
The paper includes a proposal of a new algorithm for Computer Aided Design (CAD) of complex system with higher degree of dependability. Optimization: in scheduling of tasks, partitioning of resources, the allocation of task and resources are basic goals this algorithm. These optimization problems are NP-hard, but can be it solved efficiently e.g. by meta-heuristic algorithms. Presented the CAD algorithm based on Ant Colony Optimization may have a practical application in developing tools for rapid prototyping of such systems. The Ant Colony Optimization algorithm is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Drabowski, M.: Par-synthesis of multiprocessors parallel systems. Int. J. Comput. Sci. Netw. Secur. 8(10), 90–96 (2008)
Drabowski, M., Wantuch, E.: Deterministic schedule of task in multiprocessor computer systems with higher degree of dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Proceedings of the Ninth International Conference on Dependability and Complex Systems DepCos-RELCOMEX. Advances in Intelligent Systems and Computing, vol. 286, pp. 165–175. Springer (2014)
Drabowski, M.: Boltzmann tournaments in evolutionary algorithm for CAD of complex systems with higher degree of dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Tenth International Conference on Dependability and Complex Systems DepCos-RELCOMEX. Advances in Intelligent Systems and Computing, vol. 365, pp. 141–152. Springer (2015)
Drabowski, M.: Modification of neural network Tsang-Wang in algorithm for CAD of systems with higher degree of dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) 11th International Conference on Dependability and Complex Systems DepCos-RELCOMEX. Advances in Intelligent Systems and Computing, vol. 470, pp. 121–133. Springer (2016)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Błażewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. C-35(5), 389–393 (1986)
Dorigo, M., Di Caro, G., Gambardella, L.M.: An algorithms for discrete optimization. Artif. Life 5(2), 137–172 (1999)
Blum, C.: Beam-ACO – hybridizing ant colony optimization with bean search: an application to open shop scheduling. Comput. Oper. Res. 32, 1565–1591 (2005)
Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. J. Math. Model. Algorithm 3, 285–308 (2004)
Montgomery, J., Fayad, C., Petrovic, S.: Solution representation for job shop scheduling problems in ant colony optimization. LNCS 4150, 484–491 (2006)
http://www.kasahara.elec.waseda.ac.jp/schedule/stgarc_e.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Drabowski, M. (2018). Adaptation of Ant Colony Algorithm for CAD of Complex Systems with Higher Degree of Dependability. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Advances in Dependability Engineering of Complex Systems. DepCoS-RELCOMEX 2017. Advances in Intelligent Systems and Computing, vol 582. Springer, Cham. https://doi.org/10.1007/978-3-319-59415-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-59415-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59414-9
Online ISBN: 978-3-319-59415-6
eBook Packages: EngineeringEngineering (R0)