Volume 55, Number 3, May-June 2021
|Page(s)||1865 - 1883|
|Published online||22 June 2021|
Improved robust shortest paths by penalized investments
Department of Computer Science, Pontificia Universidad Catolica de Chile Santiago, Chile
2 Department of Industrial Engineering, Faculty of Engineering, Universidad de Talca, Curicó 3340000, Chile
3 MGN, Rio de Janeiro 20210-030, Brazil
4 Universidade Federal do Rio de Janeiro, COPPE & IM, Rio de Janeiro, Brazil.
* Corresponding author: firstname.lastname@example.org
Accepted: 29 May 2021
Connectivity 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.
Mathematics Subject Classification: 90C47 / 90-08
Key words: Traffic network design / humanitarian logistics / robust optimization / minmax regret path problem with investments / travel times / critical links
© The authors. Published by EDP Sciences, ROADEF, SMAI 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.