A multiagent architecture for solving combinatorial optimization problems through metaheuristics

Authors:
Filipe Costa Fernandes;Sérgio Ricardo de Souza;Maria Amélia Lopes Silva;Henrique Elias Borges;Fábio Fernandes Ribeiro
Affiliations:
PPGMMC, CEFET/MG, Belo Horizonte, Brazil;PPGMMC, CEFET/MG, Belo Horizonte, Brazil;PPGMMC, CEFET/MG, Belo Horizonte, Brazil;PPGMMC, CEFET/MG, Belo Horizonte, Brazil;PPGMMC, CEFET/MG, Belo Horizonte, Brazil
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 9
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
An agent architecture for vehicle routing problems

Proceedings of the 2001 ACM symposium on Applied computing
The vehicle routing problem

The vehicle routing problem
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Introduction to Multiagent Systems

Introduction to Multiagent Systems
Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows

Applied Intelligence
MAGMA: a multiagent architecture for metaheuristics

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces MAM - Multiagent Architecture for Metaheuristics, whose objective is to combine metaheuristics, through the multiagent approach, for solving Combinatorial Optimization Problems. In this architecture, each metaheuristic is developed in the form of an autonomous agent, cooperatively interacting in an Environment. This interaction between one or more agents is carried out through information exchange in the search space of the problem, seeking to improve the same objective. MAM is a flexible architecture, which can be used for solving different optimization problems, without the need to rewrite algorithms. In this paper, the MAM architecture is specialized for Genetic Algorithm (GA), Iterated Local Search (ILS) and Variable Neighborhood Search (VNS) metaheuristics in order to solve the Vehicle Routing Problem with Time Windows (VRPTW). Computational tests were performed and results are presented, showing the effectiveness of the proposed architecture.