Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows

DOI10.1057/palgrave.jors.2601534zbMath1088.90021OpenAlexW1968620789MaRDI QIDQ4678239

No author found.

Publication date: 23 May 2005

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

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

zbMATH Keywords

heuristicsdistributionmulti-depotsfull load

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items (3)

Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals

This page was built for publication: Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows