Improved robust shortest paths by penalized investments

Simple item page
dc.contributor.authorPerez-Galarce, Francisco
dc.contributor.authorCandia-Vejar, Alfredo
dc.contributor.authorMaculan, Guido
dc.contributor.authorMaculan, Nelson
dc.date.accessioned2025-01-20T22:17:54Z
dc.date.available2025-01-20T22:17:54Z
dc.date.issued2021
dc.description.abstractConnectivity after disasters has become a critical problem in the management of modern cities. This comes from the need of the decision-makers to ensure urgent medical attention by providing access to health facilities and to other relevant services needed by the population. Managing congestion could help maintain some routes operative even in complex scenarios such as natural disasters, terrorist attacks, protests, or riots. Recent advances in Humanitarian Logistics have handled this problem using different modeling approaches but have principally focused on the response phase. In this paper, firstly, we propose a penalized variant of an existing mathematical model for the robust s-t path problem with investments. With the aim of solving the robust several-to-one path problem with investments, and due to the high complexity of this new problem, a heuristic is proposed. Moreover, this approach allows us to improve travel times in both specific paths and in a set of routes in a systemic framework. The new problem and the proposed heuristic are illustrated by an example, which corresponds to a typical city network, that provides a concrete vision of the potential application of the framework. Lastly, some managerial insights are given by the analysis of results exhibited in the example network.
dc.fuente.origenWOS
dc.identifier.doi10.1051/ro/2021086
dc.identifier.eissn1290-3868
dc.identifier.issn0399-0559
dc.identifier.urihttps://doi.org/10.1051/ro/2021086
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/94562
dc.identifier.wosidWOS:000664284700007
dc.issue.numero3
dc.language.isoen
dc.pagina.final1883
dc.pagina.inicio1865
dc.revistaRairo-operations research
dc.rightsacceso restringido
dc.subjectTraffic network design
dc.subjecthumanitarian logistics
dc.subjectrobust optimization
dc.subjectminmax regret path problem with investments
dc.subjecttravel times
dc.subjectcritical links
dc.titleImproved robust shortest paths by penalized investments
dc.typeartículo
dc.volumen55
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas