Show simple item record

dc.contributor.authorGuerrero, W.J.
dc.contributor.authorProdhon, C.
dc.contributor.authorVelasco, N.
dc.contributor.authorAmaya, C.A.
dc.date.accessioned2021-12-10T15:40:30Z
dc.date.available2021-12-10T15:40:30Z
dc.date.issued2013
dc.identifier.issn16194500
dc.identifier.issn09255273
dc.identifier.urihttps://repositorio.escuelaing.edu.co/handle/001/1918
dc.description.abstractResolver el problema de localización y ruteo de inventarios optimiza simultáneamente el diseño de la cadena de suministro y sus costos operacionales. Los supuestos del modelo incluyen el hecho que los vehículos pueden visitar más de un cliente por ruta y se incluyen las decisiones de inventario para un sistema con múltiples depósitos, con múltiples puntos de venta para un horizonte de planeación discreto. El problema es determinar el conjunto de depósitosporabrir, las cantidades por enviar desde los proveedores a los depósitos y de los depósitos a los puntos de venta, y la secuencia en que los puntos de venta serán visitados por una flota de vehículos homogénea. Un modelo de programación entera-mixta se propone para describir el problema. Un método hibrido que involucra un enfoque exacto dentro de un esquema heurístico es presentado. Su desempeño se prueba con instancias del problema de localizacion y ruteo, y de ruteo de inventarios.spa
dc.description.abstractSolving the Inventory Location-Routing Problem can been seen as an approach to optimize both a supply chain design and its operations costs. Assumptions consider that vehicles might visit more than one retailer per route and that inventory management decisions are included for a multi-depot, multi-retailer system with storage capacity over a discrete time planning horizon. The problem is to determine the set of candidate depots to open, the quantities to ship from suppliers to depots and from depots to retailers per period, and the sequence in which retailers are replenished by an homogeneous capacitated fleet of vehicles. A mixed-integer linear programming model is proposed to describe the problem. Since the model is not able to solve exactly the targeted instances within a reasonable computation time, a hybrid method, embedding an exact approach within a heuristic scheme, is presented. Its performance is tested over instances for the inventory location routing, location-routing and inventory-routing problems.eng
dc.format.extent11 páginasspa
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.publisherElsevier B.V.spa
dc.titleHybrid Heuristic for the Inventory Location-Routing Problemeng
dc.typeArtículo de revistaspa
dc.type.versioninfo:eu-repo/semantics/publishedVersionspa
oaire.accessrightshttp://purl.org/coar/access_right/c_14cbspa
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85spa
dc.contributor.researchgroupManufactura y Serviciosspa
dc.relation.citationendpage370spa
dc.relation.citationissue1spa
dc.relation.citationstartpage359spa
dc.relation.citationvolume146spa
dc.relation.indexedN/Aspa
dc.relation.ispartofjournalInternational Journal of Production Economicseng
dc.relation.referencesAmbrosino,D., Scutellà, M.G. (2005), Distribution network design: New problems and related models. European Journal of Operational Research, 165(3):610-624.spa
dc.relation.referencesArchetti, C., Bertazzi, L., Hertz, A. and Speranza. M.G. (2011) A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing, 1:1-16.spa
dc.relation.referencesArchetti, C., Bertazzi, L., Laporte, G. and Speranza. M.G. (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3):382-391.spa
dc.relation.referencesArmentano, V., Shiguemoto, A. and Lokketangen, A. (2011) Tabu search with path relinking for an integrated production distribution problem. Computers & Operations Research, 38(8):1199-1209.spa
dc.relation.referencesBelenguer, J.-M., Benavent, E., Prins, C., Prodhon, C. and Wolfler-Calvo , R. (2011) A branch-and-cut method for the capacitated location-routing problem. Computers & Operations Research, 38(6):931- 941. [6]spa
dc.relation.referencesBertazzi, L., Paletta, G. and Speranza, M.G. (2002) Deterministic order-up-to level policies in an inventory routing problem. Transportation Science, 36(1):119-132.spa
dc.relation.referencesBoudia, M. and Prins, C. (2009) A memetic algorithm with dynamic population management for an integrated production-distribution problem. European Journal of Operational Research, 195(3):703-715.spa
dc.relation.referencesClarke, G. and Wright, J. (1964). Scheduling of vehicles from a central depot to a umber of delivery points. Operations Research, 12(4):568-581.spa
dc.relation.referencesGuerrero, W., Prodhon, C., Velasco, N. and Amaya, C.A. (2011) A matheuristic for the inventory location routing problem with deterministic demand. In MIC 2011 (Metaheuristics International Conference), Udine, Italie.spa
dc.relation.referencesGuerrero, W., Prodhon, C., Velasco, N. and Amaya, C.A. (2012) Hybrid heuristic for the inventory location-routing problem with deterministic demand. In 5th International Workshop on Freight Transportation and Logistics, Mykonos, Greece.spa
dc.relation.referencesHansen, P. and Mladenovic, N. (2003) Variable neighborhood search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 145-184. Springer New York.spa
dc.relation.referencesJavid, A. and Azad, N. (2010) Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part E: Logistics and Transportation Review, 46(5):582-597.spa
dc.relation.referencesLiu, S. and Lin, C. (2005) A heuristic method for the combined location routing and inventory problem. The International Journal of Advanced Manufacturing Technology, 26:372-381.spa
dc.relation.referencesLourenço, H., Martin, O. and Stützle, T. (2003) Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 320-353. Springer New York.spa
dc.relation.referencesMa, H. and Davidrajuh, R. (2005) An iterative approach for distribution chain design in agile virtual environment. Industrial Management & Data Systems, 105(6):815-834.spa
dc.relation.referencesMelo, M., Nickel, S. and da Gama, F.S. (2009) Facility location and supply chain management: A review. European Journal of Operational Research, 196(2):401-412009.spa
dc.relation.referencesPrins, C. Prodhon, C. Ruiz, A. Soriano, P. and Wolfler-Calvo, R. (2007) Solving the capacitated location-routing problem by a cooperative lagrangean relaxationgranular tabu search heuristic. Transportation Science, 41(4):470-483.spa
dc.relation.referencesPrins, C., Prodhon, C., and Wolfler-Calvo, R. (2006) Solving the capacitated locationrouting problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research, 4:221-238.spa
dc.relation.referencesRaidl, G. and Puchinger, J. (2008). Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In C. Blum, M. Aguilera, A. Roli, and M. Sampels, editors, Hybrid Metaheuristics, volume 114 of Studies in Computational Intelligence, pages 31{62. Springer Berlin / Heidelberg.spa
dc.relation.referencesSalhi, S. and Rand, G. (1989) . The effect of ignoring routes when locating depots. European Journal of Operational Research, 39(2):150-156.spa
dc.relation.referencesToth P. and Vigo D.(2001) editors. The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.spa
dc.rights.accessrightsinfo:eu-repo/semantics/closedAccessspa
dc.subject.proposalLocation-Routing Problemeng
dc.subject.proposalInventory-Routing Problemeng
dc.subject.proposalHybrid Heuristiceng
dc.subject.proposalCombinatorial Optimizationeng
dc.type.coarhttp://purl.org/coar/resource_type/c_6501spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/articlespa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTspa


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record