Improved Multi-Ant-colony algorithm for solving Multi-Objective Vehicle Routing Problems
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Classical vehicle routing problems (VRP) involves supply of goods/services from a central depot to geographically scattered customers. Besides the classical objective of minimizing the total travelled distance, the present work also considers simultaneous optimization of two additional objectives namely minimizing make span and minimizing distance imbalance. A mathematical model for this multi-objective version of VRP (MO-VRPTW) has been developed. A meta-heuristic based on multiple ant colony system for solving this MO-VRPTW has also been proposed. Firefly algorithm (FA) has also been applied to avoid local optima. Two new migration operators named Migration-I and Migration-II and multi-pheromone matrices have been developed to further improve the solution set. The proposed algorithm has been tested on a number of benchmark problems and its superiority over other state of art approaches and NSGA-II one of the commonly used method for multi-objective optimization problems is demonstrated.
Keywords:
Language:
English
Published:
Scientia Iranica, Volume:28 Issue: 6, Nov-Dec 2021
Pages:
3412 to 3428
magiran.com/p2375582
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!