A Solution for Faster Implementation of Ant Colony Algorithm

Designing discrete transportation is to choose a possible subset of possible projects proposed in a transportation network to minimize the total travel time of network users. This problem exists in the complexity class of NPHard problems in which there is no effective algorithm for the exactsolution in a large scale. This article seeks to examine and use a metaheuristicalgorithm in the transportation discrete network design problem. In this article, tips are proposed for better implementation of ant colony algorithm. It seems that the implementation of the algorithm will be improved by observing the steps mentioned in the article of speed and time. Of course, judgment and general comparison of the behavior of the algorithm and the steps mentioned in this article depend on better running on a variety of network

Keywords:

Designing the transportation discrete network , ant colony algorithm