3 papers
cs.DS2025
A k-swap Local Search for Makespan Scheduling
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong e…
cs.DS2025
Convergence and Running Time of Time-dependent Ant Colony Algorithms
Bodo Manthey, Jesse van Rhijn, Ashkan Safari +1
Ant Colony Optimization (ACO) is a well-known method inspired by the foraging behavior of ants and is extensively used to solve combinatorial optimization problems. In this paper,…
cs.DS2024
Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various problem domains. In this…