An Effective Algorithm for Vehicle Routing Problem by Indicating Capacity Base SA algorithm with greedy approach
عنوان مقاله: An Effective Algorithm for Vehicle Routing Problem by Indicating Capacity Base SA algorithm with greedy approach
شناسه ملی مقاله: ICMEAC05_085
منتشر شده در پنجمین کنفرانس بین المللی تحقیقات نوین پژوهشی در مهندسی و تکنولوژی در سال 1396
شناسه ملی مقاله: ICMEAC05_085
منتشر شده در پنجمین کنفرانس بین المللی تحقیقات نوین پژوهشی در مهندسی و تکنولوژی در سال 1396
مشخصات نویسندگان مقاله:
Mohammad Saraeian - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Arak Branch, Markazi, Iran
Seyed Ali Ghaheri - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Malayer Branch, Malayer ,Iran
Parvaneh Mansouri - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Arak Branch, Markazi, Iran
خلاصه مقاله:
Mohammad Saraeian - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Arak Branch, Markazi, Iran
Seyed Ali Ghaheri - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Malayer Branch, Malayer ,Iran
Parvaneh Mansouri - Department of Computer Engineering, Faculty of Engineering, Islamic Azad University, Arak Branch, Markazi, Iran
One of the most important issues in recent decades that have many applications to increase efficiency and productivity of transportation systems is vehicle routing problem (VRP).This problem is NP-Hard type and combinatorial optimization problems and operation researchers have put a lot of attention on it. One issue of the Vehicle Routing Problem is finding a route that the vehicle starts from a point then met certain points with constant coordinates and finally returns to the starting point. In this article, we used the Simulated Annealing algorithm then used mutation Effective like local search with the greedy approach to ensure the variety of algorithm answer and avoid falling into a local minimum and early convergence. The results compared with Particle Swarm Optimization(PSO), Genetic(GA) and Bat algorithms for a standard samples. The results of experimental simulation indicated that the proposed algorithm is better than the compared algorithms for this problem.
کلمات کلیدی: CVRP, Vehicle routing, Optimization, Bat algorithm, Genetic algorithm
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/749650/