Loading [MathJax]/extensions/MathMenu.js
IEEE Xplore Search Results

Showing 1-25 of 2,132 resultsfor

Filter Results

Show

Results

In order to solve the problems of poor balance and low efficiency of traditional dynamic allocation method of human resources, this paper proposes a new dynamic allocation method of human resources based on improved ant colony optimization. In order to improve the convergence of the traditional ant colony optimization algorithm and avoid falling into the local optimal solution, the ant colony opti...Show More
In this paper, a Dynamic Chaotic Ant Colony Optimization (DCACO) algorithm is proposed to solve the problems of traditional Ant Colony Optimization (ACO) algorithm in mobile robot path planning, such as long time consuming, slow convergence speed and easy to fall into local optimum. In DCACO, cosine annealing strategy is used to improve the expectation heuristic factor to balance the global search...Show More
The load balancing is dedicated for distributed and parallel systems to manage the web cluster. It distributes the load among web servers using several scheduling algorithms. This paper investigates a detailed comparison of some HAProxy algorithms in heterogeneous web cluster as well as the meta-heuristic methods that inspired by the insects' colonies behavior such as Ant Colony Optimization algor...Show More
Dynamic voltage scaling, supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some with quite good results. However, the previous algorithms either have a large time complexity or obtain results sensitive to the count of the voltage modes. Fine-grained voltage modes lead to...Show More

Metaheuristics for dynamic combinatorial optimization problems

;;

IMA Journal of Management Mathematics
Year: 2013 | Volume: 24, Issue: 4 | Journal Article |
Cited by: Papers (14)
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natural...Show More

Metaheuristics for dynamic combinatorial optimization problems

;;

Year: 2013 | Volume: 24, Issue: 4 | Journal Article |
To solve the problem of complexity and uncertainty in logistics and distribution system, a kind of Ant Colony Optimization algorithm based on immunity vaccine and dynamic pheromone updating is put forward in this paper. In this new Algorithm, initial antibody is vaccinated first to produce better solutions, and initial parameters are then set depending on these better solutions by the Ant Colony. ...Show More
In this paper, we propose Clustering method and Ant Colony Optimization (ACO) for mobile robot. This paper describes the analysis and design of a new class of mobile robots. These small robots are intended to be simple and inexpensive, and will all be physically identical, thus constituting a homogeneous team of robots. They derive their usefulness from their group actions, performing physical tas...Show More
The study of swarm intelligence is more and more popular, much study have been done on swarm intelligence such as ACO (Ant Colony Optimization), and many applications also have been made in the field of combinatorial optimization. However, when solving combinatorial optimization problems, especially these problems with large scale, slow convergence and easy to fall into stagnation still restraint ...Show More
In a typical manufacturing system, jobs are released from a production planning stage to a shop floor, where they are allocated to resources like machines. An optimal or near optimal schedule is generally found for those jobs. In reality, the execution of this schedule is often interrupted by dynamic events like unexpected incoming new jobs, machine breakdowns, etc. A rapid recovery or a self-orga...Show More
Oriented to dynamic load balance of high concurrent cluster, an Optimized Dynamic Load Balance Method (ODLBM) based on Ant Colony Optimization (ACO) is proposed in this paper. Compared to traditional static load balance approach, ODLBM tends to resolve complex dynamic load balance problem with dynamic cluster and heterogeneous tasks. First, the dynamic load balance problem is transformed to the op...Show More
Scheduling jobs to resources in grid computing is complicated due to the distributed and heterogeneous nature of the resources. Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources. This will lead to resources having high workload and stagnation may occur if computational times of the processed jobs are high. This paper proposed an enhanced ant ...Show More
A hybrid ant colony optimization based on Genetic Algorithm (GA) is applied to solving complex packing problem in the paper. Firstly, it searches for a set of rough solutions with the random search ability and the rapid global convergence of GA. Then, this set of solutions are used as the initial input of Ant Colony Optimization(ACO), using the positive feedback mechanism, the parallelism and the ...Show More
The resource-constrained project scheduling problem is a typical combinatorial optimization problem. An ant algorithm with dual ant colonies is proposed to improve the effective allocation of project resources. The algorithm adaptively adjusts resource allocation according to the pheromone updated by artificial ants employed to search for feasible schedules. Two separate ant colonies are employed....Show More
Dynamic facility layout problem (DFLP) has garnered much attention lately. At the current time, researches in this area are mainly on the distance-based objective or quantitative aspect of DFLP. However, focusing on the quantitative objective alone is not adequate to reflect situations in the real world-a little consideration is given to the quality aspect of facility layout such as the adjacency ...Show More
This paper presents a novel algorithm based on ant colony optimization for solving the sensor management problem. First, we establish a two dimension node graph representation of the problem along which the ant can move properly to construct candidate solutions. Then a dynamic heuristic ant colony optimization (DHACO) algorithm is exploited according to the graph representation. The main novel ide...Show More
This paper proposes a modified Ant Colony Optimization (ACO) algorithm with Bayesian network to solve the Unmanned Surface Vehicle (USV) path planing problem. By analyzing the variables correlation using in Bayesian network, the Bayesian network ant colony optimization (BN-ACO) algorithm is proposed, where the transition probability rule of ACO is modified to avoid local minimum and improve the co...Show More
In a dynamic environment, path planning for Unmanned Aerial Vehicles (UAVs) is challenging due to obstacles and changing conditions. To solve this, bio-inspired metaheuristic algorithms such as Ant Colony Optimization (ACO) have shown promising result in solving optimization problems. In this paper we have presented ACO-based path planning algorithms for UAV navigation in dynamic environments. We ...Show More
In this paper, an algorithm DACO (dynamic ant colony optimization algorithm based on multi- pheromones) is put forward to apply to the dynamics of web services state and QoS in service composition optimization. In order to denote users' needs more accurately, this algorithm sets multiple pheromones. The DACO is also improved based on experiment in order to make it better and faster converge to opt...Show More
Community mining has been the focus of many recent researches on dynamic social networks. In this paper, we propose a clustering based improved ant colony algorithm (CIACA) for community mining in social networks. The CIACA combines the local pheromone update rule with the global update rule and utilizes heuristic function to adjust the clustering solution dynamically, assisted by decay coefficien...Show More

