Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows

DOI10.1007/978-3-319-55702-1_18MaRDI QIDQ4596452zbMATH OpenOpenAlexFDO

Authors Philipp Hungerländer, Kerstin Maier, Jörg Pöcher, Andrea Rendl, Christian Truden

Publication date 1 December 2017

Published in Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55702-1_18

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Recommendations

• An optimization algorithm for a capacitated vehicle routing problem with time windows
• Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
• A way to optimally solve a time-dependent vehicle routing problem with time windows
• A GRASP for the Vehicle Routing Problem with Time Windows
• scientific article; zbMATH DE number 4047423
• scientific article; zbMATH DE number 5944664
• The vehicle routing problem with time windows and temporal dependencies
• Formulations and exact algorithms for the vehicle routing problem with time windows
• On the capacitated vehicle routing problem

Cited in

(1)

• Optimization algorithm for the time-dependent vehicle routing problem with softtime windows: a research based on mixed integer model and mixed tabu search

This page was built for publication: Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows

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