URBAN BUS FLEET ROUTING IN TRANSPORTATION NETWORK EQUIPPED WITH PARK-AND-RIDE: A CASE STUDY OF BABOL, IRAN

被引:7
作者
Khakbaz, Amir [1 ]
Nookabadi, Ali Shahandeh [1 ]
Boushehri, Seyyed Nader Shetab [2 ]
机构
[1] Isfahan Univ Technol, Dept Ind & Syst Engn, Esfahan, Iran
[2] Isfahan Univ Technol, Dept Transportat Engn, Esfahan, Iran
关键词
urban transportation network design problem; urban bus routing; vehicle routing problem; park-and-ride; genetic algorithm; GENETIC ALGORITHMS; PUBLIC TRANSPORT; DESIGN; OPTIMIZATION; CONGESTION; PATTERNS; MODEL;
D O I
10.3846/16484142.2017.1277551
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Recently, most cities have tried to connect park-and-ride facilities with public transit vehicles. The present study aims to design urban bus routes in the transportation network equipped with park-and-ride. Seven important factors which affect the design of urban bus network are identified through the literature review. These factors include demand coverage, route directness, passengers' satisfaction, minimum length of bus route, budget, use of existing bus routes and number of lines. In this article, by use of the mentioned factors, a new model is developed to determine the urban bus routes. The new model figures the routes with park-and-ride as origin and Central Business District (CBD) as destination, in such a manner that the covered demand is maximized. Our novel method is more effective than other options currently available. In fact, it uses the most important factors in designing urban bus routes. Furthermore, an efficient Genetic Algorithm (GA) based approach is represented to solve large-scale problems. Numerical results show the effectiveness of this approach. At last, the developed model is applied to design the urban bus routes in the transportation network of Babol (Iran).
引用
收藏
页码:55 / 65
页数:11
相关论文
共 30 条
[1]   Hybrid Method for Bus Network Design with High Seasonal Demand Variation [J].
Amiripour, S. M. Mahdi ;
Ceder, Avishai ;
Mohaymany, Afshin Shariat .
JOURNAL OF TRANSPORTATION ENGINEERING, 2014, 140 (06)
[2]   Competitive transit network design in cities with radial street patterns [J].
Badia, Hugo ;
Estrada, Miquel ;
Robuste, Francesc .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 59 :161-181
[3]  
Barra A., 2007, 11 WORLD C TRANSP RE, P1
[4]   Genetic algorithms in bus network optimization [J].
Bielli, M ;
Caramia, M ;
Carotenuto, P .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2002, 10 (01) :19-34
[5]   A tabu search algorithm for the open vehicle routing problem [J].
Brandao, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) :552-564
[6]   Optimal route network design for transit systems using genetic algorithms [J].
Chakroborty, P ;
Dwivedi, T .
ENGINEERING OPTIMIZATION, 2002, 34 (01) :83-100
[7]   Transit network design: A procedure and an application to a large urban area [J].
Cipriani, Ernesto ;
Gori, Stefano ;
Petrelli, Marco .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 20 (01) :3-14
[8]   The Transit Route Arc-Node Service Maximization problem [J].
Curtin, Kevin M. ;
Biba, Steve .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 208 (01) :46-56
[9]   FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION [J].
DANTZIG, GB ;
HARVEY, RP ;
LANSDOWNE, ZF ;
ROBINSON, DW ;
MAIER, SF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :5-17
[10]   A metaheuristic approach to the urban transit routing problem [J].
Fan, Lang ;
Mumford, Christine L. .
JOURNAL OF HEURISTICS, 2010, 16 (03) :353-372