Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling

By Christian Blum. Computers & Operations Research, 2005

379 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/1f9c753a03b04f34cbabb76de1288f0f9356cab9

How researchers see this paper

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

In Artificial Intelligence

In Industrial and Manufacturing Engineering

Citations in the corpus

Hybrid metaheuristics in combinatorial optimization: A survey (2011, background): “Examples are probabilistic beam search [91], incomplete and non-deterministic tree search (ANTS) procedures [92, 93, 94], and Beam-ACO algorithms [95, 96, 97].”
Classification With Ant Colony Optimization (2007, methodology): “ACO has been applied to a variety of different problems [8], such as vehicle routing [17]–[19], scheduling [20], [21], timetabling [22], traveling salesman problem [12], [14], [23], and routing in packet-switched networks [24].”
Swarm Intelligence in Optimization (2008, background): “ACO algorithms are currently among the state-of-the-art methods for solving, for example, the sequential ordering problem [62], the resource constraint project scheduling problem [120], the open shop scheduling problem [14], assembly line balancing [15], and the 2D and 3D hydrophobic polar protein f”
Building comprehensible customer churn prediction models with advanced rule induction techniques (2011, neutral): “…& Stützle, 2004), such as the vehicle routing problem (Bullnheimer, Hartl, & Strauss, 1999; Garcia, Montiel, Castillo, Sepúlveda, & Melin, 2009; Wade & Salhi, 2004), scheduling (Color-ni, Dorigo, Maniezzo, & Trubian, 1994; Blum, 2005), and routing in packet-switched networks (Caro & Dorigo, 1998).”
Ant Colony Optimization: Overview and Recent Advances (2018, methodology): “ACO algorithm Main references Year TSP Ant System [55, 63, 65] 1991 yes Elitist AS [55, 63, 65] 1992 yes Ant-Q [74] 1995 yes Ant Colony System [60, 61, 75] 1996 yes MMAS [146, 147, 148] 1996 yes Rank-based AS [29, 30] 1997 yes ANTS [104, 105] 1998 no Best-Worst AS [36, 37] 2000 yes Population-based ”
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].”