A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows

DOI10.1057/jors.1994.105zbMath0824.90115OpenAlexW2012412469MaRDI QIDQ4300227

J. Ben Atkinson

Publication date: 31 July 1994

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

Full work available at URL: https://doi.org/10.1057/jors.1994.105

zbMATH Keywords

greedy heuristiclook-ahead capabilityreal-life schedulingtight time-window constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Routing problems: A bibliography ⋮ Metaheuristics: A bibliography ⋮ An assignment-based heuristic for vehicle routing with time windows