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...
Saved in:
| 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!
|
Similar Items
-
A Simulated Annealing for Heterogenous Fleet Vehicle Routing Problem with Multiple Trips and Pickup-Delivery
by: Firda Nur Rizkiani, et al.
Published: (2023-11-01) -
Research on Vehicle Path Planning Method with Time Windows in Uncertain Environments
by: Ying Cong, et al.
Published: (2024-12-01) -
Heuristic Algorithms for the Heterogeneous Vehicle Routing Problem With Time Windows, Customers Priority, Pickup and Delivery
by: Moayad Tanash, et al.
Published: (2025-01-01) -
A Combined Diffusion Model and Reinforcement Learning Approach for Solving the Vehicle Routing Problem With Multiple Soft Time Windows
by: Yu Qiao, et al.
Published: (2025-01-01) -
Fluctuations Driven by Multicomponent Pickup Ion Distributions in the Outer Heliosheath
by: Ameneh Mousavi, et al.
Published: (2025-01-01)