Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems

@inproceedings{AbdelRaouf2014ChaoticHS,
  title={Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems},
  author={Osama Abdel-Raouf and Mohamed Abdel-Baset},
  year={2014}
}
This paper presents an improved version of a harmony meta-heuristic algorithm with different chaotic maps, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Numerical results show that the IHSCH is accurate and efficient in comparison with harmony search (HS) algorithm, improved harmony search (IHS) algorithm and traditional methods (Hungarian method). 
3 Citations
25 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Evolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization",

  • Shaik Farook, P. Sangameswara Raju
  • International Journal of Computational…
  • 2013

A local-best harmony search algorithm with dynamic subpopulations

  • Q.-K. Pan, P. Suganthan, J. Liang, M. F. Tasgetiren
  • Engineering Optimization, vol. 42, pp. 101-117…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…