@inproceedings{2b14f7dfbcd14755b63ebe7e089c8e43,
title = "An improved ant colony algorithm for the shortest path problem in time-dependent networks",
abstract = "Research of the shortest path problem in time-dependent networks has important practical value. An improved pheromone update strategy is demonstrated here. Using this strategy, the residual pheromone of each path can accurately reflect the change of weighted value for each path. An improved ant colony algorithm for the shortest path problem in time-dependent networks based on our improved strategy is also presented here. The results of this experiment show that the improved algorithm has a greater probability to achieve an optimal solution, and the convergence rate of the algorithm is greater than that of a traditional ant colony algorithm.",
author = "Gao Hui and Liu Yongqiang and Chang Qing and Xiong Huagang",
year = "2009",
doi = "10.1061/41064(358)246",
language = "英语",
isbn = "9780784410646",
series = "Proceedings of the 9th International Conference of Chinese Transportation Professionals, ICCTP 2009: Critical Issues in Transportation System Planning, Development, and Management",
publisher = "ASCE - American Society of Civil Engineers",
pages = "1748--1754",
booktitle = "Proceedings of the 9th International Conference of Chinese Transportation Professionals, ICCTP 2009",
note = "9th International Conference of Chinese Transportation Professionals, ICCTP 2009: Critical Issues in Transportation System Planning, Development, and Management ; Conference date: 05-08-2009 Through 09-08-2009",
}