Volume 1, Issue 2 (6-2011)
IJOCE 2011, 1(2): 341-355 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Shahrouzi M. PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION. IJOCE 2011; 1 (2) :341-355
URL: http://ijoce.iust.ac.ir/article-1-22-en.html
URL: http://ijoce.iust.ac.ir/article-1-22-en.html
Abstract: (25195 Views)
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term memory via indirect information share between search agents and the directional search inspired by natural swarms. Treated numerical examples illustrate the PDS performance in continuous and discrete design spaces.
Keywords: Pseudo-random directional search, ant system, particle swarm optimization, characteristic graph
| Rights and permissions | |
 | This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
