A unified ant colony optimization algorithm for continuous optimization
From MaRDI portal
Publication:2514761
DOI10.1016/j.ejor.2013.10.024zbMath1304.90221OpenAlexW1968150523MaRDI QIDQ2514761
Thomas Stützle, Marco A. Montes de Oca, Marco Dorigo, Tianjun Liao
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.024
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A novel evolutionary optimization algorithm inspired in the intelligent behaviour of the hunter spider ⋮ Eidetic wolf search algorithm with a global memory structure ⋮ Hybrid artificial bee colony algorithm and particle swarm search for global optimization ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ On the Reynolds Equation and the Load Problem in Lubrication: Literature Review and Mathematical Modelling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ant colony optimization for continuous domains
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- SATenstein: automatically building local search SAT solvers from components
- An efficient method for finding the minimum of a function of several variables without calculating derivatives