{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:42Z","timestamp":1775054082174,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004482","name":"Kuwait University","doi-asserted-by":"publisher","award":["EO 03\/09"],"award-info":[{"award-number":["EO 03\/09"]}],"id":[{"id":"10.13039\/501100004482","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s12293-015-0163-0","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T02:53:21Z","timestamp":1431917601000},"page":"291-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive probabilistic harmony search for binary optimization problems"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1301-2620","authenticated-orcid":false,"given":"Ayed A.","family":"Salman","sequence":"first","affiliation":[]},{"given":"Mahamed G.","family":"Omran","sequence":"additional","affiliation":[]},{"given":"Imtiaz","family":"Ahmad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"issue":"2","key":"163_CR1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z Geem","year":"2001","unstructured":"Geem Z, Kim J, Loganathan G (2001) A new heuristic optimization algorithm. Transactions of The society for modeling and simulation international\u2014SIMULATION harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"key":"163_CR2","doi-asserted-by":"crossref","unstructured":"Geem Z (2008) Novel derivative of harmony search algorithm for discrete design variables. Appl Math Comput 199(1):223\u2013230","DOI":"10.1016\/j.amc.2007.09.049"},{"key":"163_CR3","doi-asserted-by":"crossref","unstructured":"Geem ZW (2006) Improved harmony search from ensemble of music players. In: Gabrys B, Howlett RJ, Jain LC (eds) KES (1). Lecture notes in computer science, vol 4251. Springer, Berlin, pp 86\u201393","DOI":"10.1007\/11892960_11"},{"key":"163_CR4","doi-asserted-by":"crossref","unstructured":"Mukhopadhyay A, Roy A, Das S, Das S, Abraham A (2008) Population-variance and explorative power of harmony search: an analysis. In: ICDIM\u201908, organized at Deen Dayal Upadhyaya College, New Delhi, India, pp 775\u2013781","DOI":"10.1109\/ICDIM.2008.4746793"},{"key":"163_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00185-7","volume-title":"Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence","author":"Z Geem","year":"2009","unstructured":"Geem Z (2009) Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence. Springer, Berlin"},{"issue":"1","key":"163_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10462-010-9201-y","volume":"36","author":"OM Alia","year":"2011","unstructured":"Alia OM, Mandava R (2011) The variants of the harmony search algorithm: an overview. Artif Intell Rev 36(1):49\u201368","journal-title":"Artif Intell Rev"},{"key":"163_CR7","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1111\/j.1752-1688.2001.tb03627.x","volume":"37","author":"J Kim","year":"2001","unstructured":"Kim J, Geem Z, Kim E (2001) Parameter estimation of the nonlinear muskingum model using harmony search. J Am Water Resour Assoc 37:1131\u20131138","journal-title":"J Am Water Resour Assoc"},{"issue":"2","key":"163_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/02286203.2002.11442233","volume":"22","author":"ZW Geem","year":"2002","unstructured":"Geem ZW, Kim JH, Loganathan GV (2002) Harmony search optimization: application to pipe network design. Int J Model Simul 22(2):125\u2013133","journal-title":"Int J Model Simul"},{"issue":"9\u201310","key":"163_CR9","first-page":"781","volume":"82","author":"KS Lee","year":"2004","unstructured":"Lee KS, Geem ZW (2004) A new structural optimization method based on the harmony search algorithm. Comput Struct 82(9\u201310):781\u2013798","journal-title":"Comput Struct"},{"key":"163_CR10","doi-asserted-by":"crossref","unstructured":"Geem ZW, Tseng C-L, Park Y (2005) Harmony search for generalized orienteering problem: best touring in China. In: Proceedings of the first international conference on advances in natural computation, ICNC\u201905, volume Part III. Springer, Berlin, pp 741\u2013750","DOI":"10.1007\/11539902_91"},{"issue":"36\u201338","key":"163_CR11","first-page":"3902","volume":"194","author":"KS Lee","year":"2005","unstructured":"Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36\u201338):3902\u20133933","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"3","key":"163_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/03052150500467430","volume":"38","author":"ZW Geem","year":"2006","unstructured":"Geem ZW (2006) Optimal cost design of water distribution networks using harmony search. Eng Optim 38(3):259\u2013277","journal-title":"Eng Optim"},{"key":"163_CR13","unstructured":"Seok Jang W, Il Kang H, Hee Lee B (2008) Hybrid simplex-harmony search method for optimization problems. In: IEEE congress on evolutionary computation. IEEE, pp 4157\u20134164"},{"issue":"5","key":"163_CR14","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1016\/j.chaos.2008.09.028","volume":"41","author":"LS Coelho","year":"2009","unstructured":"Coelho LS, de Andrade Bernert DL (2009) An improved harmony search algorithm for synchronization of discrete-time chaotic systems. Chaos Solitons Fractals 41(5):2526\u20132532","journal-title":"Chaos Solitons Fractals"},{"issue":"1","key":"163_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3\u201331","journal-title":"Ann Oper Res"},{"key":"163_CR16","doi-asserted-by":"crossref","unstructured":"Abual-Rub M, Al-Betar M, Abdullah R, Khader A (2012) A hybrid harmony search algorithm for ab initio protein tertiary structure prediction. Netw Model Anal Health Inform Bioinform 1(3):69\u201385","DOI":"10.1007\/s13721-012-0013-7"},{"issue":"2","key":"163_CR17","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"MG Omran","year":"2008","unstructured":"Omran MG, Mahdavi M (2008) Global-best harmony search. Appl Math Comput 198(2):643\u2013656","journal-title":"Appl Math Comput"},{"issue":"2","key":"163_CR18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/03052150701618153","volume":"40","author":"YM Cheng","year":"2008","unstructured":"Cheng YM, Li L, Lansivaara T, Chi SC, Sun YJ (2008) An improved harmony search minimization algorithm using different slip surface generation methods for slope stability analysis. Eng Optim 40(2):95\u2013115","journal-title":"Eng Optim"},{"issue":"4","key":"163_CR19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/03052150802449227","volume":"41","author":"ZW Geem","year":"2009","unstructured":"Geem ZW (2009) Particle-swarm harmony search for water network design. Eng Optim 41(4):297\u2013311","journal-title":"Eng Optim"},{"issue":"10","key":"163_CR20","doi-asserted-by":"crossref","first-page":"6095","DOI":"10.1016\/j.amc.2011.11.095","volume":"218","author":"M Al-Betar","year":"2012","unstructured":"Al-Betar M, Doush I, Khader A, Awadallah M (2012) Novel selection schemes for harmony search. Appl Math Comput 218(10):6095\u20136117","journal-title":"Appl Math Comput"},{"issue":"8","key":"163_CR21","doi-asserted-by":"crossref","first-page":"5270","DOI":"10.1016\/j.asoc.2011.05.033","volume":"11","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Wang L, Gao L (2011) A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. J Appl Soft Comput 11(8):5270\u20135280","journal-title":"J Appl Soft Comput"},{"key":"163_CR22","doi-asserted-by":"crossref","unstructured":"Wang L, Xu Y, Mao Y, Fei M (2010) A discrete harmony search algorithm. In: Li K, Li X, Ma S, Irwin G (eds) Life system modeling and intelligent computing. Communications in computer and information science, vol 98. Springer, Berlin, pp 37\u201343","DOI":"10.1007\/978-3-642-15859-9_6"},{"key":"163_CR23","doi-asserted-by":"crossref","unstructured":"Wang L, Mao Y, Niu Q, Fei M (2011) A multi-objective binary harmony search algorithm. In: Tan Y, Shi Y, Chai Y, Wang G (eds) Advances in swarm intelligence. Lecture notes in computer science, vol 6729. Springer, Berlin, pp 74\u201381","DOI":"10.1007\/978-3-642-21524-7_10"},{"key":"163_CR24","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","volume":"232","author":"L Wang","year":"2013","unstructured":"Wang L, Yang R, Xu Y, Niu Q, Pardalos PM, Fei M (2013) An improved adaptive binary harmony search algorithm. Inf Sci 232:58\u201387","journal-title":"Inf Sci"},{"key":"163_CR25","volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","year":"2002","unstructured":"Larra\u00f1aga P, Lozano JA (eds) (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Dordrecht"},{"key":"163_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation and machine learning (information science and statistics)","author":"RY Rubinstein","year":"2004","unstructured":"Rubinstein RY, Kroese DP (2004) The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation and machine learning (information science and statistics), 1st edn. Springer, Berlin","edition":"1"},{"key":"163_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-34954-9","volume-title":"Scalable optimization via probabilistic modeling: from algorithms to applications (studies in computational intelligence)","author":"M Pelikan","year":"2006","unstructured":"Pelikan M, Sastry K, Paz EC (2006) Scalable optimization via probabilistic modeling: from algorithms to applications (studies in computational intelligence). Springer, Secaucus"},{"issue":"1","key":"163_CR28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P Boer de","year":"2005","unstructured":"de Boer P, Kroese DP, Mannor S, Rubinstein RY (2005) A tutorial on the cross entropy method. Ann Oper Res 134(1):19\u201367","journal-title":"Ann Oper Res"},{"key":"163_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"163_CR30","first-page":"24","volume":"2","author":"XS Chen","year":"2010","unstructured":"Chen XS, Ong YS, Lim MH (2010) Research frontier: memetic computation\u2014past, present & future. IEEE Comput Intell Mag 2(5):24\u201336","journal-title":"IEEE Comput Intell Mag"},{"issue":"15","key":"163_CR31","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"5","author":"XS Chen","year":"2011","unstructured":"Chen XS, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 5(15):591\u2013607","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"163_CR32","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10732-008-9074-2","volume":"15","author":"M Caserta","year":"2009","unstructured":"Caserta M, Cabo-Nodar M (2009) A cross entropy based algorithm for reliability problems. J Heuristics 15(5):479\u2013501","journal-title":"J Heuristics"},{"key":"163_CR33","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","volume":"99","author":"RY Rubinstein","year":"1996","unstructured":"Rubinstein RY (1996) Optimization of computer simulation models with rare events. Eur J Oper Res 99:89\u2013112","journal-title":"Eur J Oper Res"},{"issue":"2","key":"163_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"1","author":"R Rubinstein","year":"1999","unstructured":"Rubinstein R (1999) The cross-entropy method for combinatorial and continuous optimization. Methodol Comput Appl Probab 1(2):127\u2013190","journal-title":"Methodol Comput Appl Probab"},{"key":"163_CR35","first-page":"304","volume-title":"Stochastic optimization: algorithms and applications","author":"RY Rubinstein","year":"2001","unstructured":"Rubinstein RY (2001) Combinatorial optimization, cross-entropy, ants and rare events. In: Uryasev S, Pardalos PM (eds) Stochastic optimization: algorithms and applications. Kluwer, Dordrecht, pp 304\u2013358"},{"issue":"1","key":"163_CR36","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10479-005-5728-8","volume":"134","author":"G Alon","year":"2005","unstructured":"Alon G, Kroese DP, Raviv T, Rubinstein RY (2005) Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment. Ann OR 134(1):137\u2013151","journal-title":"Ann OR"},{"issue":"1","key":"163_CR37","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10479-005-5729-7","volume":"134","author":"K Chepuri","year":"2005","unstructured":"Chepuri K, de Mello TH (2005) Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann Oper Res 134(1):153\u2013181","journal-title":"Ann Oper Res"},{"issue":"1","key":"163_CR38","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/511442.511444","volume":"12","author":"RY Rubinstein","year":"2002","unstructured":"Rubinstein RY (2002) Cross-entropy and rare events for maximal cut and partition problems. ACM Trans Model Comput Simul 12(1):27\u201353","journal-title":"ACM Trans Model Comput Simul"},{"key":"163_CR39","doi-asserted-by":"crossref","unstructured":"Keith J, Kroese DP (2002) SABRES: sequence alignment by rare event simulation. In: Proceedings of the winter simulation conference, San Diego, pp 320\u2013327","DOI":"10.1109\/WSC.2002.1172901"},{"issue":"9","key":"163_CR40","doi-asserted-by":"crossref","first-page":"28","DOI":"10.4304\/jsw.3.9.28-35","volume":"3","author":"L Wang","year":"2008","unstructured":"Wang L, Wang X, Fu J, Zhen L (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3(9):28\u201335","journal-title":"J Softw"},{"key":"163_CR41","doi-asserted-by":"crossref","unstructured":"Deng C, Zhao B, Yang Y, Deng A (2010) Novel binary differential evolution without scale factor f. In: Third international workshop on advanced computational intelligence, Suzhou, Jiangsu, China, pp 250\u2013253","DOI":"10.1109\/IWACI.2010.5585113"},{"issue":"4","key":"163_CR42","first-page":"415","volume":"4","author":"DE Goldberg","year":"1990","unstructured":"Goldberg DE, Deb K, Korb B (1990) Messy genetic algorithms revisited: studies in mixed size and scale. Complex Syst 4(4):415\u2013444","journal-title":"Complex Syst"},{"issue":"3","key":"163_CR43","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1162\/106365600750078817","volume":"8","author":"AA Salman","year":"2000","unstructured":"Salman AA, Mehrotra K, Mohan CK (2000) Adaptive linkage crossover. Evol Comput 8(3):341\u2013370","journal-title":"Evol Comput"},{"key":"163_CR44","unstructured":"Goldberg DE, Deb K, Horn J (1992) Massive multimodality, deception, and genetic algorithms. In: Ma\u201dnner R, Manderick B (eds) Parallel problem solving from nature 2, PPSN-II, Brussels, Belgium, September 28\u201330. Elsevier, Amsterdam, pp 37\u201348"},{"issue":"2","key":"163_CR45","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein H, Mahnig T, Rodriguez AO (1999) Schemata, distributions and graphical models in evolutionary optimization. J Heuristics 5(2):215\u2013247","journal-title":"J Heuristics"},{"issue":"2","key":"163_CR46","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/72.363481","volume":"6","author":"N Ansari","year":"1995","unstructured":"Ansari N, Hou ESH, Yu Y (1995) A new method to optimize the satellite broadcasting schedules using the mean field annealing of a Hopfield neural network. IEEE Trans Neural Netw Learn Syst 6(2):470\u2013483","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"163_CR47","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/72.557699","volume":"8","author":"N Funabiki","year":"1997","unstructured":"Funabiki N, Nishikawa S (1997) A binary Hopfield neural-network approach for satellite broadcast scheduling problems. Trans Neural Netw 8(2):441\u2013445","journal-title":"Trans Neural Netw"},{"key":"163_CR48","unstructured":"Shen YJ, Wang MS (2007) Optimizing satellite broadcast scheduling problem using the competitive Hopfield neural network. In: IEEE wireless telecommunications symposium (WTS-2007), Pomona, CA, pp 1\u20136"},{"key":"163_CR49","doi-asserted-by":"crossref","unstructured":"Chen J-C, Wen CK, Ting P (2008) Factor graphs for satellite broadcast scheduling problems. In: IEEE 68th vehicular technology conference, Canada, pp 1\u20135","DOI":"10.1109\/VETECF.2008.67"},{"key":"163_CR50","unstructured":"Salman A (2014) Satellite broadcast scheduling problem. Ayed Salman\u2019s personal website. https:\/\/sites.google.com\/site\/ayedsalman\/research\/sbsp . Accessed Feb 2014"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0163-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-015-0163-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0163-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T02:42:11Z","timestamp":1566700931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-015-0163-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s12293-015-0163-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}