This article provides an overview of state-of-the-art technologies relevant to dynamic transportation planning problems that involve the reactive routing nnd scheduling of a fleet of vehicles in response to dynamically changing transportation demands. Specifically, we focus on a new class of complex transportation planning problems, which we refer to as the "Dynamic Dial-A-Ride Problem with Multiple Acceptable Destinations and/or Origins" (D-DARP-MADO). While this class of dynamic problems is representative of a number of practical transportation problems, it does not appear to have been the object of prior studies. This is not to say that techniques proposed for simpler routing and scheduling problems cannot be brought to bear on...
The developments in mobile communication technologies are a strong motivation for the study of dynam...
In many ridepooling applications transportation requests arrive throughout the day and have to be an...
International audienceThis paper studies a dynamic dial-a-ride problem bearing complex constraints o...
AbstractThe realization of innovative passengers transport services requires more and more often a g...
AbstractThe realization of innovative transport services requires greater flexibility and inexpensiv...
Urban mobility services face the challenge of planning their operations efficiently while complying ...
The operation of a demand responsive transport service usually considers advanced and real-time requ...
To improve the reliability, responsiveness, and productivity of the flex-route transit service, this...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
Urban mobility services face the challenge of planning their operations efficiently while complying ...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
Abstract In this work a two level heuristic algorithm is described for a nearly real-time multi-vehi...
While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the ...
While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the ...
The developments in mobile communication technologies are a strong motivation for the study of dynam...
In many ridepooling applications transportation requests arrive throughout the day and have to be an...
International audienceThis paper studies a dynamic dial-a-ride problem bearing complex constraints o...
AbstractThe realization of innovative passengers transport services requires more and more often a g...
AbstractThe realization of innovative transport services requires greater flexibility and inexpensiv...
Urban mobility services face the challenge of planning their operations efficiently while complying ...
The operation of a demand responsive transport service usually considers advanced and real-time requ...
To improve the reliability, responsiveness, and productivity of the flex-route transit service, this...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
Urban mobility services face the challenge of planning their operations efficiently while complying ...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
International audienceIn this paper, a restricted dynamic programming algorithm for the static multi...
Abstract In this work a two level heuristic algorithm is described for a nearly real-time multi-vehi...
While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the ...
While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the ...
The developments in mobile communication technologies are a strong motivation for the study of dynam...
In many ridepooling applications transportation requests arrive throughout the day and have to be an...
International audienceThis paper studies a dynamic dial-a-ride problem bearing complex constraints o...