2013
Authors
Torrão, L; Queiros, SF; Teixeira, PM; Vilaça, JL; Rodrigues, NF;
Publication
IEEE 2nd International Conference on Serious Games and Applications for Health, SeGAH 2013, Vilamoura, Portugal, May 2-3, 2013
Abstract
2013
Authors
Pereira, I; Madureira, A; Moura Oliveira, PBd; Abraham, A;
Publication
Transactions on Computational Science XXI - Special Issue on Innovations in Nature-Inspired Computing and Applications
Abstract
In complexity theory, scheduling problem is considered as a NP-complete combinatorial optimization problem. Since Multi-Agent Systems manage complex, dynamic and unpredictable environments, in this work they are used to model a scheduling system subject to perturbations. Meta-heuristics proved to be very useful in the resolution of NP-complete problems. However, these techniques require extensive parameter tuning, which is a very hard and time-consuming task to perform. Based on Multi-Agent Learning concepts, this article propose a Case-based Reasoning module in order to solve the parameter-tuning problem in a Multi-Agent Scheduling System. A computational study is performed in order to evaluate the proposed CBR module performance. © 2013 Springer-Verlag Berlin Heidelberg.
2013
Authors
Pereira, I; Madureira, A; de Moura Oliveira, P;
Publication
Intelligent Systems, Control and Automation: Science and Engineering
Abstract
This paper proposes a novel agent-based approach to Meta-Heuristics self-configuration. Meta-heuristics are algorithms with parameters which need to be set up as efficient as possible in order to unsure its performance. A learning module for self-parameterization of Meta-heuristics (MH) in a Multi-Agent System (MAS) for resolution of scheduling problems is proposed in this work. The learning module is based on Case-based Reasoning (CBR) and two different integration approaches are proposed. A computational study is made for comparing the two CBR integration perspectives. Finally, some conclusions are reached and future work outlined. © 2013, Springer Science+Business Media Dordrecht.
2013
Authors
Madureira, A; Pereira, I; Abraham, A;
Publication
2013 WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC)
Abstract
In this paper an Artificial Bee Colony Approach for Scheduling Optimization is presented. The adequacy of the proposed approach is validated on the minimization of the total weighted tardiness for a set of jobs to be processed on a single machine and on a set of instances for Job-Shop scheduling problem. The obtained computational results allowed concluding about their efficiency and effectiveness. The ABC performance and respective statistical significance was evaluated.
2013
Authors
Madureira, A; Pereira, JP; Pereira, I;
Publication
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013)
Abstract
This paper addresses the developing of Learning-Assisted Intelligent Scheduling Systems that uses active learning by accumulation and interpretation of scheduling experience or even by observation of expert's decisions. The design of intelligent systems (IS) that learn with experts is a very hard and challenging domain because current systems are becoming more and more complex and subject to rapid changes. The model for the proposed system will be presented.
2013
Authors
Madureira, A; Pereira, I; Falcao, D;
Publication
ADVANCES IN INFORMATION SYSTEMS AND TECHNOLOGIES
Abstract
This paper presents a Swarm based Cooperation Mechanism for scheduling optimization. We intend to conceptualize real manufacturing systems as interacting autonomous entities in order to support decision making in agile manufacturing environments. Agents coordinate their actions automatically without human supervision considering a common objective - global scheduling solution taking advantages from collective behavior of species through implicit and explicit cooperation. The performance of the cooperation mechanism will be evaluated consider implicit cooperation at first stage through ACS, PSO and ABC algorithms and explicit through cooperation mechanism application.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.