Two strategies for real time empty vehicle redistribution for the Personal Rapid Transit system

Fatnassi, Ezzeddine; Chebbi, Olfa; Siala, Jouhaina Chaouachi

doi:10.1109/itsc.2013.6728504

Cited by 15 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A literature review published in 2005 [5] states that there is more than 200 research papers related to ATN. More recently, several operational and strategic optimization studies related to ATN were published such as simulation [7], energy minimization [10], total traveled distance [6,8], optimized operational planning [4] and so on. However and from our literature review, many optimization routing models related to ATN considered a single depot network topology [4,6,10].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

An Adaptive Heuristic Approach for the Multiple Depot Automated Transit Network Problem

Chebbi

Fatnassi

Kaabi

2016

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Automated Transit Networks (ATN) are innovative transportation systems where fully driverless vehicles offer an exclusive ondemand transportation service. Within this context of ATN, this study tries to deal with a specific routing problem arising in the context of a ATN's network with a multiple depot topology. More specifically, we present an optimization routing model for automated transit networks which can be used to strategically evaluate depots locations. Our model extends the basic Multi-depot Vehicle Routing Problem (MDVRP). In this paper, the proposed model is tackled using an heuristic approach as the proposed problem is NP-Hard. Experiments are run on a carefully generated instances based on the works from the literature. The numerical results show that the proposed algorithm is competitive as it founds a small gap relative to a lower bound values from the literature.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…In the operational model of Mrad and Hidri [10], the optimized variables are the energy consumption, the objective function is the minimization of total energy consumption of ATN. The ATN'network is assumed to have a single uncapacitated depot [7]. We extend this model to account for a multiple depot topology network.…”

Section: Introductionmentioning

confidence: 99%

An Adaptive Heuristic Approach for the Multiple Depot Automated Transit Network Problem

Chebbi

Fatnassi

Kaabi

2016

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Most reactive methods are based on nearest neighbour heuristics. Such methods of calling the nearest available vehicle to a passenger are used by Fagnant 4 , Kockelman 5 , Bell and Wong 8 , Andreasson 1,13,14,15 , Lees-Miller 3, 9, 10 , Fatnassi et al 12,11 and Kek 16 . These methods may be modified to send the vehicle to the longest waiting passenger in the system (it can be both current waiting time and predicted waiting time at the moment the vehicle will arrive).…”

Section: Introductionmentioning

confidence: 99%

“…The proactive methods use the statistics of supply and demand in different stations or regions of the city. These are used to predict the necessary number of the vehicles in each station (Fatnassi et al 12,11 , Anderson 7 ). Such methods may sort the stations by some predicted criteria such as available vehicles, waiting times etc.…”

Section: Introductionmentioning

confidence: 99%

Untitled

2019

JTTM

View full text Add to dashboard Cite

This article discusses empty vehicle redistribution algorithms for PRT and autonomous taxi services from a passenger service perspective. In modern literature reactive methods such as nearest neighbours are commonly used. In this article we first formulate the general matching problem on a bipartite graph of available vehicles and stations. In addition, we propose an index-based proactive redistribution (IBR) 18,19 algorithm based on predicted near-future demand at stations. The results of different redistribution methods implemented on a simple line test case show that none of the proposed methods are optimal in all cases. Test results of six variations of combined proactive and reactive strategies on a test case in Paris Saclay, France with 20 stations and 100 vehicles are given. The combined Nearest Neighbour / IBR provides a promising solution for both peak and off-peak demand, significantly outperforming all other methods considered, in terms of passenger waiting time (both average and maximum) as well as in terms of station queue lengths.

show abstract

“…A literature review published in 2005 [9] states that there is more than 200 research papers related to ATN. More recently, several operational and strategic optimization studies related to ATN were published such as network design [25], station design [24], dynamic routing [4][13], simulation [14], [7] energy minimization [22], passengers waiting time [20] total traveled distance [12][15], eet size [5], optimized operational planning [6][11] and so on. Starting from all these features, one could note that the transportation service for ATN consists on pickup passengers from a predened station in order to deliver them to another station.…”

Section: Introductionmentioning

confidence: 99%

The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach

Chebbi¹,

Fatnassi²

2017

Computer Information Systems and Industrial Management

Self Cite

View full text Add to dashboard Cite

Part 5: Industrial Management and Other ApplicationsInternational audienceThis paper presents the development of the multi depot one-to-one pickup and delivery problem with distance constraints problem. This problem involve routing vehicles in a multi depot network topology to satisfy a set of pickup and delivery requests subject to a maximum allowable distance constraint. A problem definition is given and a real world application is proposed for that problem. An approximate solution approach which divides the problem into several subproblems and solve them to optimality is also proposed. Computational experiments show that the proposed solution approach reach good quality solutions is a reasonable computational time

show abstract

Two strategies for real time empty vehicle redistribution for the Personal Rapid Transit system

Cited by 15 publications

References 18 publications

An Adaptive Heuristic Approach for the Multiple Depot Automated Transit Network Problem

An Adaptive Heuristic Approach for the Multiple Depot Automated Transit Network Problem

Untitled

The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach

Contact Info

Product

Resources

About