Open AccessSOLVING THE ROUTING PROBLEM BY ANT COLONY OPTIMIZATION ALGORITHMS
Author(s) -
Vladimir V. Zhikharevich,
Nataliia Matsiuk,
С. Е. Остапов
Publication year - 2016
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.15.2.841
Subject(s) - ant colony optimization algorithms , computer science , metaheuristic , vehicle routing problem , routing (electronic design automation) , task (project management) , process (computing) , mathematical optimization , ant colony , operations research , algorithm , computer network , mathematics , engineering , systems engineering , operating system
The use of ant colony optimization algorithms for solving the routing problem in a process of products delivery taking into account a city transport infrastructure has shown in this research. The vehicle routing problem belongs to NP-hard task and its solution requires significant computing resources. Therefore, it is recommended to use metaheuristic methods to solve such problems including ant colony optimization algorithms. Solution of the Vehicle Routing Problem will cause a decrease of enterprises non-productive resources consumption and will promote the increase of their efficiency and competitiveness. The test example, consisting of eight consumers of freight and two transportation means with unlimited load capacity, moving around the certain city, is used for the implementation of the model. It can be further refined by taking into account various parameters besides transport infrastructure, including limitations on carrying capacity, a number of vehicles an working hours, an amount of consumers’ orders and a time for loading and unloading, etc.