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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
