RUOTSALAINEN, Laura Renaudin, Valérie PEI, Ling PIRAS, Marco MARAIS, Juliette CAVALHERI, Emerson KAASALAINEN, Sanna

This article provides an overview of the use of inertial and visual sensors and discusses their prospects in the Arctic navigation of autonomous vehicles. We also examine the fusion algorithms used thus far for integrating vehicle localization measurements as well as the map-matching (MM) algorithms relating position coordinates with road infrastru...

AMELI, Mostafa Lebacque, Jean-Patrick Leclercq, Ludovic

Solving a dynamic traffic assignment problem in a transportation network is a computational challenge. This study first reviews the different algorithms in the literature used to numerically calculate the User Equilibrium (UE) related to dynamic network loading. Most of them are based on iterative methods to solve a fixed-point problem. Two element...

DELEPLANQUE, Samuel LABBE, Martine PONCE, Diego PUERTO, Justo

The Discrete Ordered Median Problem (DOMP) is formulated as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous...

Hosteins, Pierre SCATAMACCHIA, Rosario

We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the outcome of attacks on nodes is uncertain. In our work, we focus on trees and demonstrate that over trees the stochastic CNP actually genera...

AMELI, Mostafa LEBACQUE, Jean-Patrick LECLERCQ, Ludovic

Solving a dynamic traffic assignment problem in a transportation network is a computational challenge. This study first reviews the different algorithms in the literature used to numerically calculate the User Equilibrium (UE) related to dynamic network loading. Most of them are based on iterative methods to solve a fixed-point problem. Two element...

HOSTEINS, Pierre SCATAMACCHIA, Rosario

We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the outcome of attacks on nodes is uncertain. In our work, we focus on trees and demonstrate that over trees the stochastic CNP actually genera...

KEITA, Kaba PELLEGRINI, Paola Rodriguez, Joaquin

In railway systems, during congested traffic situations, the infrastructure capacity is completely exploited for trains circulation. When traffic is perturbed, some trains must be stopped or slowed down for ensuring safety, and delays occur. The real-time Railway Traffic Management Problem (rtRTMP) is the problem of modifying trains route and sched...

RUOTSALAINEN, Laura RENAUDIN, Valérie PEI, Ling PIRAS, Marco MARAIS, Juliette CAVALHERI, Emerson KAASALAINEN, Sanna

This article provides an overview of the use of inertial and visual sensors and discusses their prospects in the Arctic navigation of autonomous vehicles. We also examine the fusion algorithms used thus far for integrating vehicle localization measurements as well as the map-matching (MM) algorithms relating position coordinates with road infrastru...

KEITA, Kaba PELLEGRINI, Paola RODRIGUEZ, Joaquin

In railway systems, during congested traffic situations, the infrastructure capacity is completely exploited for trains circulation. When traffic is perturbed, some trains must be stopped or slowed down for ensuring safety, and delays occur. The real-time Railway Traffic Management Problem (rtRTMP) is the problem of modifying trains route and sched...

ALISOLTANI, Negin ZARGAYOUNA, Mahdi Leclercq, Ludovic

AICCSA 2019, 16th ACS/IEEE International Conference on Computer Systems and Applications, Abu Dhabi, EMIRATS ARABES UNIS, 03-/11/2019 - 07/11/2019