Show simple item record

Optimization methods for the inventory routing problem with hard time windows

Métodos de optimización para el problema de ruteo de vehículos con inventarios y ventanas de tiempo duras

dc.creatorPérez Kaligari, Eliseo
dc.creatorGuerrero Rueda, William Javier
dc.date2015-11-30
dc.date.accessioned2019-04-17T22:08:20Z
dc.date.available2019-04-17T22:08:20Z
dc.identifierhttp://revistas.ubiobio.cl/index.php/RI/article/view/2415
dc.identifier.urihttp://revistaschilenas.uchile.cl/handle/2250/49968
dc.descriptionThe studied problem considers the inventory routing problem with time windows (IRPTW) in a supply chain that consists of a single warehouse and multiple retailers. The considered planning horizon is discrete and finite, and the decisions to optimize are: the quantities to supply to retailers, and simultaneously the sequence of retailers to visit in each time period. The system has a single vehicle with limited capacity, storage capacity constraints at retailers and a limited production rate at the depot is considered. It is required to meet the retailer´s demand. It is assumed that retailers have deterministic demand and not homogeneous. It is proposed a mathematical formulation based on mixed integer programming, and it is studied the impact of the time windows configuration on inventory routing decisions through two optimization methods. The first method optimizes decisions simultaneously, while the second proposed method considers sequential decisions, making it a heuristic method. A computational study with 80 instances adapted from the literature is presented. The results show that the method of simultaneous optimization has outperformed the heuristic optimization method generating potential savings in logistics costs of at least 6%.en-US
dc.descriptionEl problema estudiado considera las decisiones de ruteo de vehículos con inventarios y restricciones de ventanas de tiempo duras (IRPTW) en una cadena de abastecimiento compuesta por un depósito y múltiples minoristas. Se asume un horizonte de planeación discreto y finito en donde las decisiones por optimizar son: las cantidades a aprovisionar a los minoristas y, simultáneamente, la secuencia de minoristas a visitar en cada periodo de tiempo. El sistema cuenta con un sólo vehículo de capacidad limitada, restricciones de capacidad de almacenamiento de los minoristas, y tasa de producción limitada del depósito. Se requiere satisfacer la demanda que tienen los minoristas. Se asume que los minoristas tienen demanda determinística y no homogénea. Se propone una formulación matemática basada en programación entera mixta y se estudia el impacto que tiene la configuración de las ventanas de tiempo sobre las decisiones de ruteo de vehículos con inventarios, a través de dos métodos de optimización. El primer método optimiza las decisiones de forma simultánea, mientras que el segundo método propuesto considera las decisiones de forma secuencial, lo que lo convierte en un método heurístico. Se presenta un estudio computacional con 80 instancias adaptadas de la literatura. Los resultados muestran que el método de optimización simultáneo tiene un desempeño mejor que el método heurístico de optimización secuencial generando ahorros potenciales en los costos logísticos de al menos 6%.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad del Bio-Bioes-ES
dc.relationhttp://revistas.ubiobio.cl/index.php/RI/article/view/2415/3215
dc.relation/*ref*/ANDERSSON, H., HOFF, A., CHRISTIANSEN, M., HASLE, G., and LØKKETANGEN, A. Industrial aspects and literature survey: Combined inventory management and routing. Computers & Operations Research, 2010, vol. 37, no. 9, pp. 1515-1536.
dc.relation/*ref*/ARCHETTI, C., BERTAZZI, L., HERTZ, A., and SPERANZA, M.G. A Hybrid Heuristic for an Inventory Routing Problem.INFORMS Journal on Computing, 2012, vol. 24, no. 1, pp. 101-116.
dc.relation/*ref*/ARCHETTI, C., BERTAZZI, L., LAPORTE, G., and SPERANZA, M.G. A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transportation Science, 2007, vol. 41, no. 3, pp. 382-391.
dc.relation/*ref*/BAÑOS, R., ORTEGA, J., GIL, C., MÁRQUEZ, A.L., and DE TORO, F. A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Computers & Industrial Engineering, 2013, vol. 65, no. 2, pp. 286-296.
dc.relation/*ref*/BARD, J.F., and NANANUKUL, N. Heuristics for a multiperiod inventory routing problem with production decisions. Computers & Industrial Engineering, 2009, vol. 57, no. 3, pp. 713-723.
dc.relation/*ref*/BERTAZZI, L., BOSCO, A., GUERRIERO, F., and LAGANÀ, D.A stochastic inventory routing problem with stock-out. Transportation Research Part C: Emerging Technologies, 2013, vol. 27, pp. 89-107.
dc.relation/*ref*/BRÄYSY, O., and GENDREAU, M. Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. Transportation Science, 2005, vol. 39, no. 1, pp. 119-139.
dc.relation/*ref*/CALVETE, H.I., GALÉ, C., OLIVEROS, M.J., and SÁNCHEZ-VALVERDE, B. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research, 2007, vol. 177, no. 3, pp. 1720-1733.
dc.relation/*ref*/CHANG, T.S., WAN, Y., and OOI, W.T.A stochastic dynamic traveling salesman problem with hard time windows. European Journal of Operational Research, 2009, vol. 198, no. 3, pp. 748-759.
dc.relation/*ref*/COELHO, L.C. Instance set proposed by Archetti et al. (2007) for the single vehicle single commodity inventory-routing problem. 2007. [Disponible en]: <a href="http://www.leandro-coelho.com/instances/inventory-routing" target="_blank">http://www.leandro-coelho.com/instances/inventory-routing</a> [Acceso 9 de Diciembre 2015].
dc.relation/*ref*/COELHO, L.C., and LAPORTE, G. The exact solution of several classes of inventory-routing problems. Computers & Operations Research, 2013, vol. 40, no. 2, pp. 558-565.
dc.relation/*ref*/COELHO, L.C., CORDEAU, J.F., and LAPORTE, G. Consistency in multi-vehicle inventory-routing. Transportation Research Part C: Emerging Technologies, 2012(a), vol. 24, pp. 270-287.
dc.relation/*ref*/COELHO, L.C., CORDEAU, J.F., and LAPORTE, G. The inventory-routing problem with transshipment. Computers & Operations Research, 2012 (b), vol. 39, no. 11, pp. 2537-2548.
dc.relation/*ref*/DONDO, R., MÉNDEZ, C. A., and CERDÁ, J. The multi-echelon vehicle routing problem with cross docking in supply chain management. Computers & Chemical Engineering, 2011, vol. 35, no. 12, pp. 3002-3024.
dc.relation/*ref*/GRONHAUG, R., CHRISTIANSEN, M., DESAULNIERS, G., and DESROSIERS, J.A. Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem.Transportation Science, 2010,vol. 44, no.3 pp. 400-415.
dc.relation/*ref*/GUERRERO, W.J., PRODHON, C., VELASCO, N., and AMAYA, C.A. A relax-and-price heuristic for the inventory-location-routing problem.International Transactions in Operational Research,2015, vol. 22, no. 1, pp. 129-148.
dc.relation/*ref*/LIU, S.C., and LEE, W.T. A heuristic method for the inventory routing problem with time windows. Expert Systems with Applications, 2011, vol. 38, no. 10, pp. 13223-13231.
dc.relation/*ref*/QIN, L., MIAO, L., RUAN, Q., and ZHANG, Y. A local search method for periodic inventory routing problem. Expert Systems with Applications, 2014, vol. 41, no. 2, pp. 765-778.
dc.relation/*ref*/QURESHI, A.G., TANIGUCHI, E., and YAMADA, T. A Microsimulation Based Analysis of Exact Solution of Dynamic Vehicle Routing with Soft Time Windows. Procedia - Social and Behavioral Sciences, 2012, vol. 39, pp. 205-216.
dc.rightsDerechos de autor 2016 Revista Ingeniería Industriales-ES
dc.sourceRevista Ingeniería Industrial; Vol. 14 Núm. 3 (2015)es-ES
dc.source0718-8307
dc.source0717-9103
dc.titleOptimization methods for the inventory routing problem with hard time windowsen-US
dc.titleMétodos de optimización para el problema de ruteo de vehículos con inventarios y ventanas de tiempo durases-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record