Example application - canonical genetic algorithm, Computer Engineering

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.

Posted Date: 1/12/2013 6:24:26 AM | Location : United States







Related Discussions:- Example application - canonical genetic algorithm, Assignment Help, Ask Question on Example application - canonical genetic algorithm, Get Answer, Expert's Help, Example application - canonical genetic algorithm Discussions

Write discussion on Example application - canonical genetic algorithm
Your posts are moderated
Related Questions
1)    Describe challenges involved for both the sender and the receiver in the communication process. 2)    Describe the purpose of a subject line in an email message and give gui

OLAP can process difficult queries and give the output in less than 0.1 seconds, for it to achieve like performance OLAP uses aggregations. Aggregations are built by aggregating an

Closed System: It's isolated from environment influences. It operates on factors within System itself. It is also described as a System which involves a feedback loop, a control e

for ticket reservation in trains for payroll processing for insurance database

This logbook should be used to record decisions, ideas, work done by your group on this assignment. Each group should keep one logbook, which must be submitted along with your sour


Define thread cancellation & target thread.  The thread cancellation is the task of terminating a thread before it has done. A thread that is to be cancelled is often referred

Control Dependence Segments or Instructions in a program may obtain control structures. Thus, dependency between the statements can also be in control structures. But the order

What is "at exit-command:? The flow logic Keyword at EXIT-COMMAND is a special addition to the MODULE statement in the Flow Logic .AT EXIT-COMMAND lets you call a module befor

Minimize the logic function Y(A, B, C, D) = ∑m(0,1,2,3,5,7,8,9,11,14). Use  Karnaugh map. Draw logic circuit for the simplified function. Ans: In following figure (a) shows the