Ichiro Iimura

Learn More
In this paper, an approach based upon Genetic Recombination is proposed, and applied to the Traveling Salesman Problem (TSP). The algorithm is composed of two Sample Genetic Algorithms (SGAs) which only consist of the basic genetic operators such as selection, crossover and mutation. One of the SGAs is named as the Global Genetic Algorithm (GGA), and(More)
This paper proposes a distributed parallel processing of Queen Ant Strategy named "ASqueen" which imitated an ant society where a queen ant governs. It is noted that the proposed processing method achieves "shortening of average time for search" and "improvement of searching ability" at the same time in seventy-six cities’ configuration of traveling(More)
This paper discusses a parallel genetic algorithm (GA) which focuses on the local operator for Traveling salesman problem (TSP). The local operator is a simple GA named as Local Genetic Algorithm (LGA). The LGA is combined to another GA named as Global Genetic Algorithm (GGA). It increases the computational time running a GA as a local operator in another(More)
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum(More)
J. Summhammer introduced the physical concept of quantum entanglement into cooperatively pushing a pebble, which may be too heavy for one ant, by two insects (ants). According to his results, we have confirmed that the two ants with quantum entanglement, i.e., quantum-entangled ants, can push the pebble up to twice relative to independent (classical) ants.(More)
—The physical concept of quantum entanglement state was applied to cooperative behavior of two ants (agents) pushing a pebble, which is too heavy for one ant, developed by Summhammer. His conventional study showed that the two quantum-inspired ants imitating quantum entanglement state can push the pebble up to twice relative to the two classical ants in(More)
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum(More)
Ant colony optimization (ACO) methods, which imitate a mechanism of pheromone secretion when ants carry food to their nest, are one of efficient heuristic search methods for combinational optimization problems such as traveling salesman problems (TSPs) and so on. In this paper, we analyze the queen ant strategy AS<sub>queen</sub> that is one of ACO methods(More)
  • 1