Abstract
This paper tackles a Restricted Dynamic Heterogeneous Fleet Vehicle Routing Problem with Time Windows as a real-world application of a courier service company in the Canary Islands, Spain. In this particular application of the Vehicle Routing Problem with Time Windows (VRPTW), customer requests can be either known at the beginning of the planning horizon or dynamically revealed over the day. Moreover, a heterogeneous fleet of vehicles has to be routed in real time. In addition, some other constraints required by the company, such as the allowance of extra hours for the vehicles, as well as, the use of several objective functions, are taken into account. This paper proposes a metaheuristic procedure to solve this particular problem. It has already been installed in the fleet management system of the company. The computational experiments indicate that the proposed method is both feasible to solve this real-world problem and competitive with the literature.
This work has been partially funded by the Spanish Ministry of Economy and Competitiveness (project TIN2012-32608) and the Spanish Ministry of Industry, Tourism and Trade (project TSI-020100-2011-298).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, Z.L., Xu, H.: Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science 40(1), 74–88 (2006)
De Armas, J., Melián-Batista, B., Moreno-Pérez, J.A., Brito, J.: Real-World Heterogeneous Fleet Vehicle Routing Problem with Soft Time Windows. Under review (2013)
Hong, L.: An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers & Operations Research 39(2), 151–163 (2012)
Khouadjia, M.R., Sarasola, B., Alba, E., Jourdan, L., Talbi, E.G.: A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing 12(4), 1426–1439 (2012)
Larsen, A.: The Dynamic Vehicle Routing Problem, PhD Thesis (2001)
Lund, K., Madsen, O.B.G., Rygaard, J.M.: Vehicle routing problems with varying degrees of dynamism. Technical Report. IMM Institute of Mathematical Modelling (1996)
Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization 10(4), 327–343 (2005)
Pillac, V., Gendreau, M., Gueret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European Journal of Operational Research 225(1), 1–11 (2013)
Psaraftis, H.N.: A Dynamic-programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14(2), 130–154 (1980)
Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant colony optimization for real-world vehicle routing problems. Swarm Intelligence 1, 135–151 (2007)
Solomon, M.M.: Algorithms for the Vehicle-Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2), 254–265 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Armas, J., Melián-Batista, B., Moreno-Pérez, J.A. (2013). Restricted Dynamic Heterogeneous Fleet Vehicle Routing Problem with Time Windows. In: Rojas, I., Joya, G., Cabestany, J. (eds) Advances in Computational Intelligence. IWANN 2013. Lecture Notes in Computer Science, vol 7903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38682-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-38682-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38681-7
Online ISBN: 978-3-642-38682-4
eBook Packages: Computer ScienceComputer Science (R0)