A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints

DOI10.1016/0377-2217(87)90139-1MaRDI QIDQ1089245zbMATH OpenOpenAlexFDO

Authors Giuseppe Paletta

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0377-2217(87)90139-1

zbMATH Keywords

heuristicpolynomial timepseudo-cyclicwindow constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Publication:4944279
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The delivery man problem with time windows
• A Heuristic for the Periodic Vehicle Routing Problem
• scientific article; zbMATH DE number 4170622

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Management of periodic demands in distribution systems
• On general routing problems
• Optimal distribution strategies with cyclic demands

Cited in

(2)

• scientific article; zbMATH DE number 7267210 (Why is no real title available?)
• A metaheuristic for the delivery man problem with time windows

This page was built for publication: A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089245)