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.

نوع مطالعه: پژوهشي |
موضوع مقاله:
Optimal design

دریافت: 1402/5/27 | پذیرش: 1402/7/26 | انتشار: 1402/7/26

دریافت: 1402/5/27 | پذیرش: 1402/7/26 | انتشار: 1402/7/26

بازنشر اطلاعات | |

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