Jouhaina Chaouachi Siala

Learn More
We address the generalized minimum spanning tree problem (GMST) which requires spanning at least one vertex out of every set of disjoint vertices in a graph. We show that the geometric version of this problem is NP-hard, and we propose two stochastic heuristics. The first one is a very fast randomized greedy search algorithm and the second one being a(More)
PRT is a futuristic on demand transportation mode that uses driverless vehicle to transport people. Unfortunately, this mode of transport can result in a large amount of wasted energy due to the empty vehicle's movement. In this paper, four different management strategies for empty vehicle's movement will be presented. The impact of each strategy on the(More)
This paper compares two valid mathematical formulations for solving a routing problem related to Personal Rapid Transit (PRT). The PRT is an innovative automated transportation system that provides an on-demand transportation service for its users. This is made possible by the use of small electric driverless vehicles. Our objective is to determine the(More)
A Personal Rapid Transit system is a public transportation mean that uses small, computer guided vehicles running on dedicated guideways for moving passengers to their desired destination. Vehicles in this system move only ondemand of passengers. Consequently, the system results on a high level of empty vehicle displacement. In this paper, we focus on(More)