A survey on metaheuristics for stochastic combinatorial optimization

  title={A survey on metaheuristics for stochastic combinatorial optimization},
  author={L. Bianchi and M. Dorigo and L. Gambardella and W. Gutjahr},
  journal={Natural Computing},
  • L. Bianchi, M. Dorigo, +1 author W. Gutjahr
  • Published 2008
  • Computer Science
  • Natural Computing
  • Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex optimization problems, and they are a growing research area since a few decades. In recent years, metaheuristics are emerging as successful alternatives to more classical approaches also for solving optimization problems that include in their mathematical formulation uncertain, stochastic, and dynamic information. In this paper metaheuristics such as Ant Colony Optimization, Evolutionary… CONTINUE READING
    A survey on optimization metaheuristics
    • 808
    • PDF
    A survey on new generation metaheuristic algorithms
    • 30
    • Highly Influenced
    • PDF
    Convergence Analysis of Metaheuristics
    • 34
    Ant Colony Optimization: Overview and Recent Advances
    • 516
    • PDF


    Publications referenced by this paper.
    Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • 2,857
    • PDF
    Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
    • 165
    • PDF
    Ant colony optimization theory: A survey
    • 1,833
    • PDF
    Variable neighborhood search: Principles and applications
    • 1,667
    Evolutionary optimization in uncertain environments-a survey
    • 1,356
    • Highly Influential
    • PDF
    S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
    • 79
    • PDF
    Ant system: optimization by a colony of cooperating agents
    • 10,162
    • PDF
    A Converging ACO Algorithm for Stochastic Combinatorial Optimization
    • 96
    • PDF