Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case

DOI10.1080/01966324.1993.10737359zbMath0808.90062OpenAlexW2065063922WikidataQ58117181 ScholiaQ58117181MaRDI QIDQ4305483

Gregor Grabenbauer, Ulrich Derigs

Publication date: 13 September 1994

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1993.10737359

zbMATH Keywords

vehicle routingtime window constraintsexchange heuristics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (2)

Routing problems: A bibliography ⋮ Practical aspects of route planning for magazine and newspaper wholesalers

Cites Work

• Unnamed Item
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case