Algoritmo genetikoak saltzaile ibiltariaren probleman

Gipuzkoako bira egokiaren atzetik

Translated title of the contribution: Genetic algorithms for the travelling salesman problem: Searching for the best tour in Guipúzcoa

Research output: Contribution to journalArticleProfessional

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.
Original languageOther
Pages (from-to)10-30
JournalElhuyar
Volume22
Issue number2
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Travelling salesman problems
Genetic Algorithm
Heuristics
Optimization

Cite this

@article{7067705672374a54aa667919f9500a70,
title = "Algoritmo genetikoak saltzaile ibiltariaren probleman: Gipuzkoako bira egokiaren atzetik",
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.",
author = "Cindy Kuijpers",
year = "1996",
language = "Other",
volume = "22",
pages = "10--30",
journal = "Elhuyar",
issn = "0213-3687",
number = "2",

}

Algoritmo genetikoak saltzaile ibiltariaren probleman : Gipuzkoako bira egokiaren atzetik. / Kuijpers, Cindy.

In: Elhuyar, Vol. 22, No. 2, 1996, p. 10-30.

Research output: Contribution to journalArticleProfessional

TY - JOUR

T1 - Algoritmo genetikoak saltzaile ibiltariaren probleman

T2 - Gipuzkoako bira egokiaren atzetik

AU - Kuijpers, Cindy

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

M3 - Article

VL - 22

SP - 10

EP - 30

JO - Elhuyar

JF - Elhuyar

SN - 0213-3687

IS - 2

ER -