Abstract
Solving large-scale vehicle routing problems with complex additional constraints such as the problem of combined vehicle routing and break scheduling is very difficult. Even large-scale vehicle routing problems with time windows without additional constraints can only be solved to optimality for problems with tight time windows and a structure which allows only few possible solutions (Pisinger and Ropke, 2007). Therefore, heuristics and metaheuristics are mainly applied to solve these problems (Funke et al., 2005). In the following the restricted dynamic programming (DP) heuristic developed by Kok et al. (2010) is presented and utilized for solving the problem of combined vehicle routing and break scheduling both from a centralized and from a distributed decision making perspective.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Gabler Verlag | Springer Fachmedien Wiesbaden GmbH
About this chapter
Cite this chapter
Meyer, C.M. (2011). Restricted Dynamic Programming Heuristic for the Problem of Combined Vehicle Routing and Break Scheduling. In: Vehicle Routing under Consideration of Driving and Working Hours. Gabler. https://doi.org/10.1007/978-3-8349-6732-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-8349-6732-9_6
Publisher Name: Gabler
Print ISBN: 978-3-8349-2942-6
Online ISBN: 978-3-8349-6732-9
eBook Packages: Business and EconomicsBusiness and Management (R0)