Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/44295
Title: Simulation times Vs. network size in a genetic algorithm based urban traffic optimization architecture
Authors: Sánchez-Medina, Javier 
Galán-Moreno, Manuel
Angulo-de-Ugarte, Néstor
Rubio-Royo, Enrique 
UNESCO Clasification: 120304 Inteligencia artificial
332703 Sistemas de transito urbano
Keywords: Genetic algorithms
Intelligent transport systems
Non deterministic optimization
Traffic modelling
Issue Date: 2008
Abstract: Our group has developed and successfully tested a new urban traffic lights optimization architecture. This architecture includes a standard Genetic Algorithm, a Cellular Automata based traffic simulator within the evaluation function, and a Beowulf Cluster. Every hypothetical solution is marked according to the statistics obtained from a traffic micro-simulation. So far, the duration of each simulation has been chosen without any formal restriction. With this paper, we want to share the first results and conclusions of our study regarding the simulation times against the traffic network size comparison. To do so, we have run a wide set of experiments with different scaled networks. For this paper, we have presented the results obtained with a small "lab network" and a big network taken from the real world - "Las Ramblas" in Santa Cruz de Tenerife, Spain. We have found a strong linear relationship among simulation times and fitness. It could mean big computing time savings for our system. This is particularly interesting for a future adaptation of the model to a dynamic environment, with real time restrictions.
URI: http://hdl.handle.net/10553/44295
ISBN: 978-1-60132-069-8
Source: Proceedings of the 2008 International Conference on Genetic and Evolutionary Methods, GEM 2008, p. 255-261
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

2
checked on Dec 29, 2024

Page view(s)

96
checked on Nov 30, 2024

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.