دوره 3، شماره 4 - ( 7-1392 )
جلد 3 شماره 4 صفحات 526-511 |
برگشت به فهرست نسخه ها
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-fa.html
URL: http://ijoce.iust.ac.ir/article-1-151-fa.html
AN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM. عنوان نشریه. 1392; 3 (4) :511-526
چکیده: (17474 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Optimal design
دریافت: 1392/7/20 | پذیرش: 1392/8/28 | انتشار: 1392/8/28
دریافت: 1392/7/20 | پذیرش: 1392/8/28 | انتشار: 1392/8/28
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
