AN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 39
فایل این مقاله در 17 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJOCE-3-4_001
تاریخ نمایه سازی: 5 آذر 1402
چکیده مقاله:
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.
کلیدواژه ها:
نویسندگان