2005•Transactions of the Society of Instrument and Control EngineersOpen access

Consideration on Distributed Parallel Processing of Queen Ant Strategy by Ant Colony Optimization in Traveling Salesman Problem

Ichiro Iimura, Toshiya Ito, Koji HAMAGUCHI, Shigeru Nakayama

Abstract

This paper proposes a distributed parallel processing of Queen Ant Strategy named “ASqueen” which imitated an ant society which a queen ant governs. It is noted that the proposed processing method satisfies “shortening of average time for search” and “improvement of searching ability” at the same time in the seventy-six cities' configuration of TSPLIB.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Travelling salesman problem, Ant colony optimization algorithms, ANT, Queen (butterfly), Ant colony, Parallel metaheuristic, Computer science, Metaheuristic