Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > I. Computing Methodologies  > I.6 SIMULATION AND MODELING 
GLOBAL MEMORY STRUCTURE FOR ANT COLONY OPTIMIZATION ALGORITHMS
By: Ángel Goñi, Paula Cordero (4477 reads)
Rating: (1.00/10)

Abstract: Ant Colony Optimization (ACO) is a computer emergence model to solve problems by swarm intelligence. The aim of this paper is to provide ant colonies with a global memory structure (GMS) so that the time needed to resolve a problem decreases drastically. In the past few years ACO have become a strong alternative to classic algorithms. However, the biggest disadvantage of ACO is the lack of structures which can provide every individual of the population with simple memory mechanisms. The GMS presented in this paper is applied to cleaner robots that must search a gallery looking for piles of marks and clean them. It is based on the variation of the common map by deleting all the superfluous nodes which appears as the resolution of the problem progresses. A node is considered as superfluous when it is useless for every ant and it delays every route of the colony. All the robots must share and update the GMS when they find any superfluous node. The extra process charge needed for executing the memory in parallel to ant’s activities is absorbed by the time saved in the resolution of the problem which depends on the characteristics of the map and its abstracted graph.

Keywords: Ant Colony Optimization, Swarm Intelligence, Memory.

ACM Classification Keywords: I.6. Simulation and Modelling, B.7.1 Advanced Technologies, I.2.8 Problem Solving, I.2.11 Distributed Artificial Intelligence

Link:

GLOBAL MEMORY STRUCTURE FOR ANT COLONY OPTIMIZATION ALGORITHMS

Ángel Goñi, Paula Cordero

http://www.foibg.com/ibs_isc/ibs-11/ibs-11-p16.pdf

Print
I.6 SIMULATION AND MODELING
article: About convergence of fuzzy perceptive elements sequences, defined on ... · METHOD FOR CONTROLLING STATE CHANNEL WIRELESS NETWORKS UNDER A PRIORI ... · PROBLEM OF RESTORING THE FUNCTIONS-SIGNALS BY FINITE SET OF DATA WITH ERRORS · SOME APPROACHES TO THE DEVELOPMENT OF ANALYTICAL MODEL FOR THE RESEARCH ... · MICRORAM: A SIMULATION MODEL OF A COLONY OF BACTERIA EVOLVING INSIDE ... · MODELING AND OPTIMIZATION OF CRYOGENIC – OPTICAL GRAVIMETERS · ЛИНГВИСТИЧЕСКИЕ И ИНТЕЛЛЕКТУАЛЬНЫЕ ИНСТРУ� · CELLULAR COMPUTING: TOWARDS AN ARTIFICIAL CELL · SIMULATION OF BIOLOGICAL MODELS USING CAD TOOLS: NEEDS AND FUTURE · BIOLOGICAL PROCESSES STUDIES THROUGH SOFTWARE TOOLS:... · MODELING, SIMULATION AND APPLICATION OF BACTERIAL TRANSDUCTION IN ... · ABOUT POSSIBILITY-THEORETICAL METHOD OF PIECEWISE-LINEAR APPROXIMATION ... · PARETO-OPTIMUM APPROACH TO MATHEMATICAL MODELING OF ODOURS IDENTIFICATION ... · ОБОБЩЕНИЯ ПРИНЦИПОВ РАСПРЕДЕЛЕНИЯ ЗАТРАТ Д · ENERGY-EFFICIENT PROTOCOL IN OMNET++ SIMULATION ENVIRONMENT · SELF-ORGANIZING ROUTING ALGORITHM FOR WIRELESS SENSORS NETWORKS (WSN) USING ... · GLOBAL MEMORY STRUCTURE FOR ANT COLONY OPTIMIZATION ALGORITHMS · SIMULATION OF DNA CUTTING · COLLISION DETECTION AND TREATMENT USING 2D RECONFIGURABLE HARDWARE · APPLICATION OF PARETO OPTIMIZATION APPROACH TO OBSERVABILITY PROBLEM ... · INDIVIDUALLY OPTIMAL PRINCIPLES OF DISTRIBUTION OF GREENHOUSE GAS EMMISION QUOT · GENE CODIFICATION FOR NOVEL DNA COMPUTING PROCEDURES · AN ONTOLOGY-BASED APPROACH TO THE INCOMPLETE SIMULATION MODEL ... · REDUCTION MEASUREMENTS FOR CALCULATION IN FUZZY EXPERIMENT SCHEME · A DNA CODIFICATION FOR GENETIC ALGORITHMS SIMULATION · GLOBAL MEMORY STRUCTURE FOR ANT COLONY OPTIMIZATION ALGORITHMS · SIMULATION OF DNA CUTTING · PROGNOSTICATION OF EFFICIENCY OF MEDICAL AND PROPHYLACTIC ... · STATISTICAL MODELING OF SPREAD OF OPTICAL FIELDS IN FIRES · DNA SIMULATION OF GENETIC ALGORITHMS: FITNESS COMPUTATION1 · SOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION ... · DYNAMIC DISTRIBUTION SIMULATION MODEL OBJECTS ... ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.57MB ]   [ GZIP Disabled ]   [ Server load: 0.34 ]
Powered by Tikiwiki CMS/Groupware