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

Abdel-Raouf, Osama; El-henawy, Ibrahim; Abdel-Baset, Mohamed
January 2014
International Journal of Computer Applications;Jan2014, Vol. 86, p8
Academic Journal
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).


Related Articles

  • A Decomposition Algorithm for Solving a Three Level Large Scale linear Programming Problem. Sultan, T. I.; Emam, O. E.; Abohany, A. A. // Applied Mathematics & Information Sciences;2014, Vol. 8 Issue 5, p2217 

    This paper presents a three level large scale linear programming problem in which the objective functions at every level are to be maximized. A three level programming problem can be thought as a static version of the Stackelberg strategy. An algorithm for solving a three planner model and a...

  • Outcome Space Branch and Bound Algorithm for Globally Solving A Class of Linear Multiplicative Programming. Jingben Yin; Jing Chen // International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p167 

    This article present an outcome space branch and bound algorithm for globally solving a class of multiplicative programming problems. The main computation involve in solving the series of linear programming problems, and the algorithm economizes the required computations by conducting the branch...

  • Multiattribute decision making models and methods using interval-valued fuzzy sets. Hongmei Ju; Fenghua Qi // Journal of Chemical & Pharmaceutical Research;2014, Vol. 6 Issue 7, p465 

    The concept of interval-valued fuzzy sets is the generalization of the concept of fuzzy sets. The theory of interval-valued fuzzy sets is well suited to dealing with vagueness. Recently, interval-valued fuzzy sets have been used to build soft decision making models that can accommodate imprecise...

  • Relaxation Method for Globally Solving a Class of Multiplicative Programming Problems. Yunrui Guo; Jing Chen; Jingben Yin // International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p178 

    This article present a branch and bound algorithm for globally solving a class of multiplicative problems by using relaxation method. By utilizing character of bilinear function, a sequence of linear relaxation programming of the initial non-convex programming problem are derived which are...

  • MODELING A DEPARTMENT COURSE SCHEDULING PROBLEM USING INTEGER PROGRAMMING: A SPREADSHEET-BASED APPROACH. Kumar, Rita // Academy of Information & Management Sciences Journal;2014, Vol. 17 Issue 2, p41 

    This research studies a department course scheduling problem, considering the scheduling of courses (and sections of courses) at specific times, and the assignment of faculty to the different sections. The general problem has been addressed in the management science literature, and due to the...

  • The Context of Knowledge and Data Discovery in Highly Dense Data Points Using Heuristic Approach. Sasireka, C. S.; Raviraj, P. // Journal of Signal & Information Processing;Feb2013, Vol. 4 Issue 1, p88 

    In data mining framework, for proficient data examination recent researchers utilized branch-and-bound methods such as seriation, clustering, and feature selection. Conventional cluster search was completed with diverse partitioning schemes to optimize the cluster pattern. Considering image...

  • A Heuristic Approach for the Vertex Cover Problem. Kettani, Omar; Ramdani, Faycal; Tadili, Benaissa // International Journal of Computer Applications;Nov2013, Vol. 82, p9 

    A vertex cover is a subset of the vertex set of a given graph G such that every edge in G has at least one endpoint in this set. The Minimum Vertex Cover problem consists to find the minimum sized vertex cover in a graph. This problem which belongs to the class of NP-hard graph theoretical...

  • Bypassing the Combinatorial Explosion: Using Similarity to Generate and Prioritize T-Wise Test Configurations for Software Product Lines. Henard, Christopher; Papadakis, Mike; Perrouin, Gilles; Klein, Jacques; Heymans, Patrick; Le Traon, Yves // IEEE Transactions on Software Engineering;Jul2014, Vol. 40 Issue 7, p650 

    Large Software Product Lines (SPLs) are common in industry, thus introducing the need of practical solutions to test them. To this end, $t$-wise can help to drastically reduce the number of product configurations to test. Current $t$-wise approaches for SPLs are restricted to small values of...

  • A Self-adaptive Harmony Search Algorithm for Unconstrained optimization Problems. Ping Zhang; Peng Sun; Yining Zhang; Guojun Li // Applied Mechanics & Materials;2014, Issue 596, p192 

    Recently, a new meta-heuristic optimization algorithm-harmony search (HS) was developed, which imitates the behaviors of music improvisation. Although several variants and an increasing number of applications have appeared, one of its main difficulties is how to select suitable parameter values....


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics