دوره 13، شماره 4 - ( 7-1402 )                   جلد 13 شماره 4 صفحات 531-519 | برگشت به فهرست نسخه ها

XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Sedighpour M, Yousefikhoshbakht M. A HYBRID IMPERIALIST COMPETITIVE ALGORITHM FOR THE BALANCED VEHICLE ROUTING PROBLEM. International Journal of Optimization in Civil Engineering 2023; 13 (4) :519-531
URL: http://ijoce.iust.ac.ir/article-1-569-fa.html
A HYBRID IMPERIALIST COMPETITIVE ALGORITHM FOR THE BALANCED VEHICLE ROUTING PROBLEM. عنوان نشریه. 1402; 13 (4) :519-531

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


چکیده:   (5396 مشاهده)
The balanced vehicle routing problem (BVRP) is one of the most famous research problems in operations, which has a very important position in combination optimization problems. In this problem, a fleet of vehicles with capacity Q starts moving from a node called the warehouse and returns to it after serving customers, provided that they visit each customer only once and never exceed the capacity Q. The goal is to minimize the paths traveled by vehicles provided that the distances traveled by the vehicles are the same as possible, for more justice in working time and income. This article presents the application of a hybrid imperialist competitive algorithm (HICA) to solve the problem. Unlike other optimization methods, this method is inspired by the socio-political process of societies and uses the competition between colonizing and colonized countries to reach the solution. To test the effectiveness of the algorithm, a set of standard examples are considered and the algorithm is implemented on it. The calculation results on these examples, which have a size of 50 to 200, show that the proposed algorithm has been able to compete well with well-known meta-heuristic algorithms in terms of the quality of the answers. In addition, the solutions close to the best answers obtained so far are generated for most of the examples.
متن کامل [PDF 703 kb]   (1502 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: 1402/5/27 | پذیرش: 1402/7/26 | انتشار: 1402/7/26

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

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

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

© 2024 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb