Evolutional ant colony method using PSO

Nobuto Morii; Eitarou Aiyoshi

doi:10.1541/ieejeiss.131.1038

Evolutional ant colony method using PSO

Nobuto Morii, Eitarou Aiyoshi

Department of Applied Physics and Physico-Informatics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	1038-1042
Number of pages	5
Journal	IEEJ Transactions on Electronics, Information and Systems
Volume	131
Issue number	5
DOIs	https://doi.org/10.1541/ieejeiss.131.1038
Publication status	Published - 2011

Keywords

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

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1541/ieejeiss.131.1038

Cite this

@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

SN - 0385-4221

VL - 131

SP - 1038

EP - 1042

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

IS - 5

ER -

Evolutional ant colony method using PSO

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this