S O L V I N G R O U T I N G P R O B L E M W I T H H E T E R O G E N E O U S F L E E T B Y M U L T I-O B J E C T I V E P A R T I C L E S W A R M O P T I M I Z A T I O N
Author(s):
Abstract:
In vehicle routing problem (VRP), the objective is to find the optimum routes for a fleet of vehicles in order to serve a set of customers. These routes should have minimum costs including distance and time, and they should simultaneously satisfy some restrictions such as the maximum capacity of each vehicle, the maximum distance for each vehicle to travel, the time window to visit the specific customer, and so forth. Most enterprises own a heterogeneous fleet of vehicles or hire different types of vehicles to serve their customers. The heterogeneous fleet VRP (HFVRP) addresses the VRP with a heterogeneous fleet of vehicles which have various capacities: fixed costs and variable costs. To the best of our knowledge, all researches in this field have studied the minimization of total traveling time and traveling cost as objectives, while one of the important subjects in the real word is tardiness. In studying tardiness, we assign a due time as an upper bound; if the vehicle reaches the customer after the due time, tardiness will occur. The other important object in HFVRP is the holding cost. In order to have a balance between holding cost and traveling time, we have considered holding cost to solve the problem when a vehicle is selected. So, in this research, we will solve a bi-objective HFVRP with respect to minimizing total traveling time, tardiness, and total holding cost as an objective function. Many algorithms have developed to solve vehicle routing problems, such as genetic algorithm, ant colony optimization, and simulated annealing. For small problem with three vehicles, problem is solved through GAMS and validity of model is proved. For the large-sized problem, because of the complexity, problem is solved with Multi-Objective particle swarm optimization, and then numerical result is presented in the research. The results show that by changing the value of holding cost, the fleet and routes will be changed, and MOPSO finds good answers in short time.
Keywords:
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:32 Issue: 2, 2017
Pages:
3 to 10
magiran.com/p1700302
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!