The ant colony optimization meta-heuristic
New ideas in optimization
Future Generation Computer Systems
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Robust optimization models for project scheduling with resource availability cost
Journal of Scheduling
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
Software project management with GAs
Information Sciences: an International Journal
Applying fuzzy method for measuring criticality in project network
Information Sciences: an International Journal
Aggregation pheromone density based data clustering
Information Sciences: an International Journal
A random key based genetic algorithm for the resource constrained project scheduling problem
Computers and Operations Research
Time series forecasting with a non-linear model and the scatter search meta-heuristic
Information Sciences: an International Journal
Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Differential evolution for solving multi-mode resource-constrained project scheduling problems
Computers and Operations Research
Deadline division-based heuristic for cost optimization in workflow scheduling
Information Sciences: an International Journal
A robust scheduling method based on a multi-objective immune algorithm
Information Sciences: an International Journal
A hybrid search algorithm with heuristics for resource allocation problem
Information Sciences: an International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
AbYSS: Adapting Scatter Search to Multiobjective Optimization
IEEE Transactions on Evolutionary Computation
An artificial bee colony with random key for resource-constrained project scheduling
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
An improved ant colony optimization algorithm for nonlinear resource-leveling problems
Computers & Mathematics with Applications
On the performance of bee algorithms for resource-constrained project scheduling problem
Applied Soft Computing
An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
Computers and Operations Research
Information Sciences: an International Journal
A self-optimizing mobile network: Auto-tuning the network with firefly-synchronized agents
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
A novel algorithm for dynamic task scheduling
Future Generation Computer Systems
Swarm-oriented mobile services: Step towards green communication
Expert Systems with Applications: An International Journal
A path enumeration approach for the analysis of critical activities in fuzzy networks
Information Sciences: an International Journal
Solving software project scheduling problems with ant colony optimization
Computers and Operations Research
Information Sciences: an International Journal
A hybrid evolutionary algorithm for the resource-constrained project scheduling problem
Artificial Life and Robotics
Information Sciences: an International Journal
A fuzzy time-dependent project scheduling problem
Information Sciences: an International Journal
Hi-index | 0.10 |
We propose an efficient hybrid algorithm, known as ACOSS, for solving resource-constrained project scheduling problems (RCPSP) in real-time. The ACOSS algorithm combines a local search strategy, ant colony optimization (ACO), and a scatter search (SS) in an iterative process. In this process, ACO first searches the solution space and generates activity lists to provide the initial population for the SS algorithm. Then, the SS algorithm builds a reference set from the pheromone trails of the ACO, and improves these to obtain better solutions. Thereafter, the ACO uses the improved solutions to update the pheromone set. Finally in this iteration, the ACO searches the solution set using the new pheromone trails after the SS has terminated. In ACOSS, ACO and the SS share the solution space for efficient exchange of the solution set. The ACOSS algorithm is compared with state-of-the-art algorithms using a set of standard problems available in the literature. The experimental results validate the efficiency of the proposed algorithm.