A modular algorithm for an extended vehicle scheduling problem

DOI10.1016/S0377-2217(82)80011-8zbMath0482.90041MaRDI QIDQ1162919

Ole M. Raft

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

stochastic demandsdistribution planningroute assignmentdelivery perioddepot assignmentextended vehicle schedulingheuristic solution techniqueroute designvehicle assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Experimentation in optimization ⋮ A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ A tabu search heuristic for the multi-depot vehicle routing problem ⋮ A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem ⋮ A multi-level composite heuristic for the multi-depot vehicle fleet mix problem

Cites Work

• Fast algorithms for bin packing
• A note on determining operating strategies for probabilistic vehicle routing
• A heuristic routine for solving large loading problems
• Printer graphics for clustering
• Implementing vehicle routing algorithms
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A modular algorithm for an extended vehicle scheduling problem