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

@article{Blum2005BeamACOH,
  title={Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling},
  author={Christian Blum},
  journal={Computers & OR},
  year={2005},
  volume={32},
  pages={1565-1591}
}
Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic component of ACO is a probabilistic solution construction mechanism. Due to its constructive nature, ACO can be regarded as a tree search method. Based on this observation, we hybridize the solution construction mechanism of ACO with beam search, which is a well-known tree search method. We call this approach Beam-ACO. The usefulness of Beam-ACO is demonstrated by its… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 289 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 171 extracted citations

289 Citations

02040'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 289 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

An ant colony optimization algorithm to tackle shop scheduling problems Technical Report TR/IRIDIA/2003-01, IRIDIA

  • C. Blum
  • UniversitR e Libre de Bruxelles,
  • 2003
Highly Influential
9 Excerpts

Algorithms for solving production scheduling problems

  • B GiPer, GL Thompson
  • Operations Research
  • 1960
Highly Influential
5 Excerpts

StZ utzle T

  • M Dorigo
  • Ant colony optimization
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…