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 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) -
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) -
Kinetic Simulation of Magnetic Reconnection with Pickup Ions: Shell Stability and Reconnection Rate Analysis
by: P. S. Pyakurel, et al.
Published: (2025-01-01) -
Spectral Evolution of Pickup Ions across Interplanetary Shocks in the Outer Heliosphere: Observational Constraints and Transport Simulations
by: Weining Wang, et al.
Published: (2025-01-01) -
Ants : their structure, development and behavior /
by: Wheeler, William Morton, 1865-1937
Published: (1910)