2016
DOI: 10.1007/s12469-016-0128-9
|View full text |Cite
|
Sign up to set email alerts
|

The integrated dial-a-ride problem with timetabled fixed route service

Abstract: This paper concerns operational planning of door-to-door transportation systems for the elderly and/or disabled, who often need a more flexible transportation system than the rest of the population. Highly flexible, but very costly direct transportation is often offered as a complement to standard fixed route public transport service. In the integrated dial-a-ride problem (IDARP), these modes of transport are combined and certain legs of the passengers journeys may be performed with the fixed route public tran… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 47 publications
(35 citation statements)
references
References 22 publications
0
30
0
Order By: Relevance
“…They used a passenger utility maximisation approach and modelled the assignment to travel requests to vehicles as an Integrated Diala-ride Problem (IDARP). More recently, Posada, Andersson, and Häll (2017), Häll et al (2009), and Salazar et al (2018) used a mathematical programming approach that involves solving the assignment problem as an optimisation problem by assigning travel requests to a fleet of on-demand vehicles. Posada, Andersson, and Häll (2017) and Häll et al (2009) solved the assignment problem as an Integrated Dial-A-Ride Problem (IDARP).…”
Section: Literature Reviewmentioning
confidence: 99%
“…They used a passenger utility maximisation approach and modelled the assignment to travel requests to vehicles as an Integrated Diala-ride Problem (IDARP). More recently, Posada, Andersson, and Häll (2017), Häll et al (2009), and Salazar et al (2018) used a mathematical programming approach that involves solving the assignment problem as an optimisation problem by assigning travel requests to a fleet of on-demand vehicles. Posada, Andersson, and Häll (2017) and Häll et al (2009) solved the assignment problem as an Integrated Dial-A-Ride Problem (IDARP).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The differences between the PDPTW-SL and IDARP lie mainly in the human level-of-service perspective inherent to dial-a-ride problems. The formulation in Häll et al (2009) is extended in Posada et al (2017) to the integrated dial-a-ride problem with timetables (IDARP-TT) to also handle timetables for the fixed route service, as well as some further features which aim at making the model more applicable to real-world planning situations. Handling of timetabled fixed route services is essential to be able to synchronize transfers between different travel modes, or different vehicles belonging to the same mode, with the aim to minimize transfer times.…”
Section: Dial-a-ride Planningmentioning
confidence: 99%
“…The solution from the planning algorithm can be evaluated from both the operator's and passenger's perspective. metaheuristic algorithm is chosen over an exact method since it is hard to solve the combinatorial optimization problem associated with an integrated service to optimality for instances of realistic sizes (Posada, Andersson and Häll, 2017).…”
Section: Introductionmentioning
confidence: 99%
“…In the literature on dial-a-ride problems, Posada et al [41] integrate transfers to and from timetabled public transport into the classical dial-a-ride problem. Decisions on which transfer terminals to use (and thus which public transport line) are made simultaneously with vehicle routing decisions.…”
Section: Research Opportunitiesmentioning
confidence: 99%