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 -