The week's pick
Reseach Article
Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems
by
Osama Abdel-raouf,
Ibrahim El-henawy,
Mohamed Abdel-baset
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 86 - Number 10 |
| Year of Publication: 2014 |
| Authors: Osama Abdel-raouf, Ibrahim El-henawy, Mohamed Abdel-baset |
10.5120/15019-3307
|
Osama Abdel-raouf, Ibrahim El-henawy, Mohamed Abdel-baset . Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems. International Journal of Computer Applications. 86, 10 ( January 2014), 8-13. DOI=10.5120/15019-3307
@article{
10.5120/15019-3307,
author = {
Osama Abdel-raouf,
Ibrahim El-henawy,
Mohamed Abdel-baset
},
title = { Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems },
journal = {
International Journal of Computer Applications
},
issue_date = { January 2014 },
volume = { 86 },
number = { 10 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = {
8-13
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume86/number10/15019-3307/
},
doi = { 10.5120/15019-3307 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:03:49.790119+05:30
%A Osama Abdel-raouf
%A Ibrahim El-henawy
%A Mohamed Abdel-baset
%T Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems
%J International Journal of Computer Applications
%@ 0975-8887
%V 86
%N 10
%P 8-13
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract
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).
References
- M. Balinski, "Signature methods for the assignment problem," Operations research, vol. 33, pp. 527-536, 1985.
- R. E. Burkard, M. Dell'Amico, and S. Martello, Assignment problems: Siam, 2009.
- H. W. Kuhn, "The Hungarian method for the assignment problem," Naval research logistics quarterly, vol. 2, pp. 83-97, 1955.
- M. Aigner, Combinatorial theory vol. 234: Springer-Verlag New York, 1979.
- O. Abdel-raouf and M. A. -b. Metwally, "A Survey of Harmony Search Algorithm," International Journal of Computer Applications, vol. 70, 2013.
- Z. W. Geem, J. H. Kim, and G. Loganathan, "A new heuristic optimization algorithm: harmony search," Simulation, vol. 76, pp. 60-68, 2001.
- Z. Geem, J. Kim, and G. Loganathan, "Harmony search optimization: application to pipe network design," International journal of modelling & simulation, vol. 22, pp. 125-133, 2002.
- Z. W. Geem, C. -L. Tseng, and Y. Park, "Harmony search for generalized orienteering problem: best touring in China," in Advances in natural computation, ed: Springer, 2005, pp. 741-750.
- J. H. Kim, Z. W. Geem, and E. S. Kim, "Parameters estimation of the nonlinear muskingum model using Harmony search," JAWRA Journal of the American Water Resources Association, vol. 37, pp. 1131-1138, 2001.
- K. S. Lee and Z. W. Geem, "A new structural optimization method based on the harmony search algorithm," Computers & Structures, vol. 82, pp. 781-798, 2004.
- M. Mahdavi, M. Fesanghary, and E. Damangir, "An improved harmony search algorithm for solving optimization problems," Applied mathematics and computation, vol. 188, pp. 1567-1579, 2007.
- M. G. Omran and M. Mahdavi, "Global-best harmony search," Applied Mathematics and Computation, vol. 198, pp. 643-656, 2008.
- Q. -K. Pan, P. N. Suganthan, M. F. Tasgetiren, and J. J. Liang, "A self-adaptive global best harmony search algorithm for continuous optimization problems," Applied Mathematics and Computation, vol. 216, pp. 830-848, 2010.
- Q. -K. Pan, P. Suganthan, J. Liang, and M. F. Tasgetiren, "A local-best harmony search algorithm with dynamic subpopulations," Engineering Optimization, vol. 42, pp. 101-117, 2010.
- S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, and B. K. Panigrahi, "Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization," Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, vol. 41, pp. 89-106, 2011.
- D. Zou, L. Gao, J. Wu, S. Li, and Y. Li, "A novel global harmony search algorithm for reliability problems," Computers & Industrial Engineering, vol. 58, pp. 307-316, 2010.
- Z. W. Geem, K. S. Lee, and Y. Park, "Application of harmony search to vehicle routing," American Journal of Applied Sciences, vol. 2, p. 1552, 2005.
- R. Barton, "Chaos and fractals," The Mathematics Teacher, vol. 83, pp. 524-529, 1990.
- G. Heidari-Bateni and C. D. McGillem, "A chaotic direct-sequence spread-spectrum communication system," Communications, IEEE Transactions on, vol. 42, pp. 1524-1527, 1994.
- Y. Ke, J. Cheng, and W. Ng, "MIC framework: an information-theoretic approach to quantitative association rule mining," in Data Engineering, 2006. ICDE'06. Proceedings of the 22nd International Conference on, 2006, pp. 112-112.
- B. Alatas, "Chaotic harmony search algorithms," Applied Mathematics and Computation, vol. 216, pp. 2687-2699, 2010.
- P. Gaspard, Chaos, scattering and statistical mechanics vol. 9: Cambridge University Press, 2005.
- C. Letellier, Chaos in nature vol. 81: World Scientific Publishing Company, 2013.
- D. Yang, G. Li, and G. Cheng, "On the efficiency of chaos optimization algorithms for global optimization," Chaos, Solitons & Fractals, vol. 34, pp. 1366-1375, 2007.
Index Terms
Computer Science
Information Sciences
Keywords