This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). This is the pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: the Train Matching Problem, the Track Assignment Problem, the Shunting Routing Problem, and the Shunting ...
In recent years, several perimeter control strategies have been proposed for traffic management in cities. The common factor found in these works is the use of Macroscopic Fundamental Diagram (MFD) models to describe the dynamics of the network and optimize traffic inside the perimeter by manipulating perimeter inflows. Perimeter gating control str...
Railway traffic is often perturbed by unexpected events causing delays, which may greatly propagate. Nowadays, dispatchers deal with delays trying to limit this propagation with scarce decision support tools. RECIFE-MILP is an optimization algorithm which may be used to support dispatchers' decisions. In this paper, we illustrate the analysis perfo...
RailTokyo2015, 6th International Conference on Railway Operations Modelling and Analysis, Tokyo, JAPON, 23-/03/2015 - 26/03/2015
IEEE 17th International Conference on Intelligent Transportation Systems ITSC, Qingdao, CHINE, 08-/10/2014 - 11/10/2014
The main goal of this paper is to better understand the route lifetime dynamics in Intervehicle communication networks (IVC) or what we call intervehicle mobile ad hoc networks (iv-MANETs) that are a special class of MANETs but exhibit very different behavior from them. We consider the problem of finding an optimal multi-hop route between two vehic...
Nowadays, to measure cutting forces involved during routing, systems with piezo-electric sensors are generally used. This study began with the following observation: two species with the same density can induce completely different cutting forces. But two species with completely different densities can also show closed cutting forces. Current formu...
We consider the problem of routing in a highly mobile network which is never fully connected. We describe algorithms that allow to route a packet toward a remote destinations. The packet bounces from connected components to connected components, thanks to node mobility.
Multihops Wireless Access Networks are ad hoc networks connected to Internet through wireless Access Points. They constitute a logical extension of cellular wireless networks to extend the radio covering area in a spontaneous manner in introducing a collaboration among the nodes. They propose a flexible and cheap infrastructure. A client can be con...
