A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4047422
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- scientific article; zbMATH DE number 3941254
Cited in
(11)- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Use of the BATA algorithm and MIS to solve the mail carrier problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- A threshold accepting approach to the Open Vehicle Routing problem
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
This page was built for publication: A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765546)
