Enhanced Genetic Algorithm for Selecting Traffic Counting Location

Author

Yang, Chao ; Liu, Qi

Author_Institution

Sch. of Transp. Eng., Tongji Univ., Shanghai

fYear

2009

fDate

23-24 May 2009

Firstpage

1

Lastpage

6

Abstract

This paper proposed two traffic counting location problems for origin-destination (O-D) trip matrix estimation in a transportation network. Decision variables of problems are all binary integers. The problems are formulated as binary integer programming problems. Enhanced genetic algorithm (EGA) is employed to solve the problems. Heuristic-based invader operators are designed for two problems in EGA. The characteristic of EGA is analyzed and compared with conventional genetic algorithm by numerical examples of six cases. The results show that EGA performs well for all cases without the need to pre-define any parameter as compared to the conventional genetic algorithm.

Keywords

genetic algorithms; integer programming; matrix algebra; transportation; binary integer programming problems; binary integers; decision variables; enhanced genetic algorithm; heuristic-based invader operators; origin-destination trip matrix estimation; traffic counting location; transportation network; Algorithm design and analysis; Chaos; Communication system traffic control; Genetic algorithms; Genetic engineering; Linear programming; Roads; Telecommunication traffic; Traffic control; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-3893-8

Electronic_ISBN

978-1-4244-3894-5

Type

conf

DOI

10.1109/IWISA.2009.5072848

Filename

5072848