Traffic Simulator Calibration

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Particle Swarm Optimization (PSO)
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Computational Modelling of Road Traffic SS Computational Project by David Clarke Supervisor Mauro Ferreira - Merging Two Roads into One As economies grow.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Particle Swarm Optimization Algorithms
Genetic Algorithm.
Efficient Model Selection for Support Vector Machines
Swarm Intelligence 虞台文.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Comparison of Differential Evolution and Genetic Algorithm in the Design of a 2MW Permanent Magnet Wind Generator A.D.Lilla, M.A.Khan, P.Barendse Department.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Optimal Placement of Wind Turbines Using Genetic Algorithms
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
Last lecture summary. SOM supervised x unsupervised regression x classification Topology? Main features? Codebook vector? Output from the neuron?
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
A demonstration of distribution-based calibration Ioulia MARKOU, Vasileia PAPATHANASOPOULOU, Constantinos ANTONIOU National Technical University of Athens,
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Advanced Computing and Networking Laboratory
School of Computing Clemson University Fall, 2012
Evolutionary Algorithms Jim Whitehead
Scientific Research Group in Egypt (SRGE)
Bulgarian Academy of Sciences
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Digital Optimization Martynas Vaidelys.
Particle Swarm Optimization
Whale Optimization Algorithm
Meta-heuristics Introduction - Fabien Tricoire
آموزش شبکه عصبی با استفاده از روش بهینه سازی PSO
A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.
A Study of Genetic Algorithms for Parameter Optimization
A Brief Introduction of RANSAC

Artificial Intelligence (CS 370D)
Comparing Genetic Algorithm and Guided Local Search Methods
Multi-band impedance matching using an evolutionary algorithm
CS621: Artificial Intelligence
metaheuristic methods and their applications
Optimization with Meta-Heuristics
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
Calibration and Validation
Design & Analysis of Algorithms Combinatorial optimization
Lecture 2 Part 3 CPU Scheduling
A car is decelerated to 20 m/s in 6 seconds
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Introduction to Genetic Algorithm and Some Experience Sharing
SWARM INTELLIGENCE Swarms
Presentation transcript:

Traffic Simulator Calibration Dr. Baker Abdalhaq

Outline Traffic simulators Calibration Calibration methods GA, TS, PS,SPSA Some results Further work

Traffic Simulators/models Macroscopic Flow -Physics Microscopic Every single vehicle (physical+ behavioral) Mesoscopic queue Sub-Microscopic Engine rotation speed, driver gear switch…etc.

Calibration Good input -> good outputs Some parameters are difficult to be obtained or estimated. Calibration is optimization simulator input output Minimize error Error (difference) Real world observations variables

Calibration Methods Classical Heuristic Gradient based Simplex (Nelder-Mead, COBYLA) Heuristic Genetic Tabu Particle Swarm SPSA

Genetic Randomly generate the first population of individuals potential solutions Evaluate the fitness function for each population member While not ( number of iteration reached) : obtain a new generation by repeat Selection of two individuals (or more) Crossover of selected individuals According the mutation probability, randomly mute the output of previous step. Until a new population has been completed. end while

Particle Swarm // initial swarm usually random for each particle : for each dimension i // calculate velocity // update particle position While stop criteria not reached, Go to step 02

Simplex

Taboo Generate initial solution θ While not finished End wile identify N(θ) (Neighborhood set) by applying moves Identify T(θ) (tabu set) identify A(θ) (aspiration set) choose θ' in N(θ)-T(θ) U A(θ), for which f(θ') is optimal change θ by θ' End wile

SPSA Step 1: Initialization Set k=0 Pick initial guess of and nonnegative coefficients (a,c,A,α and )   Step 2: Generation of Simultaneous Perturbation Vector Generate which is a Bernoulli distribution with probability of 0.5 for each +1 or -1 outcome Step 3: Loss Function Evaluations Obtain two measures of the function: and Step 4: Gradient Approximation Step 5: Update estimate Step 6: iteration or termination If termination condition not met, return to step 2 with k+1 replacing k.

SUMO input parameters Parameter Max Min unit Description Sigma 1 0.0 - Driver imperfection Acceleration 0.3* 2.9* m/s^2 Ability of the car to accelerate Deceleration 0.5* 4.9* m/s^2 Ability of the car to decelerate Length 2 10 m Car length with leading gap Max speed 120 10 km/h Max allowed speed

Parameter Selection Parameter Correlation (5'000 random runs) Parameter Importance index (PII) (formula 7) (5'000 random runs) Length -0.06 0.95 Deceleration -0.11 0.86 Sigma 0.15 0.84 Acceleration -0.23 0.7 Max speed -0.02 0.63

Error Measurement

Site 1

Algorithms Performance Comparison Minimum fitness Maximum fitness Average fitness Number of Fitness function executions GA1 0.076 0.096 0.087 1250 GA2 0.071 0.105 0.090 PS 0.098 0.079 1034 dTS 0.066 0.089 1000 sTS 0.083 SPSA 0.069 0.077 0.073 NM(Globalized) 0.117 0.104 1240 COBYLA(Globalized) 0.124 1220

Comparison results

Site 2

Algorithm Minimum fitness Maximum fitness Average fitness Number of Fitness function executions GA2 0.103 0.184 0.146 1250 GA1 0.130 0.175 0.154 PS 0.144 1034 dTS 0.166 1000 sTS SPSA 0.167 NM(Globalized) 0.164 0.229 0.187 1239 COBYLA(Globalized) 0.156 0.205 0.172 1297

Further work Comparing Algorithms using other problems Minimizing Co2 by changing traffic light schedule