Reoptimization Heuristic for the Capacitated Vehicle Routing Problem
The solution to a dynamic context of the Capacitated Vehicle Routing Problem (CVRP) is challenging. Routing and replenishment decisions are necessary by considering the assignment of customers to vehicles when the information is gradually revealed over horizon time. The procedure to solve this type...
Saved in:
| Main Authors: | Rodrigo Linfati, John Willmer Escobar |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2018/3743710 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Mcaaco: a multi-objective strategy heuristic search algorithm for solving capacitated vehicle routing problems
by: Yanling Chen, et al.
Published: (2025-03-01) -
Load-dependent vehicle routing problem with route time constraint: a heuristic approach
by: Nguyen Thuy Trang, et al.
Published: (2025-12-01) -
Advanced Phasmatodea Population Evolution Algorithm for Capacitated Vehicle Routing Problem
by: Jiawen Zhuang, et al.
Published: (2022-01-01) -
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem
by: Lamees Mohammad Dalbah, et al.
Published: (2022-09-01) -
An efficient hybrid framework with knowledge transfer for solving capacitated vehicle routing problems
by: Yanlin Wu, et al.
Published: (2025-06-01)