Title of article
AN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Author/Authors
Afandizadeh Zargari, S. iran university of science and technology - Civil Engineering Department, تهران, ايران , Arman, M.A. iran university of science and technology - Civil Engineering Department, تهران, ايران , Kalantari, N. iran university of science and technology - Civil Engineering Department, تهران, ايران
From page
511
To page
526
Abstract
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been proposed to solve the Time Dependent Network Design Problem (T-NDP). The proposed algorithm has been used to solve different networks: A small size, a medium size and a large scale network. The results show that the proposed model has superior performance compared to the previous method proposed for solving the T-NDP.
Keywords
Time Dependent Network Design , Ant Colony System , Mashhad , Semnan
Journal title
International Journal of Optimization in Civil Engineering
Journal title
International Journal of Optimization in Civil Engineering
Record number
2566590
Link To Document