Typology and literature review for dial-a-ride problems

Molenbruch, Yves; Braekers, Kris; Caris, An

doi:10.1007/s10479-017-2525-0

Cited by 160 publications

(82 citation statements)

References 132 publications

(453 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This results in a broad variety in the definition of constraints and of objective functions, as well as in the assumptions about the nature of available information. These features are described in detail in recent surveys by Molenbruch et al (2017) or Ho et al (2018). We only review them here very briefly, with the goal to position our work with respect to earlier contributions.…”

Section: Literature Review and Positioning Of The Contributionmentioning

confidence: 99%

Recovery management for a dial-a-ride system with real-time disruptions

Paquay

Crama

Pironet

2020

European Journal of Operational Research

View full text Add to dashboard Cite

The problem considered in this work stems from a non-profit organization in charge of doorto-door passenger transportation for medical appointments. Patients are picked up at home by a driver and are then dropped at their appointment location. They may also be driven back home at the end of their appointment. Some patients have specific requirements, e.g., they may require an accompanying person or a wheelchair. Planning such activities gives rise to a so-called dial-a-ride problem. In the present work, it is assumed that the requests assigned to the drivers have been selected, and the transportation plan has been established for the next day. However, in practice, appointment durations may vary due to unforeseen circumstances, and some transportation requests may be modified, delayed or canceled during the day. The aim of this work is to propose a reactive algorithm which can adapt the initial plan in order to manage the disruptions and to take care of as many patients as possible in real-time. The plan should be modified quickly when a perturbation is observed, without resorting to major changes which may confuse the drivers and the patients. Several recourse procedures are defined for this purpose. They allow the dispatcher to temporarily delete a request, to insert a previously deleted request, or to permanently cancel a request. Simulation techniques are used to test the approach on randomly generated scenarios. Several key performance indicators are introduced in order to measure the impact of the disruptions and the quality of the solutions.

show abstract

Section: Literature Review and Positioning Of The Contributionmentioning

confidence: 99%

Recovery management for a dial-a-ride system with real-time disruptions

Paquay

Crama

Pironet

2020

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Recently, Braekers and Kovacs [16], extend the single period HDARP to a Multi-Period DARP and consider a limited number of drivers to serve each user over a predefined number of days. For other variants of (H)DARP applied to real concepts the interested readers are referred to surveys on the DARP by Cordeau and Laporte [10] and Molenbruch et al [17]. Container transportation is performed by a mixed fleet of different types of vehicles.…”

Section: The Heterogenous Dial-a Ride-problemmentioning

confidence: 99%

“…Constraints (16) impose that the fuel level is reduced based on the distance travelled between nodes and and the fuel consumption rate, where is a constant applied to each arc ( , ) ∀ , ∈ ′. Constraints (17) guarantee that the fuel level is reset to its maximum after visiting each recharging station node. Constraints (18) guarantee that the remaining tank fuel level of the vehicle is enough to return to the initial depot or to reach a fuel station from any user location.…”

Section: Problem Definition and Model Formulationmentioning

confidence: 99%

Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem

et al. 2020

View full text Add to dashboard Cite

In this paper, a new variant of the Heterogeneous Dial-a-Ride Problem (HDARP) is innovatively applied to a routing problem of trucks picking up and delivering full and empty containers in the logistic chain, including container depots, importers demanding full containers and exporters requesting empty containers. On the route different types of trucks pick-up and deliver full and empty 20-and 40-foot containers. We consider trucks that are operated by alternative fuel, as well as the need for refuelling of trucks in any alternative fuel station to eliminate the risk of running out of fuel during its route. The objective of the paper is to contribute to the optimization of container truck transport routing with multiple pickups and deliveries by providing a mathematical programming model aiming at minimizing the transportation cost as well as the negative environmental impacts.

show abstract

“…To find near-optimal solutions to the DARPTW, past studies have implemented a range of metaheuristic methods, including ACO [38], GA [39], SA [40], and TS [41]. For further details and a comprehensive review of DARP and DARPTW models, refer to the literature review by Molenbruch et al [42]. Although these studies have provided useful results that can minimize passenger or operator costs, there are still limitations in the implementation of these approaches in suburban and rural areas.…”

Section: The Dial-a-ride Problem (Darp) and Demand Responsive Transitmentioning

confidence: 99%

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

et al. 2019

View full text Add to dashboard Cite

Although demand responsive feeder bus operation is possible with human-driven vehicles, it has not been very popular and is mostly available as a special service because of its high operating costs due to intensive labor costs as well as requirement for advanced real-time information technology and complicated operation. However, once automated vehicles become available, small-sized flexible door-to-door feeder bus operation will become more realistic, so preparing for such automated flexible feeder services is necessary to take advantage of the rapid improvement of automated vehicle technology. Therefore, in this research, an algorithm for optimal flexible feeder bus routing, which considers relocation of buses for multiple stations and trains, was developed using a simulated annealing algorithm for future automated vehicle operation. An example was developed and tested to demonstrate the developed algorithm. The algorithm successfully handled relocation of buses when the optimal bus routings were not feasible using the buses available at certain stations. Furthermore, the developed algorithm limited the maximum degree of circuity for each passenger while minimizing the total cost, including total vehicle operating costs and total passenger in-vehicle travel time costs.

show abstract

Typology and literature review for dial-a-ride problems

Cited by 160 publications

References 132 publications

Recovery management for a dial-a-ride system with real-time disruptions

Recovery management for a dial-a-ride system with real-time disruptions

Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem

Development of an Algorithm for Optimal Demand Responsive Relocatable Feeder Transit Networks Serving Multiple Trains and Stations

Contact Info

Product

Resources

About