A survey on metaheuristics for stochastic combinatorial optimization

  title={A survey on metaheuristics for stochastic combinatorial optimization},
  author={Leonora Bianchi and Marco Dorigo and Luca Maria Gambardella and Walter J. Gutjahr},
  journal={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… 
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
This study discusses the main concepts and challenges in this area and proposes a formalism to classify, design, and code combinatorial optimization problems and metaheuristics that may support the progress of the field and increase the maturity of meta heuristics as problem solvers analogous to other machine learning algorithms.
Metaheuristics 1
Metaheuristics have been demonstrated by the scientific community to be a viable, and often superior, alternative to more traditional (exact) methods of mixedinteger optimization such as branch and bound and dynamic programming.
A Walk into Metaheuristics for Engineering Optimization: Principles, Methods and Recent Trends
The principles and the state-of-the-art of metaheuristic methods for engineering optimization, both the classic and emerging approaches to optimization using metaheuristics are reviewed and analyzed.
Comparative study of population-based metaheuristic methods in global optimization
This thesis studies so-called population-based metaheuristics, especially Nature-inspired evolutionary algorithms and swarm intelligence, and studies their capabilities of solving a difficult real-world optimization problem, the Lennard-Jones cluster structure problem.
Metaheuristics for Stochastic Problems
Examples of how metaheuristics have been used to solve stochastic problems are given, thereby illustrating the additional considerations that are required in this context.
Recent Development of Metaheuristics for Clustering
To evaluate the performance of eight novel metaheuristics, they are applied to a well-known combinatorial optimization problem, data clustering, and the results are analyzed and discussed.
Why Simheuristics? Benefits, Limitations, and Best Practices When Combining Metaheuristics with Simulation
This paper argues that approaches combining simulation with meta heuristics not only constitute a natural extension of metaheuristics, but also should be considered as a “first resort” method when dealing with large-scale stochastic optimization problems, which constitute most realistic problems in industry and business.
Metaheuristic Techniques
A number of metaheuristic methodologies, specifically evolutionary algorithms, such as genetic algorithms and evolution strategy, particle swarm optimization, ant colony optimization, bee colony optimized, simulated annealing and a host of other methods are discussed.


Ant colony optimization and local search for the probabilistic traveling salesman problem: a case study in stochastic combinatorial optimization
In this thesis we focus on Stochastic combinatorial Optimization Problems (SCOPs), a wide class of combinatorial optimization problems under uncertainty, where part of the information about the
Metaheuristics: Progress in Complex Systems Optimization
A delineation of general Metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern computational methods in promising new areas are provided.
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
A survey of the nowadays most important metaheuristics from a conceptual point of view and introduces a framework, that is called the I&D frame, in order to put different intensification and diversification components into relation with each other.
Ant colony optimization theory: A survey
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD) and explores the hybridization of the metaheuristic by means of two objective functions which are surrogate measures of the exact solution quality.
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm outperforms the SSA approach on the considered test instances.
A Converging ACO Algorithm for Stochastic Combinatorial Optimization
It is shown that on rather mild conditions, including that of linear increment of the sample size, the algorithm converges with probability one to the globally optimal solution of the stochastic combinatorial optimization problem, and can usually be recommended for practical application in an unchanged form, i.e., with the ”theoretical” parameter schedule.
Variable neighborhood search: Principles and applications
Evolutionary optimization in uncertain environments-a survey
This paper attempts to provide a comprehensive overview of the related work within a unified framework on addressing different uncertainties in evolutionary computation, which has been scattered in a variety of research areas.
Ant colony optimization: Introduction and recent trends