File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.trb.2014.05.008
- Scopus: eid_2-s2.0-84902343252
- WOS: WOS:000341462100012
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach
Title | Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach |
---|---|
Authors | |
Keywords | Artificial bee colony algorithm Bi-level programming Bus network design Matheuristics Mixed integer program Transit route and frequency setting problem |
Issue Date | 2014 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb |
Citation | Transportation Research Part B: Methodological, 2014, v. 67, p. 235-263 How to Cite? |
Abstract | This paper proposes a bi-level transit network design problem where the transit routes and frequency settings are determined simultaneously. The upper-level problem is formulated as a mixed integer non-linear program with the objective of minimizing the number of passenger transfers, and the lower-level problem is the transit assignment problem with capacity constraints. A hybrid artificial bee colony (ABC) algorithm is developed to solve the bi-level problem. This algorithm relies on the ABC algorithm to design route structures and a proposed descent direction search method to determine an optimal frequency setting for a given route structure. The descent direction search method is developed by analyzing the optimality conditions of the lower-level problem and using the relationship between the lower- and upper-level objective functions. The step size for updating the frequency setting is determined by solving a linear integer program. To efficiently repair route structures, a node insertion and deletion strategy is proposed based on the average passenger demand for the direct services concerned. To increase the computation speed, a lower bound of the objective value for each route design solution is derived and used in the fitness evaluation of the proposed algorithm. Various experiments are set up to demonstrate the performance of our proposed algorithm and the properties of the problem. |
Persistent Identifier | http://hdl.handle.net/10722/202641 |
ISSN | 2023 Impact Factor: 5.8 2023 SCImago Journal Rankings: 2.660 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Szeto, WY | - |
dc.contributor.author | Jiang, Y | - |
dc.date.accessioned | 2014-09-19T09:14:10Z | - |
dc.date.available | 2014-09-19T09:14:10Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Transportation Research Part B: Methodological, 2014, v. 67, p. 235-263 | - |
dc.identifier.issn | 0191-2615 | - |
dc.identifier.uri | http://hdl.handle.net/10722/202641 | - |
dc.description.abstract | This paper proposes a bi-level transit network design problem where the transit routes and frequency settings are determined simultaneously. The upper-level problem is formulated as a mixed integer non-linear program with the objective of minimizing the number of passenger transfers, and the lower-level problem is the transit assignment problem with capacity constraints. A hybrid artificial bee colony (ABC) algorithm is developed to solve the bi-level problem. This algorithm relies on the ABC algorithm to design route structures and a proposed descent direction search method to determine an optimal frequency setting for a given route structure. The descent direction search method is developed by analyzing the optimality conditions of the lower-level problem and using the relationship between the lower- and upper-level objective functions. The step size for updating the frequency setting is determined by solving a linear integer program. To efficiently repair route structures, a node insertion and deletion strategy is proposed based on the average passenger demand for the direct services concerned. To increase the computation speed, a lower bound of the objective value for each route design solution is derived and used in the fitness evaluation of the proposed algorithm. Various experiments are set up to demonstrate the performance of our proposed algorithm and the properties of the problem. | - |
dc.language | eng | - |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb | - |
dc.relation.ispartof | Transportation Research Part B: Methodological | - |
dc.rights | NOTICE: this is the author’s version of a work that was accepted for publication in Transportation Research Part B: Methodological. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Transportation Research Part B: Methodological, 2014, v. 67, p. 235-263. DOI: 10.1016/j.trb.2014.05.008 | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Artificial bee colony algorithm | - |
dc.subject | Bi-level programming | - |
dc.subject | Bus network design | - |
dc.subject | Matheuristics | - |
dc.subject | Mixed integer program | - |
dc.subject | Transit route and frequency setting problem | - |
dc.title | Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach | - |
dc.type | Article | - |
dc.identifier.email | Szeto, WY: ceszeto@hku.hk | - |
dc.identifier.authority | Szeto, WY=rp01377 | en_US |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1016/j.trb.2014.05.008 | - |
dc.identifier.scopus | eid_2-s2.0-84902343252 | - |
dc.identifier.hkuros | 236077 | - |
dc.identifier.volume | 67 | - |
dc.identifier.spage | 235 | - |
dc.identifier.epage | 263 | - |
dc.identifier.isi | WOS:000341462100012 | - |
dc.publisher.place | United Kingdom | - |
dc.identifier.issnl | 0191-2615 | - |