Mostrar el registro sencillo del ítem

VRP model with time window, multiproduct and multidepot

dc.contributor.authorRuiz-Meza, José
dc.contributor.authorMontes, Isaid
dc.contributor.authorPérez, Arnoldo
dc.contributor.authorRamos-Márquez, María
dc.date.accessioned2020-11-04T21:02:55Z
dc.date.available2020-11-04T21:02:55Z
dc.date.issued2020-02-15
dc.date.submitted2020-10-03
dc.identifier.citationRuiz-Meza, J., Montes, I., Pérez, A., & Ramos-Márquez, M. (2020). VRP Model with Time Window, Multiproduct and Multidepot. Journal of Applied Science and Engineering, 23(2), 239-247. https://doi.org/10.6180/jase.202006_23(2).0008spa
dc.identifier.urihttps://hdl.handle.net/20.500.12585/9537
dc.description.abstractWith the increase in the transfer of products in supply chains, the organization of routes requires a complex allocation insofar as different environmental variables are considered, and VRP models are an efficient tool for the solution of routing systems of low, medium and high complexity. In this paper, we developed a vehicle routing model with hard time window, multidepot, multiproduct and heterogeneous fleet for the minimization of the distance travelled. We applied the model to a case study of a company that distributes water bottles and bales in which we made a new distribution of delivery schedules by order applied Pareto analysis. We obtained optimal computational results using exact methods in a very short computational time and minimizing the distance to 35.08% of the current route.spa
dc.format.extent9 páginas
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceJournal of Applied Science and Engineering, Vol. 23, No 2, Page 239-247spa
dc.titleVRP model with time window, multiproduct and multidepotspa
dcterms.bibliographicCitationBaldacci, R., Toth, P., & Vigo, D. (2007). Recent advances in vehicle routing exact algorithms. 4OR, 5(4), 269–298. https://doi.org/10.1007/s10288-007-0063-3spa
dcterms.bibliographicCitationBektaş, T., & Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B, 45, 1232–1250. https://doi.org/10.1016/j.trb.2011.02.004spa
dcterms.bibliographicCitationBelgin, O., Karaoglan, I., & Altiparmak, F. (2018). Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach. Computers and Industrial Engineering, 115(March 2016), 1–16. https://doi.org/10.1016/j.cie.2017.10.032spa
dcterms.bibliographicCitationBlum, C. (2012). Hybrid metaheuristics in combinatorial optimization: A tutorial. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7505 LNCS(6), 1–10. https://doi.org/10.1007/978-3-642-33860-1_1spa
dcterms.bibliographicCitationoussaïd, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences, 237, 82–117. https://doi.org/10.1016/j.ins.2013.02.041spa
dcterms.bibliographicCitationClarke, G., & Wright, J. W. W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4), 568–581. https://doi.org/10.1287/opre.12.4.568spa
dcterms.bibliographicCitationCordeau, J. F., Laporte, G., Savelsbergh, M. W. P., & Vigo, D. (2007). Vehicle Routing. In Handbooks in Operations Research and Management Science (Vol. 14, pp. 367–428). https://doi.org/10.1016/S0927-0507(06)14006-2spa
dcterms.bibliographicCitationGolden, B. L., Magnanti, T. L., & Nguyan, H. G. (1972). Implementing vehicle routing algorithms. Networks, 7, 113–148.spa
dcterms.bibliographicCitationGrötschel, M., & Holland, O. (1991). Solution of large-scale symmetric travelling salesman problems. Mathematical Programming, 51(1–3), 141–202. https://doi.org/10.1007/BF01586932spa
dcterms.bibliographicCitationIqbal, S., Kaykobad, M., & Rahman, M. S. (2015). Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees. Swarm and Evolutionary Computation, 24, 50–64. https://doi.org/10.1016/j.swevo.2015.06.001spa
dcterms.bibliographicCitationIsaza, S. N. (2012). Desarrollo y Codificación de un Modelo Matemático para la Optimización de un Problema de Ruteo de Vehículos con Múltiples Depósitosspa
dcterms.bibliographicCitationJourdan, L., Basseur, M., & Talbi, E. G. (2009). Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research, 199(3), 620–629. https://doi.org/10.1016/j.ejor.2007.07.035spa
dcterms.bibliographicCitationKalayci, C. B., & Kaya, C. (2016). An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 66, 163–175. https://doi.org/10.1016/j.eswa.2016.09.017spa
dcterms.bibliographicCitationKara, I., Kara, B., & Yetis, M. (2007). Energy Minimizing Vehicle Routing Problem. In Software Engineering and Formal Methods. https://doi.org/10.1021/pr800044qspa
dcterms.bibliographicCitationKoç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(1), 1–21. https://doi.org/10.1016/j.ejor.2015.07.020spa
dcterms.bibliographicCitationKumar, S. N., & Panneerselvam, R. (2012). A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management, 04(03), 66–74. https://doi.org/10.4236/iim.2012.43010spa
dcterms.bibliographicCitationLaporte, G., Nobert, Y., & Arpin, D. (1986). An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research, 6(9), 291–310. https://doi.org/10.1007/BF02023807spa
dcterms.bibliographicCitationLaporte, Gilbert. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345–358. https://doi.org/10.1016/0377-2217(92)90192-Cspa
dcterms.bibliographicCitationLaporte, Gilbert, Louveaux, F. V, & Mercure, H. (1994). A Priori Optimization of the Probabilistic Traveling Salesman Problem. Operations Research, 42(3), 543–549. Retrieved from http://www.jstor.org/stable/171892spa
dcterms.bibliographicCitationLüer, A., Benavente, M., Bustos, J., & Venegas, B. (2009). El problema de rutas de vehŕculos: Extensiones y métodos de resolución estado del arte. CEUR Workshop Proceedings, 558(JANUARY 2009).spa
dcterms.bibliographicCitationMontoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers and Industrial Engineering, 79, 115–129. https://doi.org/10.1016/j.cie.2014.10.029spa
dcterms.bibliographicCitationOlivera, A. (2004). Heurísticas para problemas de ruteo de vehículos. Instituto de Computacion - Facultad de Ingenieria., 63.spa
dcterms.bibliographicCitationParthanadee, P., & Logendran, R. (2002). Multi-Product Multi-Depot Periodic Distribution Problemspa
dcterms.bibliographicCitationPérez-Rodríguez, R., & Hernández-Aguirre, A. (2019). A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows. Computers and Industrial Engineering, 130(February), 75–96. https://doi.org/10.1016/j.cie.2019.02.017spa
dcterms.bibliographicCitationPuente-Riofrío, M. ;, & Andrade-Domínguez, F. (2016). Relación entre la diversificación de productos y la rentabilidad empresarial. Revista Ciencia UNEMI, 9(18), 73–80.spa
dcterms.bibliographicCitationRenaud, J., Laporte, G., & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23(3), 229–235. https://doi.org/10.1016/0305-0548(95)O0026-Pspa
dcterms.bibliographicCitationRocha, L., González, C., & Orjuela, J. (2011). Una revisión al estado del arte del problema de ruteo e vehiculos: Evolución histórica y métodos de solución. Ingeniería, 16(2), 35–55. Retrieved from https://dialnet.unirioja.es/servlet/articulo?codigo=4797255#spa
dcterms.bibliographicCitationRuiz, E., Soto-Mendoza, V., Ruiz Barbosa, A. E., & Reyes, R. (2019). Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm. Computers and Industrial Engineering, 133(August 2018), 207–219. https://doi.org/10.1016/j.cie.2019.05.002spa
dcterms.bibliographicCitationSajjadi, S. R., Cheraghi, S., Assadi, M., & Krishnan, K. (2010). Meta-heuristic approach for multi-product multi-depot vehicle routing problem. In IIE Annual Conference and Expo 2010 Proceedings.spa
dcterms.bibliographicCitationSarmiento Lepesqueur, A. (2014). Estudio del problema de ruteo de vehículos con balance de carga :Aplicación de la meta-heurística Búsqueda Tabú. Retrieved from http://hdl.handle.net/10818/9798spa
dcterms.bibliographicCitationSolomon, M., & Desrosiers, J. (1988). Time Window Constrained Routing and Scheduling Problems. Transportation Science, 22(1), 1–13. Retrieved from http://www.jstor.org/stable/25768291spa
dcterms.bibliographicCitationSombuntham, P., & Kachitvichyanukul, V. (2010). Multi-depot vehicle routing problem with pickup and delivery requests. AIP Conference Proceedings, 1285(December), 71–85. https://doi.org/10.1063/1.3510581spa
dcterms.bibliographicCitationWilson, N. H. M., Sussman, J. M., Wong, H.-K., & Higonnet, T. (1971). Scheduling algorithms for a dial-a-ride system. Massachusetts Institute of Technology. Urban Systems Laboratory.spa
dcterms.bibliographicCitationYoung, R. R., & Esqueda, P. (2005). Vulnerabilidades de la cadena de suministros: consideraciones para el caso de América Latina. Academia. Revista Latinoamericana de Administración, (34), 63–78. Retrieved from http://www.redalyc.org/articulo.oa?id=71603405spa
datacite.rightshttp://purl.org/coar/access_right/c_abf2spa
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85spa
dc.identifier.urlhttp://jase.tku.edu.tw/articles/jase-202006-23-2-0008
dc.type.driverinfo:eu-repo/semantics/articlespa
dc.type.hasversioninfo:eu-repo/semantics/publishedVersionspa
dc.identifier.doi10.6180/jase.202006_23(2).0008
dc.subject.keywordsPareto analysisspa
dc.subject.keywordsMathematical modelspa
dc.subject.keywordsVehicle routingspa
dc.subject.keywordsOptimizationspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.ccAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.identifier.instnameUniversidad Tecnológica de Bolívarspa
dc.identifier.reponameRepositorio Universidad Tecnológica de Bolívarspa
dc.publisher.placeCartagena de Indiasspa
dc.type.spahttp://purl.org/coar/resource_type/c_6501spa
dc.audienceMaestrosspa
oaire.resourcetypehttp://purl.org/coar/resource_type/c_2df8fbb1spa


Ficheros en el ítem

Thumbnail
Nombre:
76.pdf
Tamaño:
852.7Kb
Formato:
PDF
Descripción:
Artículo principal
Ver/
Thumbnail
Nombre:
license_rdf
Tamaño:
805bytes
Formato:
application/rdf+xml
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

http://creativecommons.org/licenses/by-nc-nd/4.0/
http://creativecommons.org/licenses/by-nc-nd/4.0/

Universidad Tecnológica de Bolívar - 2017 Institución de Educación Superior sujeta a inspección y vigilancia por el Ministerio de Educación Nacional. Resolución No 961 del 26 de octubre de 1970 a través de la cual la Gobernación de Bolívar otorga la Personería Jurídica a la Universidad Tecnológica de Bolívar.