|Total results: 376||
|Recent Algorithms and Applications in Swarm Intelligence Research
Advancements in the nature-inspired swarm intelligence algorithms continue to be useful in solving complicated problems in nonlinear, non-differentiable, and un-continuous functions as well as being applied to solve real-world applications.Recent Algorithms and Applications in Swarm Intelligence...
Scatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem
Rafael Martí, Juan-José Pantrigo, Abraham Duarte, Vicente Campos, Fred Glover.
Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the...
A Complementary Cyber Swarm Algorithm
Peng-Yeng Yin, Fred Glover, Manuel Laguna, Jia-Xian Zhu.
A recent study (Yin et al., 2010) showed that combining particle swarm optimization (PSO) with the strategies of scatter search (SS) and path relinking (PR) produces a Cyber Swarm Algorithm that creates a more effective form of PSO than methods that do not incorporate such mechanisms. This paper...
Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search
Volodymyr P. Shylo, Oleg V. Shylo.
In this paper, the potential of the path relinking method for the maximum cut problem is investigated. This method is embedded within global equilibrium search to utilize the set of high quality solutions provided by the latter. The computational experiment on a set of standard benchmark problems is...
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem
Tabitha James, Cesar Rego.
This paper introduces a new path relinking algorithm for the well-known quadratic assignment problem (QAP) in combinatorial optimization. The QAP has attracted considerable attention in research because of its complexity and its applicability to many domains. The algorithm presented in this study...
A Multiobjective Particle Swarm Optimizer for Constrained Optimization
Gary G. Yen, Wen-Fung Leong.
Constraint handling techniques are mainly designed for evolutionary algorithms to solve constrained multiobjective optimization problems (CMOPs). Most multiojective particle swarm optimization (MOPSO) designs adopt these existing constraint handling techniques to deal with CMOPs. In the proposed...
Chaos-Enhanced Firefly Algorithm with Automatic Parameter Tuning
Many metaheuristic algorithms are nature-inspired, and most are population-based. Particle swarm optimization is a good example as an efficient metaheuristic algorithm. Inspired by PSO, many new algorithms have been developed in recent years. For example, firefly algorithm was inspired by the flashing...
An Optimization Algorithm Based on Brainstorming Process
In this paper, the human brainstorming process is modeled, based on which two versions of Brain Storm Optimization (BSO) algorithm are introduced. Simulation results show that both BSO algorithms perform reasonably well on ten benchmark functions, which validates the effectiveness and usefulness of the...
Swarm Intelligence for Non-Negative Matrix Factorization
Andreas Janecek, Ying Tan.
The Non-negative Matrix Factorization (NMF) is a special low-rank approximation which allows for an additive parts-based and interpretable representation of the data. This article presents efforts to improve the convergence, approximation quality, and classification accuracy of NMF using five different...
How Ants Can Efficiently Solve the Generalized Watchman Route Problem
Pawel Paduch, Krzysztof Sapiecha.
This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment...
Image Segmentation Based on Bacterial Foraging and FCM Algorithm
Hongwei Mo, Yujing Yin.
This paper addresses the issue of image segmentation by clustering in the domain of image processing. The clustering algorithm taken account here is the Fuzzy C-Means which is widely adopted in this field. Bacterial Foraging Optimization Algorithm is an optimal algorithm inspired by the foraging...
Minimum Span Frequency Assignment Based on a Multiagent Evolutionary Algorithm
Jing Liu, Jinshu Li, Weicai Zhong, Li Zhang, Ruochen Liu.
In frequency assignment problems (FAPs), separation of the frequencies assigned to the transmitters is necessary to avoid the interference. However, unnecessary separation causes an excess requirement of spectrum, the cost of which may be very high. Since FAPs are closely related to T-coloring problems...
Design of Robust Approach for Failure Detection in Dynamic Control Systems
Gomaa Zaki El-Far.
This paper presents a robust instrument fault detection (IFD) scheme based on modified immune mechanism based evolutionary algorithm (MIMEA) that determines on line the optimal control actions, detects faults quickly in the control process, and reconfigures the controller structure. To ensure the...
Effects of Multi-Robot Team Formations on Distributed Area Coverage
Prithviraj Dasgupta, Taylor Whipple, Ke Cheng.
This paper examines the problem of distributed coverage of an initially unknown environment using a multi-robot system. Specifically, focus is on a coverage technique for coordinating teams of multiple mobile robots that are deployed and maintained in a certain formation while covering the environment....
Eugenio Dante Suarez, Manuel Castañón-Puga.
Distributed Agency is the name of a conceptual framework for describing complex adaptive systems that this paper develops. To understand the complexity of the world in a holistic fashion, the field of Modeling and Simulation is currently lacking a common terminology in which different bodies of...
Hierarchical Multi-Agent Plans Using Model-Based Petri Net
Said Brahimi, Ramdane Maamri, Zaidi Sahnoun.
Agents evolving in complex and dynamic multi-agent systems need to plan their tasks and to adapt their behavior in order to react to unpredictable events. Therefore they must have plans that remain subject to continual updating, even during its execution. Although this property is important in dynamic...
A Collaborative Multi-Agent Framework for Internet-Based Teleoperation Systems
Nader Cheaib, Samir Otmane, Malik Mallem.
This paper presents a conceptual model of an agent (called Collaborator Agent) intended to design collaborative software architectures based on multi-agent systems. The authors’ model combines astutely two research areas: Multi-Agent Systems (MAS) and Computer Supported Cooperative Work (CSCW). The...
Epistemological Aspects of Simulation Models for Decision Support
Anthony H. Dekker.
In this paper, the author explores epistemological aspects of simulation with a particular focus on using simulations to provide recommendations to managers and other decision-makers. The author presents formal definitions of knowledge (as justified true belief) and of simulation. The author shows that...