Mostrar el registro sencillo del documento
A time-expanded network for the biomedical sample transportation problem
dc.rights.license | Atribución-NoComercial 4.0 Internacional |
dc.contributor.advisor | González-Calderón, Carlos Alberto |
dc.contributor.advisor | Contardo, Claudio |
dc.contributor.advisor | Anaya-Arenas, Ana María |
dc.contributor.author | Ocampo-Giraldo, Daniel Mauricio |
dc.date.accessioned | 2020-04-29T15:29:38Z |
dc.date.available | 2020-04-29T15:29:38Z |
dc.date.issued | 2019-12-13 |
dc.identifier.uri | https://repositorio.unal.edu.co/handle/unal/77467 |
dc.description.abstract | In this research, a new formulation over a time-expanded network for the biomedical sample transportation problem is proposed. The biomedical sample transportation problem is a vehicle routing problem arising in the context of healthcare logistics. The difficulty of this transportation problem is related to the lifespan of the samples because the duration of a route is limited by the time available to complete the transportation of the sample before it perishes. To test the quality and the behavior of the time-expanded formulation, experiments are conducted over a set of real-life inspired instances from the Quebec’s laboratory network under the management of the Ministère de la Santé et des Services sociaux (Ministry of Health and Social Services). The results expose the convenience of used a time-expanded network to model the biomedical sample transportation problem. |
dc.description.abstract | En esta investigación, se propone una nueva formulación sobre una red expandida en el tiempo para el problema de transporte de muestras médicas. El problema de transporte de muestras médicas es un problema de ruteo de vehı́culos que surge en el contexto de la logística en salud. La dificultad de este problema de transporte está relacionada con la vida útil de la muestra porque la duración de una ruta está limitada por el tiempo disponible para completar el transporte de la muestra antes de que perezca. Para probar la calidad y el comportamiento de la formulación expandida en el tiempo, se realizan experimentos en un conjunto de instancias inspiradas en la operación de la red de laboratorios de Quebec bajo la administración del Ministère de la Santé et des Services sociaux (Ministerio de Salud y Servicios Sociales). Los resultados exponen la conveniencia de utilizar una red expandida en el tiempo para modelar el problema de transporte de muestras médicas.. |
dc.format.extent | 50 |
dc.format.mimetype | application/pdf |
dc.language.iso | eng |
dc.rights | Derechos reservados - Universidad Nacional de Colombia |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ |
dc.subject.ddc | 420 - Inglés e inglés antiguo::427 - Variaciones históricas y geográficas, variaciones no geográficas modernas del inglés |
dc.title | A time-expanded network for the biomedical sample transportation problem |
dc.title.alternative | Red tiempo expandió para el problema de transporte de muestras médicas |
dc.type | Otro |
dc.type.driver | info:eu-repo/semantics/other |
dc.type.version | info:eu-repo/semantics/acceptedVersion |
dc.publisher.program | Medellín - Minas - Maestría en Ingeniería - Infraestructura y Sistemas de Transporte |
dc.contributor.corporatename | Universidad Nacional de Colombia - Sede Medellín |
dc.contributor.researchgroup | VIAS Y TRANSPORTE (VITRA) |
dc.description.degreelevel | Maestría |
dc.publisher.department | Departamento de Ingeniería Civil |
dc.publisher.branch | Universidad Nacional de Colombia - Sede Medellín |
dc.relation.references | Amorim, P., Parragh, S. N., Sperandio, F., & Almada-Lobo, B. (2014, jul). A rich ve- hicle routing problem dealing with perishable food: a case study. TOP , 22 (2), 489– 508. Retrieved from http://link.springer.com/10.1007/s11750-012-0266-4 doi: 10.1007/s11750-012-0266-4 |
dc.relation.references | Anaya-Arenas, A. M., Chabot, T., Renaud, J., & Ruiz, A. (2016). Biomedical sample trans- portation in the province of Quebec: A case study. International Journal of Production Research, 54 (2), 602–615. doi: 10.1080/00207543.2015.1018455 |
dc.relation.references | Anaya-Arenas, A. M., Prodhon, C., Renaud, J., & Ruiz, A. (2019). An iterated local search approach to solve a biomedical sample transportation problem with interdependent pickups. Journal of the Operational Research Society (in press). |
dc.relation.references | Baş, S., Carello, G., Lanzarone, E., Ocak, Z., & Yalçındağ, S. (2016). Management of blood donation system: literature review and research perspectives. In Health care systems engineering for scientists and practitioners (pp. 121–132). Springer. |
dc.relation.references | Boland, N., Hewitt, M., Marshall, L., & Savelsbergh, M. (2017). The continuous-time service network design problem. Operations Research, 65 (5), 1303–1321. |
dc.relation.references | Boland, N., Hewitt, M., Marshall, L., & Savelsbergh, M. (2019). The price of discretizing time: a study in service network design. EURO Journal on Transportation and Logistics, 8 (2), 195–216. |
dc.relation.references | Braekers, K., Ramaekers, K., & Nieuwenhuyse, I. V. (2016). The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, 99 , 300– 313. |
dc.relation.references | Brailsford, S., & Vissers, J. (2011). Or in healthcare: A european perspective. European journal of operational research, 212 (2), 223–234. |
dc.relation.references | Bräysy, O., & Gendreau, M. (2005a, feb). Vehicle routing problem with Time windows, part II: Metaheuristics. Transportation Science, 39 (1), 119–139. Retrieved from http:// pubsonline.informs.org/doi/abs/10.1287/trsc.1030.0057 doi: 10.1287/trsc.1030 .0057 |
dc.relation.references | Bräysy, O., & Gendreau, M. (2005b, feb). Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science, 39 (1), 104–118. Retrieved from http://pubsonline.informs.org/doi/abs/10.1287/trsc.1030.0056 doi: 10.1287/trsc.1030.0056 |
dc.relation.references | Coelho, L. C., Renaud, J., & Laporte, G. (2016). Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015. INFOR: Information Systems and Operational Research, 54 (2), 79–96. doi: 10.1080/03155986.2016.1167357 |
dc.relation.references | Doerner, K. F., Gronalt, M., Hartl, R. F., Kiechle, G., & Reimann, M. (2008). Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Computers and Operations Research, 35 (9), 3034–3048. doi: 10.1016/ j.cor.2007.02.012 |
dc.relation.references | Dumas, Y., Desrosiers, J., & Soumis, F. (1991, sep). The pickup and delivery problem with time windows. European Journal of Operational Research, 54 (1), 7–22. Retrieved from https://www.sciencedirect.com/science/article/pii/037722179190319Q doi: 10 .1016/0377-2217(91)90319-Q |
dc.relation.references | Dunning, I., Huchette, J., & Lubin, M. (2017). JuMP: A modeling language for mathematical optimization. SIAM Review , 59 (2), 295–320. doi: 10.1137/15M1020575 |
dc.relation.references | Favaretto, D., Moretti, E., & Pellegrini, P. (2007, apr). Ant colony system for a VRP with multiple time windows and multiple visits. Journal of Interdisciplinary Mathemat- ics, 10 (2), 263–284. Retrieved from http://www.tandfonline.com/doi/abs/10.1080/ 09720502.2007.10700491 doi: 10.1080/09720502.2007.10700491 |
dc.relation.references | Fikar, C., & Hirsch, P. (2017). Home health care routing and scheduling: A review. Com- puters & Operations Research, 77 , 86–95. |
dc.relation.references | Fischer, F., & Helmberg, C. (2014, feb). Dynamic graph generation for the shortest path problem in time expanded networks. Mathematical Programming, 143 (1-2), 257– 297. Retrieved from http://link.springer.com/10.1007/s10107-012-0610-3 doi: 10.1007/s10107-012-0610-3 |
dc.relation.references | Gendreau, M., Ghiani, G., & Guerriero, E. (2015). Time-dependent routing problems: A review. Computers and Operations Research, 64 , 189–197. doi: 10.1016/j.cor.2015.06.001 |
dc.relation.references | Ghandforoush, P., & Sen, T. K. (2010). A dss to manage platelet production supply chain for regional blood centers. Decision Support Systems, 50 (1), 32–42. |
dc.relation.references | Hulshof, P. J., Kortbeek, N., Boucherie, R. J., Hans, E. W., & Bakker, P. J. (2012). Taxonomic classification of planning decisions in health care: a structured review of the state of the art in or/ms. Health systems, 1 (2), 129–175. |
dc.relation.references | Lahyani, R., Khemakhem, M., & Semet, F. (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research, 241 , 1–14. doi: 10.1016/j.ejor.2014.07.048 |
dc.relation.references | Liu, R., Xie, X., Augusto, V., & Rodriguez, C. (2013, nov). Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research, 230 (3), 475–486. Retrieved from https://www.sciencedirect.com/science/article/pii/S0377221713003585 doi: 10 .1016/J.EJOR.2013.04.044 |
dc.relation.references | McDonald, J. (1972). Vehicle scheduling—a case study. Journal of the Operational Research Society, 23 (4), 433–444. |
dc.relation.references | Mobasher, A., Ekici, A., & Özener, O. Ö. (2015). Coordinating collection and appointment scheduling operations at the blood donation sites. Computers & Industrial Engineering, 87 , 260–266. |
dc.relation.references | Naccache, S., Côté, J.-F., & Coelho, L. C. (2018, aug). The multi-pickup and deliv- ery problem with time windows. European Journal of Operational Research, 269 (1), 353–362. Retrieved from https://www.sciencedirect.com/science/article/pii/ S0377221718300717 doi: 10.1016/J.EJOR.2018.01.035 |
dc.relation.references | Naji-Azimi, Z., Salari, M., Renaud, J., & Ruiz, A. (2016). A practical vehicle routing problem with desynchronized arrivals to depot. European Journal of Operational Research, 255 (1), 58–67. |
dc.relation.references | Osorio, A. F., Brailsford, S. C., & Smith, H. K. (2015). A structured review of quanti- tative models in the blood supply chain: a taxonomic framework for decision-making. International Journal of Production Research, 53 (24), 7191–7212. |
dc.relation.references | Pirabán, A., Guerrero, W., & Labadie, N. (2019). Survey on blood supply chain management: Models and methods. Computers & Operations Research. |
dc.relation.references | Şahinyazan, F. G., Kara, B. Y., & Taner, M. R. (2015). Selective vehicle routing for a mobile blood donation system. European Journal of Operational Research, 245 (1), 22–34. |
dc.relation.references | Skutella, M. (2009). An Introduction to Network Flows over Time. In Research trends in combinatorial optimization (pp. 451–482). Berlin, Heidelberg: Springer Berlin Heidelberg. Retrieved from http://link.springer.com/10.1007/978-3-540-76796-1{ }21 doi: 10.1007/978-3-540-76796-1 21 |
dc.relation.references | Tricoire, F., Romauch, M., Doerner, K., & Operations, R. H. C. (2010). Heuristics for the multi-period orienteering problem with multiple time windows. Computers and Operations Research, 37 (2), 351–367. |
dc.relation.references | Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234 (3), 658–673. |
dc.relation.references | Yi, J. (2003). Vehicle routing with time windows and time-dependent rewards: A problem from the american red cross. Manufacturing & Service Operations Management, 5 (1), 74–77. |
dc.relation.references | Yücel, E., Salman, F. S., Gel, E. S., Örmeci, E. L., & Gel, A. (2013). Optimizing specimen collection for processing in clinical testing laboratories. European Journal of Operational Research, 227 (3), 503–514. |
dc.relation.references | Zahiri, B., Torabi, S., Mousazadeh, M., & Mansouri, S. (2015). Blood collection management: Methodology and application. Applied Mathematical Modelling, 39 (23-24), 7680–7696. |
dc.rights.accessrights | info:eu-repo/semantics/openAccess |
dc.subject.proposal | time-expanded network |
dc.subject.proposal | red tiempo-expandido |
dc.subject.proposal | vehicle routing problem |
dc.subject.proposal | problema de ruteo de vehículos |
dc.subject.proposal | muestras médicas |
dc.subject.proposal | biomedical samples |
dc.subject.proposal | healthcare logistic |
dc.subject.proposal | logística en salud |
dc.type.coar | http://purl.org/coar/resource_type/c_1843 |
dc.type.coarversion | http://purl.org/coar/version/c_ab4af688f83e57aa |
dc.type.content | Text |
oaire.accessrights | http://purl.org/coar/access_right/c_abf2 |
Archivos en el documento
Este documento aparece en la(s) siguiente(s) colección(ones)
Esta obra está bajo licencia internacional Creative Commons Reconocimiento-NoComercial 4.0.Este documento ha sido depositado por parte de el(los) autor(es) bajo la siguiente constancia de depósito