Evolutional ant colony method using PSO

Nobuto Morii, Eitarou Aiyoshi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The ant colony method is one of heuristic methods capable of solving the traveling salesman problem (TSP), in which a better tour is generated by the artificial ant's probabilistic behavior. That is, the ant colony method is characterized by probability for the ant staying in the city to choice the city as the next touring city.

Original languageEnglish
Pages (from-to)1038-1042
Number of pages5
JournalIEEJ Transactions on Electronics, Information and Systems
Volume131
Issue number5
DOIs
Publication statusPublished - 2011

Fingerprint

Traveling salesman problem
Heuristic methods
Particle swarm optimization (PSO)

Keywords

  • Ant colony method
  • Evolutional method
  • Heuristic method
  • Particle swarm optimization
  • Traveling salesman problem

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Evolutional ant colony method using PSO. / Morii, Nobuto; Aiyoshi, Eitarou.

In: IEEJ Transactions on Electronics, Information and Systems, Vol. 131, No. 5, 2011, p. 1038-1042.

Research output: Contribution to journalArticle

Morii, Nobuto ; Aiyoshi, Eitarou. / Evolutional ant colony method using PSO. In: IEEJ Transactions on Electronics, Information and Systems. 2011 ; Vol. 131, No. 5. pp. 1038-1042.
@article{12a1c1135a0f4e15acf51f44ea48971d,
title = "Evolutional ant colony method using PSO",
abstract = "The ant colony method is one of heuristic methods capable of solving the traveling salesman problem (TSP), in which a better tour is generated by the artificial ant's probabilistic behavior. That is, the ant colony method is characterized by probability for the ant staying in the city to choice the city as the next touring city.",
keywords = "Ant colony method, Evolutional method, Heuristic method, Particle swarm optimization, Traveling salesman problem",
author = "Nobuto Morii and Eitarou Aiyoshi",
year = "2011",
doi = "10.1541/ieejeiss.131.1038",
language = "English",
volume = "131",
pages = "1038--1042",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "5",

}

TY - JOUR

T1 - Evolutional ant colony method using PSO

AU - Morii, Nobuto

AU - Aiyoshi, Eitarou

PY - 2011

Y1 - 2011

N2 - The ant colony method is one of heuristic methods capable of solving the traveling salesman problem (TSP), in which a better tour is generated by the artificial ant's probabilistic behavior. That is, the ant colony method is characterized by probability for the ant staying in the city to choice the city as the next touring city.

AB - The ant colony method is one of heuristic methods capable of solving the traveling salesman problem (TSP), in which a better tour is generated by the artificial ant's probabilistic behavior. That is, the ant colony method is characterized by probability for the ant staying in the city to choice the city as the next touring city.

KW - Ant colony method

KW - Evolutional method

KW - Heuristic method

KW - Particle swarm optimization

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=80052421695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052421695&partnerID=8YFLogxK

U2 - 10.1541/ieejeiss.131.1038

DO - 10.1541/ieejeiss.131.1038

M3 - Article

AN - SCOPUS:80052421695

VL - 131

SP - 1038

EP - 1042

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 5

ER -