The Knapsack Problem & Genetic Algorithms - Computerphile

Показать описание

Tournament selection, roulette selection, mutation, crossover - all processes used in genetic algorithms. Dr Alex Turner explains using the Knapsack Problem.

This video was filmed and edited by Sean Riley.

Рекомендации по теме

Комментарии

I was taught by Alex in my first year at the University of Hull; he was always such a kind, interesting, and intelligent lecturer. I'm glad to see his prowess shown off to the world here.

OfficialFraq

Finally I can work out what loot to take in Skyrim.

Kydos

Usually it takes me two hours to pack my bags

Now it'll take hundreds of generations

Brunoenribeiro

Genetic algorithms are cool. I wrote one in college to find patterns in Conway's game of life that resulted in the densest and longest lasting sequences. It's horribly slow, even on 10 threads, and I've never seen it reach the ideal on anything bigger than a 15x15 grid, but it always produces fun results.

DieMiinz

Bergen: a special backpack used by the Brittish military. Looks like a daypack. From the name of the manufacturer. "As for the nickname, “Bergan” is an adaptation of the name of the Norwegian backpack manufacturer Bergans, "

Ensorcle

It'd be nice to have a second episode on this discussing GA and local maxima.

Kingsly

8:57 - Sean took the words out of my mouth (or thought out of my head 🤔); this makes more sense when dealing with a large number of items and variables, otherwise it's more efficient to just brute-force the permutations. Back in the day, when I was trying to figure out the best way to put files on floppy disks (and later, CDs) to minimize wasted space, I just did it manually.

vnceigz

This was GREAT! I'm currently teaching Binary Search & Bitwise operations - tgis seems an IDEAL problem to hack in Python before attempting it in Assembly then attempting to establish its time complexity.

bensmith

The main problem with all these heuristic algorithms is the vast number of metaparameters that need to be adjusted for them to be efficient and the fact that there is no a priori way to make an informed decision on which initial values are likely to be ok for the specific problem at hand.

KilgoreTroutAsf

Great presentation. You are so right about ga’s. They are fun to work with and sometimes can find interesting solutions to hard problems. Around 20 years ago I published a series of articles developing ga’s to break ciphers. One was a paper on using ga’s to break the knapsack cipher which true to form showed some promising results.

richardspillman

This sounds like an alternative for what I learned on optimizing course for mechanical engineers. Simplex algorithm which conveniently matlab was happy to do for me if I presented a couple of base functions like objective function. Very interesting stuff.

Yupppi

I was wondering about genetic algorithms this week! Glad to see a computerphile episode about it now!

simjans

Knapsack? You can do it with Dynamic Programming. Also, computerphile you need to do an entire series on Dynamic Programming

ShubhamBhushanCC

I did my dissertation project on evolutionary algorithms in python and I can say this video is very well done thank you guys 😁

thepaulanator

Self brag here. Got 100% grade in Alex's AI module last year. Was super fun, had to program our very own GA to address the coupled inverted pendulum stabilization problem. Looking forward to going to a PG level and studying more AI!

jordan