A simple ant colony optimizer for stochastic shortest path problems
type: Item
instance of: scholarly article
title: A simple ant colony optimizer for stochastic shortest path problems
zbMATH Open document ID: 1267.68219
author: Dirk Sudholt
author: Christian Thyssen
published in: Algorithmica
publication date: 2013-04-03T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6149485
zbMATH Keywords: ant colony optimization
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: running time analysis
zbMATH Keywords: shortest path problems
zbMATH Keywords: stochastic optimization
MaRDI profile type: Publication
full work available at URL: s00453-011-9606-2
OpenAlex ID: W2050441104
cites work: Q5417667
cites work: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
cites work: Fast Routing in Road Networks with Transit Nodes
cites work: Computing single source shortest paths using single-objective fitness
cites work: An Analysis of Stochastic Shortest Path Problems
cites work: Improved results for route planning in stochastic transportation networks
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: Introduction to algorithms
cites work: Crossover can provably be useful in evolutionary computation
cites work: More effective crossover operators for the all-pairs shortest path problem
cites work: Runtime analysis of the 1-ANT ant colony optimizer
cites work: Ant colony optimization theory: a survey
cites work: Q5480099
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Concentration of Measure for the Analysis of Randomized Algorithms
cites work: Arriving on time
cites work: On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
cites work: Runtime analysis of ant colony optimization with best-so-far reinforcement
cites work: Ant Colony Optimization Algorithms for Shortest Path Problems
cites work: Simple max-min ant systems and the optimization of linear pseudo-boolean functions
cites work: Least expected time paths in stochastic, time-varying transportation networks
cites work: Ant colony optimization and the minimum spanning tree problem
cites work: Runtime analysis of a simple ant colony optimization algorithm
cites work: A faster algorithm for the single source shortest path problem with few distinct positive lengths
cites work: Shortest paths without a map
cites work: The analysis of evolutionary algorithms on sorting and shortest paths problems
cites work: Using markov-chain mixing time estimates for the analysis of ant colony optimization
cites work: Running time analysis of ant colony optimization for shortest path problems
DOI: 10.1007/S00453-011-9606-2
description: scientific article; zbMATH DE number 6149485