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

Minimis logic function using K-map, Minimise the logic function F (A, B, C,...

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15) Use Karnaugh map.   Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15) F'=B'D+B'C+AC+AB'

Adder substractor, how can we bimpliment half substractor using nand gate

how can we bimpliment half substractor using nand gate

How do you control instructions like branch, How do you control instruction...

How do you control instructions like branch, cause problems in a pipelined processor? Pipelined processor gives the best throughput for sequenced line instruction. In branch in

Write an xpath expression, Question: (a) Explain the five different t...

Question: (a) Explain the five different types of element content defined by DTDs. (b) Compare XML schema's against DTDs. (c) Consider the following two element decla

What is pipelining, What is pipelining? It is a method of decomposing a...

What is pipelining? It is a method of decomposing a sequential process into sub-operations, with each sub-process being implemented in a special dedicated segment that operates

Principles for developing successful system, Q. Principles for developing s...

Q. Principles for developing successful system? (1)  Both developers and customers must be involved for accuracy in the information. (2)  A problem solving approach must be

Define asynchronous bus, Define asynchronous bus. Asynchronous buses ar...

Define asynchronous bus. Asynchronous buses are the ones in which every item being transferred is accompanied by a control signal that shows its presence to the destination uni

Define the register addressing mode, Q. Define the Register Addressing mode...

Q. Define the Register Addressing mode? When operands are taken from registers implicitly or explicitly it is known as register addressing. These operands are termed as regis

Define system space, Define system space.  Management routines are part...

Define system space.  Management routines are part of the operating system of the computer. It is suitable to assemble the OS routines into a virtual address space.

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