دوره 3، شماره 4 - ( 7-1392 )                   جلد 3 شماره 4 صفحات 511-526 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
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. International Journal of Optimization in Civil Engineering. 2013; 3 (4) :511-526
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

URL: http://ijoce.iust.ac.ir/article-1-151-fa.html


چکیده:   (2939 مشاهده)
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.
متن کامل [PDF 2063 kb]   (2413 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: ۱۳۹۲/۷/۲۰ | پذیرش: ۱۳۹۲/۸/۲۸ | انتشار: ۱۳۹۲/۸/۲۸

کلیه حقوق این وب سایت متعلق به دانشگاه علم و صنعت ایران می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb