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 a formal system, Q. Define a Formal System? A Formal System is o...

Q. Define a Formal System? A Formal System is one which is planned in advance and is used according to schedule. In this system procedures and policies are documented well in a

What is assembler, What is Assembler An assembler is a program which ta...

What is Assembler An assembler is a program which takes as input a symbolic language program and produces output as its binary machine language equivalent. The input is known a

Define colgroup tag, COLGROUP defines a group of columns in table and...

COLGROUP defines a group of columns in table and allows you to set properties of those columns. goes immediately after tag and before an

What are desirable features of an electronic market place, What are the des...

What are the desirable features of an Electronic Market Place? Features of an Electronic Market Place: 1. Its electronic and business center is not a physical building qu

Why are binary, Q. Why are binary, octal and hexadecimal used for computer ...

Q. Why are binary, octal and hexadecimal used for computer applications? Q. Perform the following: (189.3) 10 = (?) 2

C++, program to find area under the curve y=f(x) between x=a and y=b , inte...

program to find area under the curve y=f(x) between x=a and y=b , integrate y=f(x)between limits of a and b

Assignment, Find the Regular Grammar for the following Regular Expression: ...

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

Explain logical shift micro-operations, Q. Explain logical shift Micro-oper...

Q. Explain logical shift Micro-operations? In logical shift data entering by serial input to left most or right most flip-flop (which depends on right or left shift operations

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

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