This study reviews existing computational methods to calculate simulation-based dynamic network equilibrium. We consider a trip-based multi-modal approach for the dynamic network loading. Mode and path choices are carried out at the same level; therefore, travel times depend on the travel path and the mode attributes of travelers. This study develo...
Betweenness Centrality (BC) has proven to be a fundamental metric in many domains to identify the components (nodes) of a system modelled as a graph that are mostly traversed by information flows thus being critical to the proper functioning of the system itself. In the transportation domain, the metric has been mainly adopted to discover topologic...
This study reviews existing computational methods to calculate simulation-based dynamic network equilibrium. We consider a trip-based multi-modal approach for the dynamic network loading. Mode and path choices are carried out at the same level; therefore, travel times depend on the travel path and the mode attributes of travelers. This study develo...
Modelling the mechanical response of gas hydrate bearing sediments has become a crucial issue in the environmental field. The scarcity of experimental data due to the instability of the gas hydrates makes it difficult to develop accurate mechanical constitutive models. This paper suggests a numerical homogenisation method to simulate the response o...
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...
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...
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...
Les gares ferroviaires concentrant les fins et les débuts de trajets des trains structurent l'essentiel de l'exploitation de lignes pour passagers. En effet, on y programme des opérations de préparation du matériel roulant (nettoyage, accouplement des trains. . . ) dites de « produit train » indispensables à la qualité de service. Ces opérations im...
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...
Taxis are an important transportation mode in many cities due to their convenience and accessibility. In the taxi-dispatching problem, sometimes it is more beneficial for the supplier if taxis cruise in the network after serving the first request to pick up the next passenger, while sometimes it is better that they wait in stations for new trip req...
