An Effective Ant Colony Optimization for Solving the Capacitated Vehicle Routing Problem
Publish Year: 1388
نوع سند: مقاله کنفرانسی
زبان: English
View: 242
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS03_267
تاریخ نمایه سازی: 17 آبان 1396
Abstract:
The Vehicle Routing Problem (VRP) is one of the most important combinational optimization problems that nowadays, it has been received much attention by researchers and scientists. In this Problem, the objective is to define minimized distance traveled of the multiple vehicle routing problem that start to move simultaneously from depot and return to the depot after visiting customers, if firstly, each node is visited by only one vehicle and secondly, each vehicle does not load during the route morethan its capacity.In this paper, aimed at the disadvantages existed in the current Ant Colony System (ACS) algorithms, a modification to pheromone evaluation model of ACS is proposed. This trigonometric function can avoid premature convergence of ACS and exploits more strong solutions. Comparison between this method and famous meta-heuristic algorithms shows the effectiveness of the proposed approach
Keywords:
Authors
A. Zafari
Payame Noor University (PNU)
M. Y Khoshbakht
Amirkabir Univ. Tech. - Department of Applied Mathematics
M. Sedighpour
Islamic Azad University, Hamedan Branch -