Predatory search algorithm with restriction of solution distance
From MaRDI portal
Publication:2500224
DOI10.1007/S00422-005-0550-6zbMath1101.92061OpenAlexW2093341344WikidataQ51498093 ScholiaQ51498093MaRDI QIDQ2500224
Publication date: 23 August 2006
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00422-005-0550-6
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computational methods for problems pertaining to biology (92-08) Animal behavior (92D50)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Landscapes, operators and heuristic search
- A new adaptive multi-start technique for combinatorial global optimizations
- State-space search strategies gleaned from animal behavior: A traveling salesman experiment
- An Automatic Method of Solving Discrete Programming Problems
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
This page was built for publication: Predatory search algorithm with restriction of solution distance