Some approaches on checkpoint dial-a-ride problems

被引:0
|
作者
Pratelli, A [1 ]
机构
[1] Univ Pisa, Dept Civil Engn Vie & Trasporti, I-56100 Pisa, Italy
关键词
D O I
暂无
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
The aim of this paper is to present some modelling approaches related to a special form of advanced public transport operations and called with different names such as route deviation line, point deviation bus line, corridor deviation line and checkpoint dial-a-ride. A checkpoint dial-a-ride transit system combines characteristics both of traditional fixed route transit and of advanced door-to-door dial-a-ride service. It resembles fixed route operations because some users have to walk to and from at a finite number of stops located on a corridor and always visited. The checkpoint dial-a-ride system also resembles a door-to-door service because some users are picked up and dropped on demand at another finite number of special stops, called deviated stops or checkpoints, located near their trip ends. Such checkpoints are the main elements of a route deviation bus operations, which accepts user demands and, by communicating with a central control unit, makes the bus deviate from its regular route to serve the off-fixed-line request and then return on the regular route. Route deviation bus systems has been proposed and applied in several countries in order to enhance effectiveness of urban transit during off-peak periods, as well-suited service for small cities or as part of a larger integrated transit system. Nevertheless, mathematical modelling of problems associated to route deviation bus systems has received few research contributions. In this paper we describe some of the most recent mathematical approaches to the deviation bus route design problem.
引用
收藏
页码:131 / 140
页数:10
相关论文
共 50 条
  • [21] The Integrated Dial-a-Ride Problem
    Häll C.H.
    Andersson H.
    Lundgren J.T.
    Värbrand P.
    [J]. Public Transport, 2009, 1 (1) : 39 - 54
  • [22] Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
    Chlebikova, Janka
    Dallard, Clement
    Paulsen, Niklas
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 960
  • [23] A High-level Category Survey of Dial-a-Ride Problems
    Goekay, Sevket
    Heuvels, Andreas
    Krempels, Karl-Heinz
    [J]. PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON VEHICLE TECHNOLOGY AND INTELLIGENT TRANSPORT SYSTEMS (VEHITS 2019), 2019, : 594 - 600
  • [24] Structural Synthesis of Dispatching Rules for Dynamic Dial-a-Ride Problems
    Vonolfen, Stefan
    Beham, Andreas
    Kommenda, Michael
    Affenzeller, Michael
    [J]. COMPUTER AIDED SYSTEMS THEORY, PT 1, 2013, 8111 : 276 - 283
  • [25] Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences
    Aleksandrov, Martin
    Kilby, Philip
    [J]. AI 2022: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, 13728 : 690 - 703
  • [26] Combining multicriteria analysis and tabu search for dial-a-ride problems
    Paquette, Julie
    Cordeau, Jean-Francois
    Laporte, Gilbert
    Pascoal, Marta M. B.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 52 : 1 - 16
  • [27] A survey of dial-a-ride problems: Literature review and recent developments
    Ho, Sin C.
    Szeto, W. Y.
    Kuo, Yong-Hong
    Leung, Janny M. Y.
    Petering, Matthew
    Tou, Terence W. H.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2018, 111 : 395 - 421
  • [28] Computer-aided complexity classification of dial-a-ride problems
    de Paepe, WE
    Lenstra, JK
    Sgall, J
    Sitters, RA
    Stougie, L
    [J]. INFORMS JOURNAL ON COMPUTING, 2004, 16 (02) : 120 - 132
  • [29] On-line single-server dial-a-ride problems
    Feuerstein, E
    Stougie, L
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 268 (01) : 91 - 105
  • [30] The finite capacity dial-a-ride problem
    Charikar, M
    Raghavachari, B
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 458 - 467