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

Define dynamic loading, Define dynamic loading. To get better memory-sp...

Define dynamic loading. To get better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded unless it is called. All routines are kept

Explain hardwired control organization, Q. Explain Hardwired control organi...

Q. Explain Hardwired control organization? In the hardwired organization control unit is designed as a combinational circuit. The control unit is applied by gates, flip-flops,

What is sensitivity list, What is sensitivity list? A list of signals w...

What is sensitivity list? A list of signals which trigger execution of the block when they change value. Sensitivity list  indicates that when a change occurs to any one of

Target - data phase, Target abort -computer architecture: Usually, a t...

Target abort -computer architecture: Usually, a target holds DEVSEL# asserted through the final data phase. However, if a target desserts DEVSEL# before disconnecting without

How to creating a key pair, How to Creating a Key Pair You can make a...

How to Creating a Key Pair You can make a key pair using the Strong Name tool (Sn.exe). Key pair files usually have an .snk extension. To create a key pair at the command

Give brief description about arithmetic processing unit, Give brief descrip...

Give brief description about arithmetic processing unit To execute the arithmetic operations there is a separate section known as arithmetic processing unit in CPU. The arithme

Transition table for sequential circuits, sovling questions on transition t...

sovling questions on transition table for sequential circuits

Explain naming convention in arrays, Explanation Arrays in many programm...

Explanation Arrays in many programming-languages generally show a fixed list of values (e.g. a list of lastnames). Though within SQABasic the size for an array can either be fix

Existential elimination, Existential Elimination : Now we have a sente...

Existential Elimination : Now we have a sentence, A, is with an  existentially quantified variable, v, so then just for every constant symbol k, that it does not appear anywhe

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