Ant Algorithms for Discrete Optimization

;;

Artificial Life
Year: 1999 | Volume: 5, Issue: 2 | Journal Article |
Cited by: Papers (539)
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO m...Show More

Ant Algorithms for Discrete Optimization

;;

Year: 1999 | Volume: 5, Issue: 2 | Journal Article |
In this article, the simulation of optimal decision model for fault recovery of power distribution network (PDN) based on ant colony optimization (ACO) algorithm is mainly studied. Firstly, aiming at the shortcomings of traditional ACO algorithm, this article improves it, introduces elite strategy and dynamically adjusts pheromone volatilization rate to improve the search ability and robustness of...Show More
In recent years, the idea of NDD (Network Dynamic Defense) has received increasing attention from academia and industry, and mobile target defense technologies applied to multiple levels of information systems have been continuously proposed, achieving certain defense effects. NDD is a network security mechanism that increases the difficulty and cost of attacks by effectively reducing the similari...Show More
According to the complex environment of wide-area, dynamic and heterogeneous in the manufacturing grid, how quickly and accurately discover and the schedule resources, enable QoS to achieve the desired effect, this paper presented the new method to discovering the resources of using Mobile Agent in the manufacturing grid, has designed the resources optimal goal, improved genetic ant colony algorit...Show More
A novel co-operative agents approach, ant colony optimization (ACO) algorithm, for solving problems of combinatorial optimization, is put forward by M. Dorigo. The main characteristics of ACO are positive feedback, distributed computation. Preliminary study has shown that it has many promising futures. This paper reviews recent work on ant algorithms and applications, the chaos ant colony optimiza...Show More
Decreasing the execution time of parallel program is a key issue in the effective utilization of multiprocessor systems, and it is also a NP-hard problem. In this paper, we propose different static and dynamic attributes of task graph as ant colony heuristics to deal with the multiprocessor scheduling problem. The attributes based on task graph DAG (Direct Acyclic Graph) for parallel program, incl...Show More