Comments for "Genetic Algorithm solves Traveling Salesman problem" Video at VideoSift.com

By charliem

charliem (http://www.videosift.com/member/charliem) — Sun, 17 Feb 2008 22:14:08 -0800

Upvote purely because this is very close to how routers perform route fowarding decisions. Ie. This is how the internet would work if you could see routers calculating least cost paths to each destination in their route table.

By Doc_M

Doc_M (http://www.videosift.com/member/Doc_M) — Mon, 18 Feb 2008 21:49:22 -0800

Connect the dots. la lala lala
Connect the dots. la lala lala

By Smugglarn

Smugglarn (http://www.videosift.com/member/Smugglarn) — Tue, 19 Feb 2008 10:55:25 -0800

NO, NO, NO! GOD DID IT!

By HaricotVert

HaricotVert (http://www.videosift.com/member/HaricotVert) — Tue, 19 Feb 2008 11:38:53 -0800

That's pretty slick for an NP-hard problem.