Example application - canonical genetic algorithm, Computer Engineering

Assignment Help:

Example Application:

There are many fantastic applications of genetic algorithms. Conceivably my favorite is their usage in evaluating Jazz melodies done as part of a PhD project in Edinburgh.

However the one we look at here is chosen because it demonstrates how a fairly lightweight effort using GAs can often be highly effective. Hence in their paper "The Application of Artificial Intelligence to Transportation System Design", Ricardo Hoar and Joanne Penner explain their undergraduate project that involved representing vehicles on a road system as autonomous agents, and utilizing. In fact GA approaches to evolve solutions to the timing of traffic lights to increase there the traffic flow in the system. Therefore the optimum settings for where lights come on and go off is known only for very simple situations, so an AI-style search can be used to try and find good solutions. Hoar and Penner chose to do this in an evolutionary fashion. They don't give details of the representation scheme they used, but traffic light times are real-valued numbers, so they could have used a bit-string representation. 

Therefore the evaluation function they utilize involved the total waiting time and total driving time for each car in the system as follows like: 

137_Example Application.png

Hence the results they produced were good as worthy of writing a paper. So the two graphs below describe the decrease in overall waiting time for a simple road and for a more complicated road as albeit not amazingly complicated. 

We see that in both cases, the waiting time has roughly halved, which is a good result. In the first case, for the simple road system, the GA evolved a solution verysimilar to the ones worked out to be optimal by humans. We see that GAs can be used to find good near-optimal solutions to problems where a more cognitive approach might have failed as i.e., humans still can't work out how best to tune traffic light times, but a computer can evolve a good solution.


Related Discussions:- Example application - canonical genetic algorithm

How many lines of address bus used for memory of 2048 bytes, How many lines...

How many lines of address bus must be used to access 2048 bytes of memory when available RAM chips 128 × 8.  How many lines of these will be common to each chip? Ans. AS chips

How to clear a datagrid on a button click, How to clear a datagrid on a but...

How to clear a datagrid on a button click? You require to Clear the DataSource of the dataGrid. So try this: dataSet1.Clear(); dataGrid1.DataSource = dataSet1.TableNam

Insert images in dreamweaver, Q. Insert images in Dreamweaver? You will...

Q. Insert images in Dreamweaver? You will learn two methods to insert images in Dreamweaver-using Dreamweaver's main menu and using Objects panel. 1. Click anywhere in the l

Hashing collision resolution techniques, Hashing collision resolution techn...

Hashing collision resolution techniques are a) Chaining, b) Bucket addressing

Two ethernet switches sw1 and sw2 , Six machines H1, H2, ..., H6 are linked...

Six machines H1, H2, ..., H6 are linked by two Ethernet switches SW1 and SW2 as given below. Both switches have four ports drawn. The port numbers are as indicated. Suppose the two

How do you detect if two 8-bit signals are same, By using XNOR gate if the ...

By using XNOR gate if the signals are similar then only the output will be one otherwise not.

State about the data glove, State about the Data Glove  Data glove is u...

State about the Data Glove  Data glove is used to grasp a "virtual" object. The glove is constructed with a series of sensors that detect hand and finger motions. Electromagnet

Show the main drawback of cav disk, Q. Show the main drawback of CAV disk? ...

Q. Show the main drawback of CAV disk? The main drawback of CAV disk is that a lot of storage space is wasted because longer outer tracks are storing data only equal to the sho

What is hamiltonian path, What is Hamiltonian path?  A Hamiltonian path...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes through every node exactly once. We consider a special case of this problem whe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd