A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
From MaRDI portal
Publication:3765546
DOI10.2307/2582324zbMath0628.90037OpenAlexW4254789469MaRDI QIDQ3765546
Publication date: 1987
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2582324
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
Use of the BATA algorithm and MIS to solve the mail carrier problem ⋮ A guided tabu search for the vehicle routing problem with two-dimensional loading constraints ⋮ A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ 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. ⋮ A threshold accepting approach to the Open Vehicle Routing problem ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
