Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Swarm intelligence
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
The Assignment Problem with Seniority and Job Priority Constraints
Operations Research
Selected topics on assignment problems
Discrete Applied Mathematics
A multiagent genetic algorithm for global numerical optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Inspired by the information interaction of individuals in swarm intelligence, a new algorithm for combinatorial optimization is proposed, which is called as Route-Exchange Algorithm (REA). This is a heuristic approach, in which the individuals of the swarm search the state space independently and simultaneously. When one encounters another in the process, they would interact with each other, exchange the information of routes toured, and utilize the more valuable experiences to improve their own search efficiency. An elite strategy is designed to avoid vibrations. The algorithm has been applied to Traveling Salesman Problem (TSP) and assignment problem in this paper. Some benchmark functions are tested in the experiments. The results indicate the algorithm can quickly converge to the optimal solution with quite low cost.