Abstract
The formulated problem is to find optimal traveler’s route in airline networks, which takes into account cost of the constructed route and user conditions with time-dependent cost of connections. Ant colony system algorithms are proposed to solve the time-dependent problem represented by an extended flight graph. Unlike the available ant algorithm implementations, the developed algorithms take into account the properties of dynamic networks (time-dependent availability and connection cost) and user conditions. The improved approach to the diversification of search in ant colony system algorithms in terms of time dependence for a dense graph increased the quality of the constructed routes from different regions. The proposed algorithms are analyzed for efficiency based on the analysis of the results of a computational experiment from real data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Foschini, J. Hershberger, and S. Suri, “On the complexity of time-dependent shortest paths,” Algorithmica, Vol. 68, No. 4, 1075–1097 (2014).
M. Dorigo and T. Stutzle, Ant Colony Optimization, MIT Press, Cambridge, MA (2004).
M. Dorigo and T. Stutzle, “Ant colony optimization: Overview and recent advances,” in: V. Gendreau and J.-Y. Potvin (eds.), Handbook of Metaheuristics, Springer, Cham (2019), pp. 311–351.
L. F. Hulianytskyi, “A new algorithm for ant colony optimization,” in: Modern Computer Science: Challenges, Achievements, and Development Prospects, Proc. Intern. Conf. devoted to the 60th Anniversary of V. M. Glushkov Institute of Cybernetics, NAS of Ukraine (Kyiv, December 13–15, 2017), Kyiv (2017), pp. 41–43.
E. He, N. Boland, G. Nemhauser, and M. Savelsbergh, “A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem,” in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Proc. of 15th Int. Conf. CPAIOR 2018 (Delft, The Netherlands, June 26–29, 2018), Delft (2018), pp. 289–297.
L. F. Hulianytskyi and A. I. Pavlenko, “Optimization of paths in a dynamic graph of flights by the modified ant colony algorithm,” Mathematical Modeling in Economy, No. 2, 26–39 (2018).
S. Thomas and M. Dorigo, “A short convergence proof for a class of ant colony optimization algorithms,” IEEE Trans. on Evolutionary Computation, Vol. 6, No. 4, 358–365 (2002).
L. F. Hulianytskyi and S. I. Sirenko, “Development and analysis of cooperative model-based metaheuristics,” Cybern. Syst. Analysis, Vol. 46, No. 5, 710–717 (2010).
L. F. Hulianytskyi and S. I. Sirenko, “Cooperative model-based metaheuristics,” Electronic Notes in Discrete Mathematics, Vol. 36, 33–40 (2010).
S. Yakovlev, O. Kartashov, and O. Yarovaya, “On class of genetic algorithms in optimization problems on combinatorial configurations,” in: Proc. IEEE 13th Intern. Sci. and Tech. Conf. on Computer Sciences and Information Technologies (CSIT 2018), Vol. 1 (2018), pp. 374–377. https://doi.org/10.1109/STC-CSIT.2018.8526746.
L. F. Hulianytskyi and I. I. Riasna, “Formalization and classification of combinatorial optimization problems,” in: S. Butenko, P. M. Pardalos, and V. Shylo (eds.), Optimization Methods and Applications, Springer International Publishing AG, Cham (2017), pp. 239–250.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2019, pp. 110–121.
Rights and permissions
About this article
Cite this article
Hulianytskyi, L., Pavlenko, A. Ant Colony Optimization Algorithms with Diversified Search in the Problem of Optimization of Airtravel Itinerary. Cybern Syst Anal 55, 978–987 (2019). https://doi.org/10.1007/s10559-019-00208-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-019-00208-6