Enhanced Genetic Algorithm for Selecting Traffic Counting Location

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.