The Vehicle Routing Problem is essential in logistics for optimizing customer routes, especially in timesensitive variants. This paper presents a two-stage algorithm for Vehicle Routing Problem with Time Windows. It effectively minimizes the number of vehicles, with transportation costs resulting just 0,38% above the best solution found on Solomon test instances. The approach limits search time to about 10 minutes, effectively balancing complexity and solution quality.
Optimizing vehicle routing and scheduling under time constraints
2024
Article (Journal)
Electronic Resource
Unknown
vehicle routing , scheduling , time windows , Business , HF5001-6182 , Finance , HG1-9999
Metadata by DOAJ is licensed under CC BY-SA 1.0
Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence
BASE | 2021
|Vehicle routing with time window constraints
TIBKAT | 1981
|British Library Online Contents | 2005
|Modelling Airline Network Routing and Scheduling under Airport Capacity Constraints
British Library Conference Proceedings | 2008
|