A heuristic approach to find the global optimum of function

DOI10.1016/J.CAM.2006.10.074zbMath1134.65351OpenAlexW2047828927MaRDI QIDQ2475339

M. Duran Toksarı

Publication date: 11 March 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2006.10.074

zbMATH Keywords

algorithmnumerical examplesmetaheuristicsglobal optimumant colony optimizationbiological inspired heuristics

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A new hybrid method for solving global optimization problem ⋮ A new solution algorithm for improving performance of ant colony optimization

Cites Work

• Global optimizations and tabu search based on memory
• Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• A heuristic approach for finding the global minimum: Adaptive random search technique
• Ant colony optimization for finding the global minimum
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• Parallel Ant Colonies for the quadratic assignment problem

This page was built for publication: A heuristic approach to find the global optimum of function