Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching
Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an extension of the traditional VRPTW by considering dynamic customer characteristics. In this problem, new customers with specific time windows are received dynamically as time progresses and must be incorporated into the evolving schedu...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2024-03-01
|
Series: | Egyptian Informatics Journal |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1110866523000774 |