Abstract
The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.
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
References
Coelho, L.C., Laporte, G.: The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2), 558–565 (2013)
Baita, F., Ukovich, W., Pesenti, R., Favaretto, D.: Dynamic routing-and-inventory problems: a review. Transp. Res. Part A Policy Pract. 32(8), 585–598 (1998)
Federgruen, A., Zipkin, P.: A combined vehicle routing and inventory allocation problem. Oper. Res. 32, 1019–1037 (1984)
Archetti, C., Bianchessi, N., Irnich, S., Speranza, M.G.: Working papers department of economics and management formulations for an inventory routing problem (2013)
Eliseo Pérez Kaligari, W.J.G.R.: Optimization methods for the inventory routing problem, pp. 31–49 (2015)
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)
Lou, S.Z., Wu, Y.H., Xiao, J.W.: Study on integrated inventory-routing problems. In: Proceedings of the 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, vol. 1, no. 1, pp. 42–46 (2009)
Raa, B.: Cyclic versus reactive planning for inventory routing. Procedia - Soc. Behav. Sci. 111, 909–917 (2014)
Nekooghadirli, N., Tavakkoli Moghaddam, R., Ghezavati, V.R., Javanmard, S.: Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics. Comput. Ind. Eng. 76, 204–221 (2014)
Núñez, A., Sáez, D., Cortés, C.E.: Problema de ruteo dinamico de una flota de vehiculos con un enfoque de control predictivo hibrido basado en algoritmos geneticos, p. 13 (2005)
Day, J.M., Wright, P.D., Schoenherr, T., Munirpallam, V., Gaudette, K.: Improving routing and scheduling decisions at a distributor of industrial gasses.PDF. Science Direct, p. 11 (2006)
A.P.L.U., Lerena, V., Alejandro, L.U., Dra, D., Loiseau, I.: Sistema de optimización para el ruteo dinámico de vehículos con ventanas de tiempo’ Resumen (2007)
Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2), 509–515 (2009)
Yu, Y., Chu, C., Chen, H., Chu, F.: Large scale stochastic inventory routing problems with split delivery and service level constraints. Ann. Oper. Res. 197, 135–158 (2012)
Perez, E.: Ruteo de inventarios con ventanas de tiempo fuertes, pp. 1–53 (2015)
Kulkarni, V.G.: Introduction to modeling and analysis of stochastic systems (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Morales, F., Franco, C., Mendez-Giraldo, G.A. (2017). Success Probability Applied to Inventory Routing Problem with Time Windows. In: Figueroa-García, J., López-Santana, E., Villa-Ramírez, J., Ferro-Escobar, R. (eds) Applied Computer Sciences in Engineering. WEA 2017. Communications in Computer and Information Science, vol 742. Springer, Cham. https://doi.org/10.1007/978-3-319-66963-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-66963-2_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66962-5
Online ISBN: 978-3-319-66963-2
eBook Packages: Computer ScienceComputer Science (R0)