Abstract
In this work, one heuristic methodfor combinatory optimization,known as Genetic Algorithm, ispresented. Above mentionedmethod is based on the principlesof selection and survival of thefittest individuals enunciated byDarwin. Different aproximations toTSP (Traveling Salesman Problem)are studied, using mentionedmethodology, and showing theresults of many experimentsmade with towns in Gipuzkoa.
| Translated title of the contribution | Genetic algorithms for the travelling salesman problem: Searching for the best tour in Guipúzcoa |
|---|---|
| Original language | Other |
| Pages (from-to) | 10-30 |
| Journal | Elhuyar |
| Volume | 22 |
| Issue number | 2 |
| Publication status | Published - 1996 |
| Externally published | Yes |