A survey on metaheuristics for stochastic combinatorial optimization

DOI10.1007/S11047-008-9098-4zbMath1162.90591DBLPjournals/nc/BianchiDGG09OpenAlexW2046609661WikidataQ56431129 ScholiaQ56431129MaRDI QIDQ1024034

Walter J. Gutjahr, Marco Dorigo, Luca Maria Gambardella, Leonora Bianchi

Publication date: 16 June 2009

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/319945/files/11047_2008_Article_9098.pdf

zbMATH Keywords

samplingoptimizationnoiseuncertaintymetaheuristicsprobabilitystochasticityapproximations

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (54)

New strategies for stochastic resource-constrained project scheduling ⋮ Global-local non intrusive analysis with Robin parameters: application to plastic hardening behavior and crack propagation in 2D and 3D structures ⋮ Robustness of populations in stochastic environments ⋮ Satisficing measure approach for vehicle routing problem with time windows under uncertainty ⋮ Low complexity metaheuristics for joint ML estimation problems ⋮ Optimal Learning for Nonlinear Parametric Belief Models Over Multidimensional Continuous Spaces ⋮ A decision support method for designing vegetation layers with minimised irrigation need ⋮ An analytical framework for consensus-based global optimization method ⋮ Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances ⋮ Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach ⋮ Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models ⋮ An artificial bee colony algorithm for the job shop scheduling problem with random processing times ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Partial neighborhood local searches ⋮ Optimization via rejection-free partial neighbor search ⋮ Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems ⋮ A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty ⋮ Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search ⋮ A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem ⋮ An application of fuzzy logistic regression for predicting CVSS severity category of industrial control systems ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Search for common minima in joint optimization of multiple cost functions ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ Solving problems with unknown solution length at almost no extra cost ⋮ Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions ⋮ Optimal Learning with Local Nonlinear Parametric Models over Continuous Designs ⋮ A survey on optimization metaheuristics ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks ⋮ Recent trends in metaheuristics for stochastic combinatorial optimization ⋮ Solving chance-constrained combinatorial problems to optimality ⋮ Soccer game optimization with substitute players ⋮ Mimicking the collective intelligence of human groups as an optimization tool for complex problems ⋮ Elephant swarm water search algorithm for global optimization ⋮ Horizontal collaboration in freight transport: concepts, benefits and environmental challenges ⋮ An introduction to multiobjective simulation optimization ⋮ Simulation optimization: a review of algorithms and applications ⋮ A centralized stochastic inventory control model for perishable products considering age-dependent purchase price and lead time ⋮ One dimensional consensus based algorithm for non-convex optimization ⋮ Dynamic vehicle routing with time windows in theory and practice ⋮ A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling ⋮ Multi-objective optimization of the suspension system parameters of a full vehicle model ⋮ Survey on blood supply chain management: models and methods ⋮ A hybrid path‐relinking method for solving two‐stage stochastic integer problems ⋮ A gradient-based cuckoo search algorithm for a reservoir-generation scheduling problem ⋮ A novel dynamic generalized opposition-based grey wolf optimization algorithm ⋮ The distributed Kolkata paise restaurant game ⋮ Hybrid metaheuristics for stochastic constraint programming ⋮ Stochastic radiotherapy appointment scheduling

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Designing evolutionary algorithms for dynamic environments.
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Designing delivery districts for the vehicle routing problem with stochastic demands
• A hybrid scatter search for the probabilistic traveling salesman problem
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• Simulated annealing with noisy or imprecise energy measurements
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Tabu search when noise is present: An illustration in the context of cause and effect analysis
• Stochastic integer programming: general models and algorithms
• Robust discrete optimization and its applications
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• Online algorithms: a survey
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practise.
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• A framework for the description of evolutionary algorithms
• The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
• Tabu search and finite convergence
• ACO algorithms with guaranteed convergence to the optimal solution
• Determining buffer location and size in production lines using tabu search
• Simulated annealing for discrete optimization with estimation
• A survey on stochastic location and routing problems
• The traveling salesman problem and its variations
• Solving the probabilistic TSP with ant colony optimization
• A distributed genetic algorithm for deterministic and stochastic labor scheduling problems
• Rollout algorithms for stochastic scheduling problems
• Future paths for integer programming and links to artificial intelligence
• Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
• An improved simulated annealing simulation optimization method for discrete parameter stochastic systems
• Probabilistic search with overrides
• Simulated annealing for noisy cost functions
• A solution method for a two-dispatch delivery problem with stochastic customers
• A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
• Enriched workflow modelling and stochastic branch-and-bound
• A review of particle swarm optimization. I: Background and development
• On-line algorithms for the dynamic traveling repair problem
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints
• Computational complexity of stochastic programming problems
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands
• Rollout algorithms for combinatorial optimization
• A taxonomy of evolutionary algorithms in combinatorial optimization
• Ant colony optimization theory: a survey
• On Optimal Allocation of Indivisibles Under Uncertainty
• Stochastic Vehicle Routing Problem with Restocking
• Feature Article: Optimization for simulation: Theory vs. Practice
• A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes
• A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization
• A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Cooling Schedules for Optimal Annealing
• A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Introduction to Stochastic Programming
• A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Nested Partitions Method for Global Optimization
• A combined procedure for optimization via simulation
• A simulation-based genetic algorithm for inventory optimization in a serial supply chain
• A simulated annealing approach to the cyclic staff-scheduling problem
• A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
• Evolutionary policy iteration for solving Markov decision processes
• Stochastic assembly line balancing using beam search
• Decision-Making in a Fuzzy Environment
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• On Random Variables with Comparable Peakedness
• On the convergence of tabu search
• Variable neighborhood search: Principles and applications
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing

This page was built for publication: A survey on metaheuristics for stochastic combinatorial optimization