Volume 3, Issue 4 (10-2013)
IJOCE 2013, 3(4): 511-526 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Afandizadeh S, Arman M A, Kalantari N. AN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM. IJOCE 2013; 3 (4) :511-526
URL: http://ijoce.iust.ac.ir/article-1-151-en.html
URL: http://ijoce.iust.ac.ir/article-1-151-en.html
Abstract: (17475 Views)
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.
Type of Study: Research |
Subject:
Optimal design
Received: 2013/10/12 | Accepted: 2013/11/19 | Published: 2013/11/19
Received: 2013/10/12 | Accepted: 2013/11/19 | Published: 2013/11/19
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
