Cover Image

Convergence and Running Time of Time-dependent Ant Colony Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Manthey, Bodo, van Rhijn, Jesse, Safari, Ashkan, Vredeveld, Tjark
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering
by: Manthey, Bodo, et al.
Published: (2023)

Counting Locally Optimal Tours in the TSP
by: Manthey, Bodo, et al.
Published: (2024)

A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
by: Singhvi, Vivaan, et al.
Published: (2025)

Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
by: Lynch, Nancy A.
Published: (2024)

Biased Pareto Optimization for Subset Selection with Dynamic Cost Constraints
by: Liu, Dan-Xuan, et al.
Published: (2024)

Complexity of Local Search for Euclidean Clustering Problems
by: Manthey, Bodo, et al.
Published: (2023)

Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks
by: Li, Jianfei, et al.
Published: (2024)

Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
by: Storesund, Simen, et al.
Published: (2025)

Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
by: Bendahi, Abderrahim, et al.
Published: (2025)

The Runtime of Random Local Search on the Generalized Needle Problem
by: Doerr, Benjamin, et al.
Published: (2024)

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
by: Doerr, Benjamin, et al.
Published: (2023)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
by: Doerr, Benjamin, et al.
Published: (2023)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
by: Qian, Chendi, et al.
Published: (2026)

Hyper-Heuristics Can Profit From Global Variation Operators
by: Doerr, Benjamin, et al.
Published: (2024)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
by: Doerr, Benjamin, et al.
Published: (2022)

Which Algorithms Can Graph Neural Networks Learn?
by: Wittig, Solveig, et al.
Published: (2026)

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
by: Zhang, Taining, et al.
Published: (2023)

Abstraction in Neural Networks
by: Lynch, Nancy
Published: (2024)

Training Neural Networks is NP-Hard in Fixed Dimension
by: Froese, Vincent, et al.
Published: (2023)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
by: Hertrich, Christoph, et al.
Published: (2021)

Covered Forest: Fine-grained generalization analysis of graph neural networks
by: Vasileiou, Antonis, et al.
Published: (2024)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
by: Doerr, Benjamin, et al.
Published: (2022)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

Stringology-Based Motif Discovery from EEG Signals: an ADHD Case Study
by: Dahan, Anat, et al.
Published: (2026)

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
by: Doerr, Benjamin, et al.
Published: (2026)

Comparative Analysis of Four Prominent Ant Colony Optimization Variants: Ant System, Rank-Based Ant System, Max-Min Ant System, and Ant Colony System
by: Abdelmoaty, Ahmed Mohamed, et al.
Published: (2024)

The Impact of Network Structure on Ant Colony Optimization
by: Shimizu, Taiyo, et al.
Published: (2024)

Tensorized Ant Colony Optimization for GPU Acceleration
by: Yang, Luming, et al.
Published: (2024)

A full process algebraic representation of Ant Colony Optimization
by: Garcia, Maria, et al.
Published: (2026)

Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes
by: Kergaßner, Matthias, et al.
Published: (2024)

Colony-Enhanced Recurrent Neural Architecture Search: Collaborative Ant-Based Optimization
by: Elsaid, Abdelrahman
Published: (2024)

An Experimental Approach for Running-Time Estimation of Multi-objective Evolutionary Algorithms in Numerical Optimization
by: Huang, Han, et al.
Published: (2025)

A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2)
by: Ren, Shengjie, et al.
Published: (2024)

Ant Colony Sampling with GFlowNets for Combinatorial Optimization
by: Kim, Minsu, et al.
Published: (2024)

MOANA: Multi-Objective Ant Nesting Algorithm for Optimization Problems
by: Rashed, Noor A., et al.
Published: (2024)

Pheromone-Focused Ant Colony Optimization algorithm for path planning
by: Liu, Yi, et al.
Published: (2026)

Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization
by: Huang, Min, et al.
Published: (2025)

Ant Colony Inspired Machine Learning Algorithm for Identifying and Emulating Virtual Sensors
by: Mani, Pranav, et al.
Published: (2020)