Ant colony optimization for resource-constrained project scheduling

By Daniel Merkle, Martin Middendorf, Hartmut Schmeck. IEEE Transactions on Evolutionary Computation, 2000

809 citations recorded by the source corpus.

Subfields: Building and Construction, Industrial and Manufacturing Engineering, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/24807d7342677ee5ebfb908484247926f3cf34e5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Building and Construction

In Industrial and Manufacturing Engineering

In Management Science and Operations Research

Citations in the corpus

Metaheuristics in combinatorial optimization: Overview and conceptual comparison (2003, methodology): “Successful applications of ACO include the application to routing in communication networks [36], the application to the Sequential Ordering Problem (SOP) [62], and the application to Resource Constraint Project Scheduling (RCPS) [109].”
Chemical-Reaction-Inspired Metaheuristic for Optimization (2010, background): “problem (RCPSP) [29], [30], and the channel assignment”
Ant Colony Optimization (2001, positive): “A first approach in that direction is followed by Merkle et al. (2002) in their ACO algorithm for the RCPSP (see section 5.”
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances (2003, background): “This definition of the pheromone trails is, in fact, used in most ACO application to scheduling problems [2, 21, 66, 80].”
Ant Colony Optimization: Overview and Recent Advances (2018, neutral): “This definition of the pheromone trails is, in fact, used in many ACO applications to scheduling problems [8, 42, 110, 142].”
Ant colony optimization theory: A survey (2005, background): “Among other applications, ACO algorithms are currently state-of-the-art for solving the sequential ordering problem (SOP) [28], the resource constraint project scheduling (RCPS) problem [51], and the open shop scheduling (OSS) problem [4].”
Ant colony optimization: Introduction and recent trends (2005, background): “ACO algorithms are currently among the state-of-the-art methods for solving, for example, the sequential ordering problem [41], the resource constraint project scheduling problem [71], the open shop scheduling problem [9], and the 2D and 3D hydrophobic polar protein folding problem [84].”
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling (2005, methodology): “In the Beld of scheduling, ACO has so far been successfully applied to the single machine weighted tardiness (SMWT) problem [25], and to the resource constraint project scheduling (RCPS) problem [26].”
Review of job shop scheduling research and its new perspectives under Industry 4.0 (2017, background): “Merkle et al. (2002), Blum and Sampels (2004) employed ACO to solve different scheduling problem.”
Experimental investigation of heuristics for resource-constrained project scheduling: An update (2006, methodology): “[46] present the first application of ant systems (a metaheuristic strategy developed by Dorigo et al.”
An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements (2009, background): “The strategies of scheduling from both directions enable the algorithm to explore more different solutions for DAG-based scheduling problems, which have been proven in [33].”
Swarm Intelligence in Optimization (2008, background): “Traveling salesman problem Dorigo, Maniezzo, and Colorni [46, 50, 51] Dorigo and Gambardella [49] Stützle and Hoos [164] Quadratic assignment problem Maniezzo [109] Maniezzo and Colorni [111] Stützle and Hoos [164] Scheduling problems Stützle [162] den Besten, Stützle, and Dorigo [41] Gagné, Price, ”