Redirigiendo al acceso original de articulo en 22 segundos...
Inicio  /  Algorithms  /  Vol: 16 Par: 3 (2023)  /  Artículo
ARTÍCULO
TITULO

Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects

Juarez Machado da Silva    
Gabriel de Oliveira Ramos and Jorge Luis Victória Barbosa    

Resumen

The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at any time. When a graph changes, DSP algorithms partially recompute the paths while taking advantage of the previous computations. Although the DSP problem represents many real situations, it leaves out some fundamental aspects of decision-making. One of these aspects is the existence of multiple, potentially conflicting objectives that must be optimized simultaneously. Recently, we performed a first incursion on the so-called Multi-Objective Dynamic Shortest Path (MODSP), presenting the first algorithm able to take the MODM perspective into account when solving a DSP problem. In this paper, we go beyond and formally define the MODSP problem, thus establishing and clarifying it with respect to its simpler counterparts. In particular, we start with a brief overview of the related literature and then present a complete formalization of the MODSP problem class, highlighting its distinguishing features as compared to similar problems and representing their relationship through a novel taxonomy. This work also motivates the relevance of the MODSP problem by enumerating real-world scenarios that involve all its ingredients, such as multiple objectives and dynamically updated graph topologies. Finally, we discuss the challenges and open questions for this new class of shortest path problems, aiming at future work directions. We hope this work sheds light on the theme and contributes to leveraging relevant research on the topic.

 Artículos similares

       
 
Changyu Lu, Jianmin Yang, Bernt Johan Leira, Qihang Chen and Shulin Wang    
Three-dimensional path planning is instrumental in path decision making and obstacle avoidance for deep-sea mining vehicles (DSMV). However, conventional particle swarm algorithms have been prone to trapping in local optima and have slow convergence rate... ver más

 
Lili Tanti, Syahril Efendi, Maya Silvi Lydia and Herman Mawengkang    
Disaster logistics management is vital in planning and organizing humanitarian assistance distribution. The planning problem faces challenges, such as coordinating the allocation and distribution of essential resources while considering the severity of t... ver más
Revista: Algorithms

 
Gowthaman Sivakumar, Eman Almehdawe and Golam Kabir    
The COVID-19 pandemic has significantly impacted almost every sector. This impact has been especially felt in the healthcare sector, as the pandemic has affected its stability, which has highlighted the need for improvements in service. As such, we propo... ver más

 
Manuel Lara, Juan Garrido, Mario L. Ruz and Francisco Vázquez    
This paper deals with the control problems of a wind turbine working in its nominal zone. In this region, the wind turbine speed is controlled by means of the pitch angle, which keeps the nominal power constant against wind fluctuations. The non-uniform ... ver más
Revista: Applied Sciences

 
Slobodan P. Simonovic    
Global change, that results from population growth, global warming and land use change (especially rapid urbanization), is directly affecting the complexity of water resources management problems and the uncertainty to which they are exposed. Both, the c... ver más
Revista: Water