cs440 computer science seminar introduction to evolutionary computing
TRANSCRIPT
![Page 1: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/1.jpg)
CS440 Computer Science Seminar
Introduction to Evolutionary Computing
![Page 2: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/2.jpg)
![Page 3: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/3.jpg)
Adaptation to environment
![Page 4: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/4.jpg)
Traveling salesman problem• A salesperson must visit clients in different cities, and
then return home. What is the shortest tour through those cities, visiting each one once and only once?
• No known algorithms are able to generate the best answer in an amount time that grow only as a polynomial function of the number of elements (cities) in the problem.
• Belongs in the NP-hard class of problems, where NP stands for non-deterministic polynomial. For 100 cities, there are over 10155 different possible paths through all cities. The Universe is only 1018 seconds old!
![Page 5: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/5.jpg)
Evolution Algorithm
![Page 6: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/6.jpg)
Steps of evolutionary approach to discovering solutions
• Choosing the solution representation
• Devising a random variation operator
• Determining a rule for solution survival
• Initialization the population
![Page 7: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/7.jpg)
Solving the traveling salesman problem: 1. Solution representation, 2. Devising random variation operator
![Page 8: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/8.jpg)
Solving the traveling salesman problem: 3. Determining the rule for solution survival, 4. Initialize the population
• Rule for survival: survival of the fittest—the least total distance traveled.
• Initial population: in this case, chosen completely at random from the space of possible solutions.
![Page 9: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/9.jpg)
The best result of the 1st generation for the 100-city traveling salesman problem
![Page 10: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/10.jpg)
The best result of the 500th generation for the 100-city traveling salesman problem
![Page 11: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/11.jpg)
The best result of the 1000th generation for the 100-city traveling salesman problem
![Page 12: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/12.jpg)
The best result of the 4000th generation for the 100-city traveling salesman problem
![Page 13: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/13.jpg)
Drug design using evolutionary algorithm
![Page 14: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/14.jpg)
Evolutionary algorithm in high-level chess game
![Page 15: CS440 Computer Science Seminar Introduction to Evolutionary Computing](https://reader030.vdocuments.us/reader030/viewer/2022032606/56649eb45503460f94bbcd97/html5/thumbnails/15.jpg)
To probe further
• What is revolutionary computation, IEEE Spectrum, Feb. 2000
• How to solve It: Modern Heuristics, Zbigniew Michalewicz, Springer, 2000
• Evolution, Neural Networks, Games, and Intelligence, Kumar and Fogel, Proceedings of IEEE Vol. 87, no 9, pp. 1471-96, Sept. 1999