2008Journal of Transportation Engineering and InformationRequires access

Improved Optimization Algorithm of Transit Route Network

Wenquan Li

Open publisher page 1 citations

Abstract

In order to shorten residents’ travel time and reduce the operation cost of public transportation,the genetic algorithm is often adopted to optimize the transit network due to its global optimality. However,some drawbacks of this algorithm have received severe criticism. An improved genetic algorithm is proposed,which makes some progress in selection operator,crossover operator,mutation operator and the stop criterion of a simple genetic algorithm,and in transit route optimal choice of public transportation by decreasing the search space,adding optimal reserved and revised strategies. This proposed genetic algorithm could ensure the population diversity and accelerate its convergence; furthermore,it could avoid the phenomena of premature and slow the evolution obviously. A numerical simulation was then presented to demonstrate that this improved genetic algorithm is much more efficient than the simple one and highlights its potential applications in the optimization of transit network.

About this research paper

What this paper is about

In order to shorten residents’ travel time and reduce the operation cost of public transportation,the genetic algorithm is often adopted to optimize the transit network due to its global optimality. However,some drawbacks of this algorithm have received severe criticism. An improved genetic algorithm is proposed,which makes some progress in selection operator,crossover operator,mutation operator and the stop criterion of a simple genetic algorithm,and in transit route optimal choice of public transportation by decreasing the search space,adding optimal reserved and revised strategies. This proposed genetic algorithm could ensure the population diversity and accelerate its convergence; furthermore,it could avoid the phenomena of premature and slow the evolution obviously. A numerical simulation was then presented to demonstrate that this improved genetic algorithm is much more efficient than the simple one and highlights its potential applications in the optimization of transit network.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to shorten residents’ travel time and reduce the operation cost of public transportation,the genetic algorithm is often adopted to optimize the transit network due to its global optimality. However,some drawbacks of this algorithm have received severe criticism. An improved genetic algorithm is proposed,which makes some progress in selection operator,crossover operator,mutation operator and the stop criterion of a simple genetic algorithm,and in transit route optimal choice of public transportation by decreasing the search space,adding optimal reserved and revised strategies. This proposed genetic algorithm could ensure the population diversity and accelerate its convergence; furthermore,it could avoid the phenomena of premature and slow the evolution obviously. A numerical simulation was then presented to demonstrate that this improved genetic algorithm is much more efficient than the simple one and highlights its potential applications in the optimization of transit network.

Key concepts: Crossover, Mathematical optimization, Genetic algorithm, Genetic operator, Public transport, Operator (biology), Computer science, Population

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved Optimization Algorithm of Transit Route Network — Research Paper | ScholarLens