#!/usr/bin/env python # coding: utf-8 #
# # Using genetic algorithms to solve the traveling salesperson problem # ## Luis Martí, [IC](http://www.ic.uff.br)/[UFF](http://www.uff.br) # # [http://lmarti.com](http://lmarti.com); [lmarti@ic.uff.br](mailto:lmarti@ic.uff.br) # # [Advanced Evolutionary Computation: Theory and Practice](http://lmarti.com/aec-2014) # The notebook is better viewed rendered as slides. You can convert it to slides and view them by: # - using [nbconvert](http://ipython.org/ipython-doc/1/interactive/nbconvert.html) with a command like: # ```bash # $ ipython nbconvert --to slides --post serven cities | time # |
---|---|
10 | 3 secs # |
12 | 3 secs × 12 × 11 = 6.6 mins # |
14 | 6.6 mins × 13 × 14 = 20 hours # |
24 | 3 secs × 24! / 10! = 16 billion years # |