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

Osama Abdel-Raouf | Zendy; Ibrahim El-Henawy | Zendy; Mohamed Abdel-Baset | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Osama Abdel-Raouf,

Ibrahim El-Henawy,

Mohamed Abdel-Baset

Publication year - 2014

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/15019-3307

Subject(s) - computer science , chaotic , harmony search , harmony (color) , chaotic systems , algorithm , theoretical computer science , mathematical optimization , artificial intelligence , mathematics , art , visual arts

This paper presents an improved version of a harmony metaheuristic 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), improved harmony search (IHS) algorithm and traditional methods (Hungarian method).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research