A relax-and-price heuristic for the inventory-location-routing problem

This paper considers the problem of designing a supply chain assuming routing decisions. The objective is to select a subset of depots to open from a set of candidates, the inventory policies for a two-echelon system, and the set of routes to perform distribution from the upper echelon to the next b...

Full description

Autores:
Guerrero, W. J.C
Prodhon, C.
Velasco, N.
Amaya, C. A.
Tipo de recurso:
Article of journal
Fecha de publicación:
2014
Institución:
Escuela Colombiana de Ingeniería Julio Garavito
Repositorio:
Repositorio Institucional ECI
Idioma:
eng
OAI Identifier:
oai:repositorio.escuelaing.edu.co:001/1917
Acceso en línea:
https://repositorio.escuelaing.edu.co/handle/001/1917
Palabra clave:
Gestión de la cadena de suministros
Control de inventarios
Logística empresarial
Supply chain management
inventory-location-routing problem
Lagrangian relaxation;
column generation
supply chain design
vehicle routing problem
Rights
closedAccess
License
C 2014 The Authors.
id ESCUELAIG2_0c94d34ad2463364eb343e26068e0369
oai_identifier_str oai:repositorio.escuelaing.edu.co:001/1917
network_acronym_str ESCUELAIG2
network_name_str Repositorio Institucional ECI
repository_id_str
dc.title.eng.fl_str_mv A relax-and-price heuristic for the inventory-location-routing problem
title A relax-and-price heuristic for the inventory-location-routing problem
spellingShingle A relax-and-price heuristic for the inventory-location-routing problem
Gestión de la cadena de suministros
Control de inventarios
Logística empresarial
Supply chain management
inventory-location-routing problem
Lagrangian relaxation;
column generation
supply chain design
vehicle routing problem
title_short A relax-and-price heuristic for the inventory-location-routing problem
title_full A relax-and-price heuristic for the inventory-location-routing problem
title_fullStr A relax-and-price heuristic for the inventory-location-routing problem
title_full_unstemmed A relax-and-price heuristic for the inventory-location-routing problem
title_sort A relax-and-price heuristic for the inventory-location-routing problem
dc.creator.fl_str_mv Guerrero, W. J.C
Prodhon, C.
Velasco, N.
Amaya, C. A.
dc.contributor.author.none.fl_str_mv Guerrero, W. J.C
Prodhon, C.
Velasco, N.
Amaya, C. A.
dc.contributor.researchgroup.spa.fl_str_mv Manufactura y Servicios
dc.subject.armarc.spa.fl_str_mv Gestión de la cadena de suministros
Control de inventarios
Logística empresarial
topic Gestión de la cadena de suministros
Control de inventarios
Logística empresarial
Supply chain management
inventory-location-routing problem
Lagrangian relaxation;
column generation
supply chain design
vehicle routing problem
dc.subject.armarc.eng.fl_str_mv Supply chain management
dc.subject.proposal.eng.fl_str_mv inventory-location-routing problem
Lagrangian relaxation;
column generation
supply chain design
vehicle routing problem
description This paper considers the problem of designing a supply chain assuming routing decisions. The objective is to select a subset of depots to open from a set of candidates, the inventory policies for a two-echelon system, and the set of routes to perform distribution from the upper echelon to the next by a homogeneous fleet of vehicles over a finite planning horizon considering deterministic demand. To solve the problem, a partition is proposed using a Dantzig–Wolfe formulation on the routing variables. A hybridization between column generation, Lagrangian relaxation, and local search is presented within a heuristic procedure. Results demonstrate the capability of the algorithm to compute high quality solutions and empirically estimate the improvement in the cost function of the proposed model at up to 9% compared to the sequential approach. Furthermore, the suggested pricing problem is a new variant of the shortest path problem with applications in urban transportation and telecommunications.
publishDate 2014
dc.date.issued.none.fl_str_mv 2014
dc.date.accessioned.none.fl_str_mv 2021-12-10T15:18:54Z
dc.date.available.none.fl_str_mv 2021-12-10T15:18:54Z
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.coarversion.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.version.spa.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.coar.spa.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.content.spa.fl_str_mv Text
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/article
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/ART
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.issn.none.fl_str_mv 09696016
dc.identifier.uri.none.fl_str_mv https://repositorio.escuelaing.edu.co/handle/001/1917
identifier_str_mv 09696016
url https://repositorio.escuelaing.edu.co/handle/001/1917
dc.language.iso.spa.fl_str_mv eng
language eng
dc.relation.citationendpage.spa.fl_str_mv 148
dc.relation.citationstartpage.spa.fl_str_mv 129
dc.relation.citationvolume.spa.fl_str_mv 22
dc.relation.indexed.spa.fl_str_mv N/A
dc.relation.ispartofjournal.eng.fl_str_mv International Transactions in Operational Research
dc.relation.references.spa.fl_str_mv Ambrosino, D., Scutella, M.-G., 2005. Distribution network design: New problems and related models. ` European Journal of Operational Research 165, 3, 610–624.
Balcik, B., Beamon, B., Krejci, C., Muramatsu, K., Ramirez, M., 2010. Coordination in humanitarian relief chains: Practices, challenges and opportunities. International Journal of Production Economics 126, 22–34.
Beasley, J.E., 1993. Lagrangean relaxation. In Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, John Wiley & Sons, New York, pp. 243–303.
Belenguer, J.-M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R., 2011. A branch-and-cut method for the capacitated location-routing problem. Computers and Operations Research 38, 6, 931–941.
Daskin, M., Snyder, L., Berger, R., 2005. Facility location in supply chain design. Logistics Systems: Design and Optimization 1, 39–65.
Feillet, D., 2010. A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research 8, 407–424.
Geoffrion, A., 1974. Lagrangian relaxation for integer programming. Mathematical Programming Study 2, 82–114.
Guerrero, W., Prodhon, C., Velasco, N., Amaya, C., 2013a. Hybrid heuristic for the inventory location-routing problem with deterministic demand. International Journal of Production Economics 146, 1, 359–370.
Guerrero, W., Velasco, N., Prodhon, C., Amaya, C., 2013b. On the generalized elementary shortest path problem: a heuristic approach. Electronic Notes in Discrete Mathematics 41, 503–510.
Hansen, P., Mladenovic, N., 2003. Variable neighborhood search. In Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics, Kluwer, Boston, MA, pp. 145–184.
Javid, A.A., 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.
Kallehauge, B., Larsen, J., Madsen, O.B.G., 2006. Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research 33, 5, 1464–1487.
Liu, S.C., Lee, S.B., 2003. A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. The International Journal of Advanced Manufacturing Technology 22, 941–950.
Liu, S.C., Lin, C.C., 2005. A heuristic method for the combined location routing and inventory problem. The International Journal of Advanced Manufacturing Technology 26, 372–381.
Manzini, R., 2012. A top-down approach and a decision support system for the design and management of logistic networks. Transportation Research Part E: Logistics and Transportation Review 48, 6, 1185–1204.
Melo, M.T., Nickel, S., da Gama, F.S., 2009. Facility location and supply chain management: a review. European Journal of Operational Research 196, 2, 401–412.
Mete, H.O., Zabinsky, Z.B., 2010. Stochastic optimization of medical supply location and distribution in disaster management. International Journal of Production Economics 126, 1, 76–84.
Nishi, T., Isoya, Y., Inuiguchi, M., 2011. An integrated column generation and lagrangian relaxation for solving flowshop problems to minimize the total weighted tardiness. International Journal of Innovative Computing, Information and Control 7, 11, 6453–6471.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Wolfler Calvo, R., 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41, 4, 470–483.
Prins, C., Prodhon, C., Wolfer-Calvo, R., 2006. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research 4, 221–238.
Prodhon, C., Prins, C., 2014. A survey of recent research on location-routing problems. European Journal of Operational Research. In Press. doi: http://dx.doi.org/10.1016/j.ejor.2014.01.005
Raidl, G., Puchinger, J., 2008. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. Hybrid Metaheuristics 114, 31–62.
Sajjadi, S.R., Cheraghi, S.H., 2011. Multi-products location-routing problem integrated with inventory under stochastic demand. International Journal of Industrial and Systems Engineering 7, 4, 454–476.
Salhi, S., Rand, G.K., 1989. The effect of ignoring routes when locating depots. European Journal of Operational Research 39, 2, 150–156.
Shen, Z.-J.M., Qi, L., 2007. Incorporating inventory and routing costs in strategic location models. European Journal of Operational Research 179, 2, 372–389.
Wagner, H.M., Whitin, T.M., 1958. Dynamic version of the economic lot size model. Management Science 5, 1, 89–96.
dc.rights.eng.fl_str_mv C 2014 The Authors.
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_14cb
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/closedAccess
rights_invalid_str_mv C 2014 The Authors.
http://purl.org/coar/access_right/c_14cb
eu_rights_str_mv closedAccess
dc.format.extent.spa.fl_str_mv 20 páginas.
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.spa.fl_str_mv John Wiley & Sons, Inc.
dc.publisher.place.spa.fl_str_mv E.E.U.U.
institution Escuela Colombiana de Ingeniería Julio Garavito
bitstream.url.fl_str_mv https://repositorio.escuelaing.edu.co/bitstream/001/1917/5/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf.txt
https://repositorio.escuelaing.edu.co/bitstream/001/1917/4/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.png
https://repositorio.escuelaing.edu.co/bitstream/001/1917/6/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf.jpg
https://repositorio.escuelaing.edu.co/bitstream/001/1917/3/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf
https://repositorio.escuelaing.edu.co/bitstream/001/1917/2/license.txt
bitstream.checksum.fl_str_mv a047be004a547a9b90bb965ffae0c261
ecd49bd34d8d97e8743f3f42d1624d5a
587876df15c6b724ab3892422e26a2c4
7b39b1126a4d0de6d4026b49ff7e714c
5a7ca94c2e5326ee169f979d71d0f06e
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositorio Escuela Colombiana de Ingeniería Julio Garavito
repository.mail.fl_str_mv repositorio.eci@escuelaing.edu.co
_version_ 1814355617376108544
spelling Guerrero, W. J.Cde4cbbe132a6685351daa104599691be600Prodhon, C.5bf61f5d5cf07c8def51723051c7dd1b600Velasco, N.d0ff82fc3ece11767faf502e7f9aa285600Amaya, C. A.57156c31b65816c3d27b67bfbb302711600Manufactura y Servicios2021-12-10T15:18:54Z2021-12-10T15:18:54Z201409696016https://repositorio.escuelaing.edu.co/handle/001/1917This paper considers the problem of designing a supply chain assuming routing decisions. The objective is to select a subset of depots to open from a set of candidates, the inventory policies for a two-echelon system, and the set of routes to perform distribution from the upper echelon to the next by a homogeneous fleet of vehicles over a finite planning horizon considering deterministic demand. To solve the problem, a partition is proposed using a Dantzig–Wolfe formulation on the routing variables. A hybridization between column generation, Lagrangian relaxation, and local search is presented within a heuristic procedure. Results demonstrate the capability of the algorithm to compute high quality solutions and empirically estimate the improvement in the cost function of the proposed model at up to 9% compared to the sequential approach. Furthermore, the suggested pricing problem is a new variant of the shortest path problem with applications in urban transportation and telecommunications.Este artículo considera el problema de diseñar una cadena de suministro asumiendo decisiones de enrutamiento. El objetivo es seleccionar un subconjunto de depósitos para abrir de un conjunto de candidatos, las políticas de inventario para un sistema de dos escalones y el conjunto de rutas para realizar la distribución desde el escalón superior al siguiente por una flota homogénea de vehículos sobre un horizonte finito de planificación considerando la demanda determinista. Para resolver el problema, se propone una partición utilizando una formulación de Dantzig-Wolfe sobre las variables de enrutamiento. Se presenta una hibridación entre generación de columnas, relajación lagrangiana y búsqueda local dentro de un procedimiento heurístico. Los resultados demuestran la capacidad del algoritmo para calcular soluciones de alta calidad y estimar empíricamente la mejora en la función de coste del modelo propuesto hasta en un 9 % en comparación con el enfoque secuencial. Además, el problema de fijación de precios sugerido es una nueva variante del problema del camino más corto con aplicaciones en transporte urbano y telecomunicaciones.20 páginas.application/pdfengJohn Wiley & Sons, Inc.E.E.U.U.C 2014 The Authors.info:eu-repo/semantics/closedAccesshttp://purl.org/coar/access_right/c_14cbA relax-and-price heuristic for the inventory-location-routing problemArtículo de revistainfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Textinfo:eu-repo/semantics/articlehttp://purl.org/redcol/resource_type/ARThttp://purl.org/coar/version/c_970fb48d4fbd8a8514812922N/AInternational Transactions in Operational ResearchAmbrosino, D., Scutella, M.-G., 2005. Distribution network design: New problems and related models. ` European Journal of Operational Research 165, 3, 610–624.Balcik, B., Beamon, B., Krejci, C., Muramatsu, K., Ramirez, M., 2010. Coordination in humanitarian relief chains: Practices, challenges and opportunities. International Journal of Production Economics 126, 22–34.Beasley, J.E., 1993. Lagrangean relaxation. In Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, John Wiley & Sons, New York, pp. 243–303.Belenguer, J.-M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R., 2011. A branch-and-cut method for the capacitated location-routing problem. Computers and Operations Research 38, 6, 931–941.Daskin, M., Snyder, L., Berger, R., 2005. Facility location in supply chain design. Logistics Systems: Design and Optimization 1, 39–65.Feillet, D., 2010. A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research 8, 407–424.Geoffrion, A., 1974. Lagrangian relaxation for integer programming. Mathematical Programming Study 2, 82–114.Guerrero, W., Prodhon, C., Velasco, N., Amaya, C., 2013a. Hybrid heuristic for the inventory location-routing problem with deterministic demand. International Journal of Production Economics 146, 1, 359–370.Guerrero, W., Velasco, N., Prodhon, C., Amaya, C., 2013b. On the generalized elementary shortest path problem: a heuristic approach. Electronic Notes in Discrete Mathematics 41, 503–510.Hansen, P., Mladenovic, N., 2003. Variable neighborhood search. In Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics, Kluwer, Boston, MA, pp. 145–184.Javid, A.A., 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.Kallehauge, B., Larsen, J., Madsen, O.B.G., 2006. Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research 33, 5, 1464–1487.Liu, S.C., Lee, S.B., 2003. A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. The International Journal of Advanced Manufacturing Technology 22, 941–950.Liu, S.C., Lin, C.C., 2005. A heuristic method for the combined location routing and inventory problem. The International Journal of Advanced Manufacturing Technology 26, 372–381.Manzini, R., 2012. A top-down approach and a decision support system for the design and management of logistic networks. Transportation Research Part E: Logistics and Transportation Review 48, 6, 1185–1204.Melo, M.T., Nickel, S., da Gama, F.S., 2009. Facility location and supply chain management: a review. European Journal of Operational Research 196, 2, 401–412.Mete, H.O., Zabinsky, Z.B., 2010. Stochastic optimization of medical supply location and distribution in disaster management. International Journal of Production Economics 126, 1, 76–84.Nishi, T., Isoya, Y., Inuiguchi, M., 2011. An integrated column generation and lagrangian relaxation for solving flowshop problems to minimize the total weighted tardiness. International Journal of Innovative Computing, Information and Control 7, 11, 6453–6471.Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Wolfler Calvo, R., 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41, 4, 470–483.Prins, C., Prodhon, C., Wolfer-Calvo, R., 2006. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research 4, 221–238.Prodhon, C., Prins, C., 2014. A survey of recent research on location-routing problems. European Journal of Operational Research. In Press. doi: http://dx.doi.org/10.1016/j.ejor.2014.01.005Raidl, G., Puchinger, J., 2008. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. Hybrid Metaheuristics 114, 31–62.Sajjadi, S.R., Cheraghi, S.H., 2011. Multi-products location-routing problem integrated with inventory under stochastic demand. International Journal of Industrial and Systems Engineering 7, 4, 454–476.Salhi, S., Rand, G.K., 1989. The effect of ignoring routes when locating depots. European Journal of Operational Research 39, 2, 150–156.Shen, Z.-J.M., Qi, L., 2007. Incorporating inventory and routing costs in strategic location models. European Journal of Operational Research 179, 2, 372–389.Wagner, H.M., Whitin, T.M., 1958. Dynamic version of the economic lot size model. Management Science 5, 1, 89–96.Gestión de la cadena de suministrosControl de inventariosLogística empresarialSupply chain managementinventory-location-routing problemLagrangian relaxation;column generationsupply chain designvehicle routing problemTEXTA relax-and-price heuristic for the inventory-location-routing problem.pdf.txtA relax-and-price heuristic for the inventory-location-routing problem.pdf.txtExtracted texttext/plain58848https://repositorio.escuelaing.edu.co/bitstream/001/1917/5/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf.txta047be004a547a9b90bb965ffae0c261MD55metadata only accessTHUMBNAILA relax-and-price heuristic for the inventory-location-routing problem.pngA relax-and-price heuristic for the inventory-location-routing problem.pngimage/png115885https://repositorio.escuelaing.edu.co/bitstream/001/1917/4/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pngecd49bd34d8d97e8743f3f42d1624d5aMD54open accessA relax-and-price heuristic for the inventory-location-routing problem.pdf.jpgA relax-and-price heuristic for the inventory-location-routing problem.pdf.jpgGenerated Thumbnailimage/jpeg14836https://repositorio.escuelaing.edu.co/bitstream/001/1917/6/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf.jpg587876df15c6b724ab3892422e26a2c4MD56metadata only accessORIGINALA relax-and-price heuristic for the inventory-location-routing problem.pdfA relax-and-price heuristic for the inventory-location-routing problem.pdfArtículo de revistaapplication/pdf499237https://repositorio.escuelaing.edu.co/bitstream/001/1917/3/A%20relax-and-price%20heuristic%20for%20the%20inventory-location-routing%20problem.pdf7b39b1126a4d0de6d4026b49ff7e714cMD53metadata only accessLICENSElicense.txtlicense.txttext/plain; charset=utf-81881https://repositorio.escuelaing.edu.co/bitstream/001/1917/2/license.txt5a7ca94c2e5326ee169f979d71d0f06eMD52open access001/1917oai:repositorio.escuelaing.edu.co:001/19172022-11-24 03:01:50.657metadata only accessRepositorio Escuela Colombiana de Ingeniería Julio Garavitorepositorio.eci@escuelaing.edu.coU0kgVVNURUQgSEFDRSBQQVJURSBERUwgR1JVUE8gREUgUEFSRVMgRVZBTFVBRE9SRVMgREUgTEEgQ09MRUNDScOTTiAiUEVFUiBSRVZJRVciLCBPTUlUQSBFU1RBIExJQ0VOQ0lBLgoKQXV0b3Jpem8gYSBsYSBFc2N1ZWxhIENvbG9tYmlhbmEgZGUgSW5nZW5pZXLDrWEgSnVsaW8gR2FyYXZpdG8gcGFyYSBwdWJsaWNhciBlbCB0cmFiYWpvIGRlIGdyYWRvLCBhcnTDrWN1bG8sIHZpZGVvLCAKY29uZmVyZW5jaWEsIGxpYnJvLCBpbWFnZW4sIGZvdG9ncmFmw61hLCBhdWRpbywgcHJlc2VudGFjacOzbiB1IG90cm8gKGVuICAgIGFkZWxhbnRlIGRvY3VtZW50bykgcXVlIGVuIGxhIGZlY2hhIAplbnRyZWdvIGVuIGZvcm1hdG8gZGlnaXRhbCwgeSBsZSBwZXJtaXRvIGRlIGZvcm1hIGluZGVmaW5pZGEgcXVlIGxvIHB1YmxpcXVlIGVuIGVsIHJlcG9zaXRvcmlvIGluc3RpdHVjaW9uYWwsIAplbiBsb3MgdMOpcm1pbm9zIGVzdGFibGVjaWRvcyBlbiBsYSBMZXkgMjMgZGUgMTk4MiwgbGEgTGV5IDQ0IGRlIDE5OTMsIHkgZGVtw6FzIGxleWVzIHkganVyaXNwcnVkZW5jaWEgdmlnZW50ZQphbCByZXNwZWN0bywgcGFyYSBmaW5lcyBlZHVjYXRpdm9zIHkgbm8gbHVjcmF0aXZvcy4gRXN0YSBhdXRvcml6YWNpw7NuIGVzIHbDoWxpZGEgcGFyYSBsYXMgZmFjdWx0YWRlcyB5IGRlcmVjaG9zIGRlIAp1c28gc29icmUgbGEgb2JyYSBlbiBmb3JtYXRvIGRpZ2l0YWwsIGVsZWN0csOzbmljbywgdmlydHVhbDsgeSBwYXJhIHVzb3MgZW4gcmVkZXMsIGludGVybmV0LCBleHRyYW5ldCwgeSBjdWFscXVpZXIgCmZvcm1hdG8gbyBtZWRpbyBjb25vY2lkbyBvIHBvciBjb25vY2VyLgpFbiBtaSBjYWxpZGFkIGRlIGF1dG9yLCBleHByZXNvIHF1ZSBlbCBkb2N1bWVudG8gb2JqZXRvIGRlIGxhIHByZXNlbnRlIGF1dG9yaXphY2nDs24gZXMgb3JpZ2luYWwgeSBsbyBlbGFib3LDqSBzaW4gCnF1ZWJyYW50YXIgbmkgc3VwbGFudGFyIGxvcyBkZXJlY2hvcyBkZSBhdXRvciBkZSB0ZXJjZXJvcy4gUG9yIGxvIHRhbnRvLCBlcyBkZSBtaSBleGNsdXNpdmEgYXV0b3LDrWEgeSwgZW4gY29uc2VjdWVuY2lhLCAKdGVuZ28gbGEgdGl0dWxhcmlkYWQgc29icmUgw6lsLiBFbiBjYXNvIGRlIHF1ZWphIG8gYWNjacOzbiBwb3IgcGFydGUgZGUgdW4gdGVyY2VybyByZWZlcmVudGUgYSBsb3MgZGVyZWNob3MgZGUgYXV0b3Igc29icmUgCmVsIGRvY3VtZW50byBlbiBjdWVzdGnDs24sIGFzdW1pcsOpIGxhIHJlc3BvbnNhYmlsaWRhZCB0b3RhbCB5IHNhbGRyw6kgZW4gZGVmZW5zYSBkZSBsb3MgZGVyZWNob3MgYXF1w60gYXV0b3JpemFkb3MuIEVzdG8gCnNpZ25pZmljYSBxdWUsIHBhcmEgdG9kb3MgbG9zIGVmZWN0b3MsIGxhIEVzY3VlbGEgYWN0w7phIGNvbW8gdW4gdGVyY2VybyBkZSBidWVuYSBmZS4KVG9kYSBwZXJzb25hIHF1ZSBjb25zdWx0ZSBlbCBSZXBvc2l0b3JpbyBJbnN0aXR1Y2lvbmFsIGRlIGxhIEVzY3VlbGEsIGVsIENhdMOhbG9nbyBlbiBsw61uZWEgdSBvdHJvIG1lZGlvIGVsZWN0csOzbmljbywgCnBvZHLDoSBjb3BpYXIgYXBhcnRlcyBkZWwgdGV4dG8sIGNvbiBlbCBjb21wcm9taXNvIGRlIGNpdGFyIHNpZW1wcmUgbGEgZnVlbnRlLCBsYSBjdWFsIGluY2x1eWUgZWwgdMOtdHVsbyBkZWwgdHJhYmFqbyB5IGVsIAphdXRvci5Fc3RhIGF1dG9yaXphY2nDs24gbm8gaW1wbGljYSByZW51bmNpYSBhIGxhIGZhY3VsdGFkIHF1ZSB0ZW5nbyBkZSBwdWJsaWNhciB0b3RhbCBvIHBhcmNpYWxtZW50ZSBsYSBvYnJhIGVuIG90cm9zIAptZWRpb3MuRXN0YSBhdXRvcml6YWNpw7NuIGVzdMOhIHJlc3BhbGRhZGEgcG9yIGxhcyBmaXJtYXMgZGVsIChsb3MpIGF1dG9yKGVzKSBkZWwgZG9jdW1lbnRvLiAKU8OtIGF1dG9yaXpvIChhbWJvcykK

Publicaciones similares