Elitist ant system for route allocation problem

Authors:
Sorin C. Negulescu;Constantin Oprean;Claudiu V. Kifor;Ilie Carabulea
Affiliations:
Faculty of Engineering, "Lucian Blaga" University of Sibiu, Sibiu, Romania;Faculty of Engineering, "Lucian Blaga" University of Sibiu, Sibiu, Romania;Faculty of Engineering, "Lucian Blaga" University of Sibiu, Sibiu, Romania;Faculty of Engineering, "Lucian Blaga" University of Sibiu, Sibiu, Romania
Venue:
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
Year:
2008

Citing 6
Cited 0

The origin of nest complexity in social insects

Complexity
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Whistling in the dark: cooperative trail following in uncertain localization space

AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
MAX-MIN Ant system

Future Generation Computer Systems
Multi-agent coordination and control using stigmergy

Computers in Industry
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

As Multi-Agent Systems (MAS) have gained their place in the artificial intelligence field by proving their effectiveness in solving optimisation problems, this paper presents a new approach for a hard and well-known problem: vehicle route allocation. After a brief introduction about the MAS and stigmergy in section one, the paper presents the rationale (section two) where Ant Colony Optimisation (ACO) and its common extensions such as Elitist Ant System (EAS), Max-Min Ant System (MMAS), Rank-Based Ant System (ASrank) and others are described, and the approach (section three) where the reasons for choosing EAS as starting algorithm and the steps that must be followed in order to adapt EAS for solving the Route Allocation Problem (RAP) are presented. The resulted algorithm is depicted in section four. The paper concludes that the approach proved to be workable on usual configurations and effective in dealing with combinatorial explosion usually encountered in optimisation problems.