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 条
  • [1] CHECKPOINT DIAL-A-RIDE SYSTEMS
    DAGANZO, CF
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1984, 18 (4-5) : 315 - 327
  • [2] Feasibility Testing for Dial-a-Ride Problems
    Haugland, Dag
    Ho, Sin C.
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 170 - +
  • [3] Introduction to the robustness in Dial-a-ride problems
    Deleplanque, Samuel
    Quilliot, Alain
    [J]. Journal Europeen des Systemes Automatises, 2013, 47 (4-8): : 617 - 634
  • [4] DIAL-A-RIDE
    RICHARDS, B
    [J]. ARCHITECTURAL DESIGN, 1975, 45 (12) : 777 - 778
  • [5] DIAL-A-RIDE
    不详
    [J]. CURRENT MUNICIPAL PROBLEMS, 1975, 16 (04): : 443 - 444
  • [6] DIAL-A-RIDE
    WILLMOTT, P
    [J]. NEW SOCIETY, 1982, 60 (1011): : 21 - 21
  • [7] Efficient feasibility testing for dial-a-ride problems
    Hunsaker, B
    Savelsbergh, M
    [J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (03) : 169 - 173
  • [8] Typology and literature review for dial-a-ride problems
    Yves Molenbruch
    Kris Braekers
    An Caris
    [J]. Annals of Operations Research, 2017, 259 : 295 - 325
  • [9] Typology and literature review for dial-a-ride problems
    Molenbruch, Yves
    Braekers, Kris
    Caris, An
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 259 (1-2) : 295 - 325
  • [10] A note on "Efficient feasibility testing for dial-a-ride problems"
    Tang, Jiafu
    Kong, Yuan
    Lau, Henry
    Ip, Andrew W. H.
    [J]. OPERATIONS RESEARCH LETTERS, 2010, 38 (05) : 405 - 407