Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets

This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each vehicle must visit some pick up nodes first, for instance, warehouses to pick up the orders then makes deliveries for customers in the list. Each pickup node has its own list of mor...

Full description

Saved in:
Bibliographic Details
Main Authors: Phan Nguyen Ky Phuc, Nguyen Le Phuong Thao
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Logistics
Subjects:
Online Access:https://www.mdpi.com/2305-6290/5/2/28
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849396916945682432
author Phan Nguyen Ky Phuc
Nguyen Le Phuong Thao
author_facet Phan Nguyen Ky Phuc
Nguyen Le Phuong Thao
author_sort Phan Nguyen Ky Phuc
collection DOAJ
description This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each vehicle must visit some pick up nodes first, for instance, warehouses to pick up the orders then makes deliveries for customers in the list. Each pickup node has its own list of more than one customers requiring delivery. The objective is to minimize the total travelling cost while real-world application constraints, such as heterogeneous vehicles, capacity limits, time window, driver working duration, etc. are still considered. This research firstly proposes a mathematical model for this multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets (MPMDVRPTWHF). In the next step, the ant colony optimization algorithm is studied to solve the problem in the large-scale.
format Article
id doaj-art-e7c38883f974448fb0b8fdd746b202cf
institution Kabale University
issn 2305-6290
language English
publishDate 2021-05-01
publisher MDPI AG
record_format Article
series Logistics
spelling doaj-art-e7c38883f974448fb0b8fdd746b202cf2025-08-20T03:39:11ZengMDPI AGLogistics2305-62902021-05-01522810.3390/logistics5020028Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous FleetsPhan Nguyen Ky Phuc0Nguyen Le Phuong Thao1Department of Industrial and Systems Engineering at International University, Ho Chi Minh City 700000, VietnamDepartment of Industrial and Systems Engineering at International University, Ho Chi Minh City 700000, VietnamThis study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each vehicle must visit some pick up nodes first, for instance, warehouses to pick up the orders then makes deliveries for customers in the list. Each pickup node has its own list of more than one customers requiring delivery. The objective is to minimize the total travelling cost while real-world application constraints, such as heterogeneous vehicles, capacity limits, time window, driver working duration, etc. are still considered. This research firstly proposes a mathematical model for this multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets (MPMDVRPTWHF). In the next step, the ant colony optimization algorithm is studied to solve the problem in the large-scale.https://www.mdpi.com/2305-6290/5/2/28VRP with time windowmultiple pickup and multiple deliveryant colony algorithmE-logistics
spellingShingle Phan Nguyen Ky Phuc
Nguyen Le Phuong Thao
Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
Logistics
VRP with time window
multiple pickup and multiple delivery
ant colony algorithm
E-logistics
title Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
title_full Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
title_fullStr Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
title_full_unstemmed Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
title_short Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
title_sort ant colony optimization for multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets
topic VRP with time window
multiple pickup and multiple delivery
ant colony algorithm
E-logistics
url https://www.mdpi.com/2305-6290/5/2/28
work_keys_str_mv AT phannguyenkyphuc antcolonyoptimizationformultiplepickupandmultipledeliveryvehicleroutingproblemwithtimewindowandheterogeneousfleets
AT nguyenlephuongthao antcolonyoptimizationformultiplepickupandmultipledeliveryvehicleroutingproblemwithtimewindowandheterogeneousfleets