Skip to main navigation Skip to search Skip to main content

Heuristic algorithms for capacity flexibility of urban transit networks

  • Harbin Institute of Technology Shenzhen
  • School of Transportation Science and Engineering, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, the concept of capacity flexibility is introduced into transit network, and the model of capacity flexibility of urban transit networks is formulated. A heuristic solution based on hybrid genetic algorithm is proposed to the model. GA-LS (Genetic algorithms with Local search) is applied to solve the model. It is also tested by a numerical example with a small transit network. The results show how the maximum additional passenger flows from each origin-destination (OD) pair are determined in a transit network and what extent the transit network supply meets the additional passenger demand in a certain level of service. These results show that the GA-LS method considerably improves the value of the objective function for same iterative times compared with the general GA, but spending more time.

Original languageEnglish
Title of host publicationProceedings - 2012 8th International Conference on Natural Computation, ICNC 2012
Pages1186-1190
Number of pages5
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 8th International Conference on Natural Computation, ICNC 2012 - Chongqing, China
Duration: 29 May 201231 May 2012

Publication series

NameProceedings - International Conference on Natural Computation
ISSN (Print)2157-9555

Conference

Conference2012 8th International Conference on Natural Computation, ICNC 2012
Country/TerritoryChina
CityChongqing
Period29/05/1231/05/12

Keywords

  • Capacity flexibility
  • Genetic algorithms
  • Local search
  • Transit networks

Fingerprint

Dive into the research topics of 'Heuristic algorithms for capacity flexibility of urban transit networks'. Together they form a unique fingerprint.

Cite this