{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:58:50Z","timestamp":1764997130169,"version":"3.46.0"},"reference-count":58,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T00:00:00Z","timestamp":1493856000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula. In case the number of variables per clause is equal or greater than three, then this problem is considered NP-complete. Hence, many researchers have developed techniques to deal with MAX-SAT. In this paper, we investigate the impact of different hybrid versions of binary harmony search (HS) algorithm on solving MAX 3-SAT problem. Therefore, we propose two novel hybrid binary HS algorithms. The first hybridizes Flip heuristic with HS, and the second uses Tabu search combined with Flip heuristic. Furthermore, a distinguished feature of our proposed approaches is using an objective function that is updated dynamically based on the stepwise adaptation of weights (SAW) mechanism to evaluate the MAX-SAT solution using the proposed hybrid versions. The performance of the proposed approaches is evaluated over standard MAX-SAT benchmarks, and the results are compared with six evolutionary algorithms and three stochastic local search algorithms. The obtained results are competitive and show that the proposed novel approaches are effective.<\/jats:p>","DOI":"10.1515\/jisys-2016-0129","type":"journal-article","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T06:02:20Z","timestamp":1493877740000},"page":"643-658","source":"Crossref","is-referenced-by-count":4,"title":["MAX-SAT Problem using Hybrid Harmony Search Algorithm"],"prefix":"10.1515","volume":"27","author":[{"given":"Iyad","family":"Abu Doush","sequence":"first","affiliation":[{"name":"Computer Science Department , Yarmouk University , Irbid , Jordan"},{"name":"Department of Computer Science and Information Systems , American University of Kuwait , Salmiya , Kuwait"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amal Lutfi","family":"Quran","sequence":"additional","affiliation":[{"name":"Computer Science Department , Yarmouk University , Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[{"name":"Department of Information Technology , Al-Huson University College, Al-Balqa Applied University , P.O. Box 50, Al-Huson , Irbid , Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed A.","family":"Awadallah","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Al-Aqsa University , P. O. Box 4051 , Gaza , Palestine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2017,5,4]]},"reference":[{"key":"2025120523275890023_j_jisys-2016-0129_ref_001_w2aab3b7b3b1b6b1ab1b5b1Aa","doi-asserted-by":"crossref","unstructured":"I. Abu Doush, Harmony search with multi-parent crossover for solving ieee-cec2011 competition problems, in: Proceedings of the 19th International Conference on Neural Information Processing \u2013 Volume Part IV, ICONIP\u201912, Lecture Notes in Computer Science, vol. 7666. Springer, Berlin, Heidelberg, Doha, Qatar, pp. 108\u2013114, 2012.","DOI":"10.1007\/978-3-642-34478-7_14"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_002_w2aab3b7b3b1b6b1ab1b5b2Aa","doi-asserted-by":"crossref","unstructured":"S. Afkhami, O. R. Ma and A. Soleimani, A binary harmony search algorithm for solving the maximum clique problem, Int. J. Comput. Appl.69 (2013), 38\u201343.","DOI":"10.5120\/11897-7956"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_003_w2aab3b7b3b1b6b1ab1b5b3Aa","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar and A. T. Khader, A harmony search algorithm for university course timetabling, Ann. Oper. Res.194 (2012), 3\u201331.10.1007\/s10479-010-0769-z","DOI":"10.1007\/s10479-010-0769-z"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_004_w2aab3b7b3b1b6b1ab1b5b4Aa","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar, A. T. Khader, M. A. Awadallah, M. H. Alawan and B. Zaqaibeh, Cellular harmony search for optimization problems, J. Appl. Math.20 (2013), 2013.","DOI":"10.1155\/2013\/139464"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_005_w2aab3b7b3b1b6b1ab1b5b5Aa","doi-asserted-by":"crossref","unstructured":"M. A. Al-Betar, M. A. Awadallah, A. T. Khader and Z. A. Abdalkareem, Island-based harmony search for optimization problems, Exp. Syst. Appl.42 (2015), 2026\u20132035.10.1016\/j.eswa.2014.10.008","DOI":"10.1016\/j.eswa.2014.10.008"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_006_w2aab3b7b3b1b6b1ab1b5b6Aa","doi-asserted-by":"crossref","unstructured":"O. M. Alia, R. Mandava, D. Ramachandram and M. E. Aziz, Harmony search-based cluster initialization for fuzzy c-means segmentation of MR images, in: TENCON 2009\u20132009 IEEE Region 10 Conference, IEEE, Singapore, pp. 1\u20136, 2009.","DOI":"10.1109\/TENCON.2009.5396049"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_007_w2aab3b7b3b1b6b1ab1b5b7Aa","doi-asserted-by":"crossref","unstructured":"K. Anwar, A. T. Khader, M. A. Al-Betar and M. A. Awadallah, Harmony search-based hyper-heuristic for examination timetabling, in: 2013 IEEE 9th International Colloquium on Signal Processing and its Applications (CSPA), IEEE, Kuala Lumpur, Malaysia, pp. 176\u2013181, 2013.","DOI":"10.1109\/CSPA.2013.6530037"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_008_w2aab3b7b3b1b6b1ab1b5b8Aa","doi-asserted-by":"crossref","unstructured":"M. A. Awadallah, A. T. Khader, M. A. Al-Betar and P. C. Woon, Office-space-allocation problem using harmony search algorithm, in: Neural Information Processing: 19th International Conference, ICONIP 2012, Doha, Qatar, November 12\u201315, 2012, Proceedings, Part II, pp. 365\u2013374, Springer, Berlin, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-34481-7_45"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_009_w2aab3b7b3b1b6b1ab1b5b9Aa","doi-asserted-by":"crossref","unstructured":"M. A. Awadallah, M. A. Al-Betar, A. T. Khader, A. L. Bolaji and M. Alkoffash, Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem, Neural Comput. Appl.28 (2017), 463\u2013482.10.1007\/s00521-015-2076-8","DOI":"10.1007\/s00521-015-2076-8"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_010_w2aab3b7b3b1b6b1ab1b5c10Aa","doi-asserted-by":"crossref","unstructured":"A. Biere, A. Cimatti, E. Clarke and Y. Zhu, Symbolic model checking without BDDs, in: Tools and Algorithms for the Construction and Analysis of Systems: 5th International Conference, TACAS\u201999 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS\u201999 Amsterdam, The Netherlands, March 22\u201328, 1999 Proceedings, pp. 193\u2013207, Springer, Berlin, Heidelberg, 1999.","DOI":"10.1007\/3-540-49059-0_14"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_011_w2aab3b7b3b1b6b1ab1b5c11Aa","doi-asserted-by":"crossref","unstructured":"N. Bouhmala and O.-C. Granmo, Solving graph coloring problems using learning automata, in: Evolutionary Computation in Combinatorial Optimization: Proceedings of the 8th European Conference, EvoCOP 2008, Naples, Italy, March 26\u201328, 2008, pp. 277\u2013288, Springer, Berlin, Heidelberg, 2008.","DOI":"10.1007\/978-3-540-78604-7_24"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_012_w2aab3b7b3b1b6b1ab1b5c12Aa","doi-asserted-by":"crossref","unstructured":"Y. Cheng, L. Li, T. Lansivaara, S. Chi and Y. Sun, An improved harmony search minimization algorithm using different slip surface generation methods for slope stability analysis, Eng. Optim.40 (2008), 95\u2013115.10.1080\/03052150701618153","DOI":"10.1080\/03052150701618153"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_013_w2aab3b7b3b1b6b1ab1b5c13Aa","doi-asserted-by":"crossref","unstructured":"A. Choi, T. Standley and A. Darwiche, Approximating weighted max-SAT problems by compensating for relaxations, in: Principles and Practice of Constraint Programming \u2013 CP 2009: 15th International Conference, CP 2009 Lisbon, Portugal, September 20\u201324, 2009 Proceedings, pp. 211\u2013225, Springer, Berlin, Heidelberg, 2009.","DOI":"10.1007\/978-3-642-04244-7_19"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_014_w2aab3b7b3b1b6b1ab1b5c14Aa","doi-asserted-by":"crossref","unstructured":"S. A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC \u201871, pp. 151\u2013158, ACM, New York, NY, USA, 1971.","DOI":"10.1145\/800157.805047"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_015_w2aab3b7b3b1b6b1ab1b5c15Aa","doi-asserted-by":"crossref","unstructured":"M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Commun. ACM5 (1962), 394\u2013397.10.1145\/368273.368557","DOI":"10.1145\/368273.368557"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_016_w2aab3b7b3b1b6b1ab1b5c16Aa","unstructured":"S. Fernandes and H. R. Louren\u00e7o, Hybrids combining local search heuristics with exact algorithms, in: V Congreso Espanol sobre Metaheursticas, Algoritmos Evolutivos y Bioinspirados, pp. 269\u2013274, 2007."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_017_w2aab3b7b3b1b6b1ab1b5c17Aa","doi-asserted-by":"crossref","unstructured":"R. Forsati, A. Haghighat and M. Mahdavi, Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing, Comput. Commun.31 (2008), 2505\u20132519.10.1016\/j.comcom.2008.03.019","DOI":"10.1016\/j.comcom.2008.03.019"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_018_w2aab3b7b3b1b6b1ab1b5c18Aa","doi-asserted-by":"crossref","unstructured":"Z. W. Geem, Harmony search in water pump switching problem, in: Advances in Natural Computation: First International Conference, ICNC 2005, Changsha, China, August 27\u201329, 2005, Proceedings, Part III, pp. 751\u2013760, Springer, Berlin, Heidelberg, 2005.","DOI":"10.1007\/11539902_92"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_019_w2aab3b7b3b1b6b1ab1b5c19Aa","doi-asserted-by":"crossref","unstructured":"Z. W. Geem, Particle-swarm harmony search for water network design, Eng. Optim.41 (2009), 297\u2013311.10.1080\/03052150802449227","DOI":"10.1080\/03052150802449227"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_020_w2aab3b7b3b1b6b1ab1b5c20Aa","unstructured":"Z. W. Geem and J. C. Williams, Harmony search and ecological optimization, IJEST1 (2007), 150\u2013154."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_021_w2aab3b7b3b1b6b1ab1b5c21Aa","doi-asserted-by":"crossref","unstructured":"J. Gottlieb and N. Voss, Adaptive fitness functions for the satisfiability problem, in: Parallel Problem Solving From Nature PPSN VI: 6th International Conference Paris, France, September 18\u201320, 2000 Proceedings, pp. 621\u2013630, Springer, Berlin, Heidelberg, 2000.","DOI":"10.1007\/3-540-45356-3_61"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_022_w2aab3b7b3b1b6b1ab1b5c22Aa","doi-asserted-by":"crossref","unstructured":"J. Gottlieb, E. Marchiori and C. Rossi, Evolutionary algorithms for the satisfiability problem, Evol. Comput.10 (2002), 35\u201350.10.1162\/106365602317301763","DOI":"10.1162\/106365602317301763"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_023_w2aab3b7b3b1b6b1ab1b5c23Aa","doi-asserted-by":"crossref","unstructured":"J. Greblicki and J. Kotowski, Analysis of the properties of the harmony search algorithm carried out on the one dimensional binary knapsack problem, in: Computer Aided Systems Theory \u2013 EUROCAST 2009: 12th International Conference, Las Palmas de Gran Canaria, Spain, February 15\u201320, 2009, Revised Selected Papers, pp. 697\u2013704, Springer, Berlin, Heidelberg, 2009.","DOI":"10.1007\/978-3-642-04772-5_90"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_024_w2aab3b7b3b1b6b1ab1b5c24Aa","doi-asserted-by":"crossref","unstructured":"B. H. F. Hasan, I. A. Doush, E. A. Maghayreh, F. Alkhateeb and M. Hamdan, Hybridizing harmony search algorithm with different mutation operators for continuous problems, Appl. Math. Comput.232 (2014), 1166\u20131182.","DOI":"10.1016\/j.amc.2013.12.139"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_025_w2aab3b7b3b1b6b1ab1b5c25Aa","doi-asserted-by":"crossref","unstructured":"H. H. Hoos and T. St\u00fctzle, Local search algorithms for SAT: an empirical evaluation, J. Autom. Reason.24 (2000), 421\u2013481.10.1023\/A:1006350622830","DOI":"10.1023\/A:1006350622830"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_026_w2aab3b7b3b1b6b1ab1b5c26Aa","doi-asserted-by":"crossref","unstructured":"G. Ingram and T. Zhang, Overview of applications and developments in the harmony search algorithm, in: Music-Inspired Harmony Search Algorithm: Theory and Applications, pp. 15\u201337, Springer, Berlin, Heidelberg, 2009.","DOI":"10.1007\/978-3-642-00185-7_2"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_027_w2aab3b7b3b1b6b1ab1b5c27Aa","unstructured":"H. Kautz and B. Selman, Pushing the envelope: planning, propositional logic, and stochastic search, in: Proceedings of the National Conference on Artificial Intelligence, Portland, Oregon, pp. 1194\u20131201, 1996."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_028_w2aab3b7b3b1b6b1ab1b5c28Aa","doi-asserted-by":"crossref","unstructured":"H. Kautz and B. Selman, The state of sat, Discrete Appl. Math.155 (2007), 1514\u20131524.10.1016\/j.dam.2006.10.004","DOI":"10.1016\/j.dam.2006.10.004"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_029_w2aab3b7b3b1b6b1ab1b5c29Aa","doi-asserted-by":"crossref","unstructured":"X. Kong, L. Gao, H. Ouyang and S. Li, Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm, Comput. Oper. Res.63 (2015), 7\u201322.10.1016\/j.cor.2015.04.018","DOI":"10.1016\/j.cor.2015.04.018"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_030_w2aab3b7b3b1b6b1ab1b5c30Aa","unstructured":"L. Kroc, A. Sabharwal, C. P. Gomes and B. Selman, Integrating systematic and local search paradigms: a new strategy for MaxSAT, in: Proceeding IJCAI'09 \u2013 Proceedings of the 21st international joint conference on Artifical intelligence, Pasadena, California, USA, pp. 544\u2013551, 2009."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_031_w2aab3b7b3b1b6b1ab1b5c31Aa","doi-asserted-by":"crossref","unstructured":"F. Lardeux, F. Saubion and J.-K. Hao, Gasat: a genetic local search algorithm for the satisfiability problem, Evol. Comput.14 (2006), 223\u2013253.10.1162\/evco.2006.14.2.223","DOI":"10.1162\/evco.2006.14.2.223"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_032_w2aab3b7b3b1b6b1ab1b5c32Aa","doi-asserted-by":"crossref","unstructured":"A. Layeb, A clonal selection algorithm based tabu search for satisfiability problems, J. Adv. Inform. Technol.3 (2012), 138\u2013146.","DOI":"10.4304\/jait.3.2.138-146"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_033_w2aab3b7b3b1b6b1ab1b5c33Aa","unstructured":"A. Layeb, A particle swarm algorithm for solving the maximum satisfiability problem, in: 12th International Arab Conference in Information Technology, Naif Arab University for Security Sciences, Saudia Arabia, pp. 175\u2013184, 2011."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_034_w2aab3b7b3b1b6b1ab1b5c34Aa","doi-asserted-by":"crossref","unstructured":"A. Layeb and D.-E. Saidouni, A new quantum evolutionary local search algorithm for MAX 3-SAT problem, in: Hybrid Artificial Intelligence Systems: Third International Workshop, HAIS 2008, Burgos, Spain, September 24\u201326, 2008, Proceedings, pp. 172\u2013179, Springer, Berlin, Heidelberg, 2008.","DOI":"10.1007\/978-3-540-87656-4_22"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_035_w2aab3b7b3b1b6b1ab1b5c35Aa","doi-asserted-by":"crossref","unstructured":"A. Layeb, A. H. Deneche and S. Meshoul, A new artificial immune system for solving the maximum satisfiability problem, in: Trends in Applied Intelligent Systems: 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA\/AIE 2010, Cordoba, Spain, June 1\u20134, 2010, Proceedings, Part II, pp. 136\u2013142, Springer, Berlin, Heidelberg, 2010.","DOI":"10.1007\/978-3-642-13025-0_15"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_036_w2aab3b7b3b1b6b1ab1b5c36Aa","doi-asserted-by":"crossref","unstructured":"K. S. Lee and Z. W. Geem, A new structural optimization method based on the harmony search algorithm, Comput. Struct.82 (2004), 781\u2013798.10.1016\/j.compstruc.2004.01.002","DOI":"10.1016\/j.compstruc.2004.01.002"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_037_w2aab3b7b3b1b6b1ab1b5c37Aa","doi-asserted-by":"crossref","unstructured":"C. M. Li, F. Many\u00e0 and J. Planes, Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers, in: Principles and Practice of Constraint Programming \u2013 CP 2005: 11th International Conference, CP 2005, Sitges, Spain, October 1\u20135, 2005. Proceedings, Springer, Berlin, Heidelberg, 2005, pp. 403\u2013414.","DOI":"10.1007\/11564751_31"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_038_w2aab3b7b3b1b6b1ab1b5c38Aa","unstructured":"E. Marchiori and C. Rossi, A flipping genetic algorithm for hard 3-SAT problems, in: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann Publishers, Orlando, Florida, USA, Vol. 1, pp. 393\u2013400, 1999."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_039_w2aab3b7b3b1b6b1ab1b5c39Aa","doi-asserted-by":"crossref","unstructured":"F. Mari\u0107, Formal verification of a modern sat solver by shallow embedding into Isabelle\/HOL, Theor. Comput. Sci.411 (2010), 4333\u20134356.10.1016\/j.tcs.2010.09.014","DOI":"10.1016\/j.tcs.2010.09.014"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_040_w2aab3b7b3b1b6b1ab1b5c40Aa","doi-asserted-by":"crossref","unstructured":"J. P. Marques-Silva and K. A. Sakallah, Grasp: a search algorithm for propositional satisfiability, IEEE Trans. Comput.48 (1999), 506\u2013521.10.1109\/12.769433","DOI":"10.1109\/12.769433"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_041_w2aab3b7b3b1b6b1ab1b5c41Aa","doi-asserted-by":"crossref","unstructured":"M. Mastrolilli and L. M. Gambardella, Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? Eur. J. Oper. Res.166 (2005), 63\u201376.10.1016\/j.ejor.2003.01.005","DOI":"10.1016\/j.ejor.2003.01.005"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_042_w2aab3b7b3b1b6b1ab1b5c42Aa","unstructured":"B. Mazure, L. Sas and \u00c9. Gr\u00e9goire, Tabu search for sat, in: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 97, IAAI 97, Providence, Rhode Island, pp. 281\u2013285, 1997."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_043_w2aab3b7b3b1b6b1ab1b5c43Aa","doi-asserted-by":"crossref","unstructured":"M. E. B. Mena\u00ef and M. Batouche, A backbone-based co-evolutionary heuristic for partial MAX-SAT, in: Artificial Evolution: 7th International Conference, Evolution Artificielle, EA 2005, Lille, France, October 26\u201328, 2005, Revised Selected Papers, pp. 155\u2013166, Springer, Berlin, Heidelberg, 2006.","DOI":"10.1007\/11740698_14"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_044_w2aab3b7b3b1b6b1ab1b5c44Aa","unstructured":"R. G. Michael and S. J. David, Computers and intractability: a guide to the theory of np-completeness, WH Freeman and Co., San Francisco, 1979."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_045_w2aab3b7b3b1b6b1ab1b5c45Aa","doi-asserted-by":"crossref","unstructured":"A. Nasrollahi, M. Saffarzadeh, A. Isfahanian and M. Ghayekhloo, Application of a new binary harmony search algorithm in highway rehabilitation decision-making problems: a case study in Iran, Civil Eng. Environ. Syst.32 (2015), 335\u2013350.10.1080\/10286608.2015.1057129","DOI":"10.1080\/10286608.2015.1057129"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_046_w2aab3b7b3b1b6b1ab1b5c46Aa","doi-asserted-by":"crossref","unstructured":"J. Rintanen, K. Heljanko and I. Niemel\u00e4, Planning as satisfiability: parallel plans and algorithms for plan search, Artif. Intell.170 (2006), 1031\u20131080.10.1016\/j.artint.2006.08.002","DOI":"10.1016\/j.artint.2006.08.002"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_047_w2aab3b7b3b1b6b1ab1b5c47Aa","doi-asserted-by":"crossref","unstructured":"T. Sandholm, Algorithm for optimal winner determination in combinatorial auctions, Artif. Intell.135 (2002), 1\u201354.10.1016\/S0004-3702(01)00159-X","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_048_w2aab3b7b3b1b6b1ab1b5c48Aa","unstructured":"B. Selman, H. J. Levesque, D. G. Mitchell, A new method for solving hard satisfiability problems, AAAI, San Jose, CA, 92 (1992), 440\u2013446."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_049_w2aab3b7b3b1b6b1ab1b5c49Aa","doi-asserted-by":"crossref","unstructured":"A. Smith, A. Veneris, M. F. Ali and A. Viglas, Fault diagnosis and logic debugging using boolean satisfiability, IEEE Trans. Comput.-Aided Design Integr. Circuits Syst.24 (2005), 1606\u20131621.10.1109\/TCAD.2005.852031","DOI":"10.1109\/TCAD.2005.852031"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_050_w2aab3b7b3b1b6b1ab1b5c50Aa","doi-asserted-by":"crossref","unstructured":"A. A. Taleizadeh, S. T. A. Niaki and F. Barzinpour, Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: a harmony search algorithm, Appl. Math. Comput.217 (2011), 9234\u20139253.","DOI":"10.1016\/j.amc.2011.04.001"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_051_w2aab3b7b3b1b6b1ab1b5c51Aa","doi-asserted-by":"crossref","unstructured":"P. Tangpattanakul and P. Artrit, Minimum-time trajectory of robot manipulator using harmony search algorithm, in: 6th International Conference on Electrical Engineering\/Electronics, Computer, Telecommunications and Information Technology, 2009. ECTI-CON 2009, Vol. 1, IEEE, Bangkok, Thailand, pp. 354\u2013357, 2009.","DOI":"10.1109\/ECTICON.2009.5137025"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_052_w2aab3b7b3b1b6b1ab1b5c52Aa","unstructured":"R. Walter, C. Zengler and W. K\u00fcchlin, Applications of maxsat in automotive configuration, in: Configuration Workshop, Vienna, Austria, pp. 21\u201328, 2013."},{"key":"2025120523275890023_j_jisys-2016-0129_ref_053_w2aab3b7b3b1b6b1ab1b5c53Aa","doi-asserted-by":"crossref","unstructured":"L. Wang, Y. Xu, Y. Mao and M. Fei, A discrete harmony search algorithm, in: Life System Modeling and Intelligent Computing Conference, Springer, Wuxi, China, pp. 37\u201343, 2010.","DOI":"10.1007\/978-3-642-15859-9_6"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_054_w2aab3b7b3b1b6b1ab1b5c54Aa","doi-asserted-by":"crossref","unstructured":"L. Wang, Q.-K. Pan and M. F. Tasgetiren, A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem, Comput. Ind. Eng.61 (2011), 76\u201383.10.1016\/j.cie.2011.02.013","DOI":"10.1016\/j.cie.2011.02.013"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_055_w2aab3b7b3b1b6b1ab1b5c55Aa","doi-asserted-by":"crossref","unstructured":"L. Wang, R. Yang, Y. Xu, Q. Niu, P. M. Pardalos and M. Fei, An improved adaptive binary harmony search algorithm, Inform. Sci.232 (2013), 58\u201387.10.1016\/j.ins.2012.12.043","DOI":"10.1016\/j.ins.2012.12.043"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_056_w2aab3b7b3b1b6b1ab1b5c56Aa","doi-asserted-by":"crossref","unstructured":"H. Xu, R. A. Rutenbar and K. Sakallah, sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing, IEEE Trans. Comput.-Aided Design Integr. Circuits Syst.22 (2003), 814\u2013820.10.1109\/TCAD.2003.811450","DOI":"10.1109\/TCAD.2003.811450"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_057_w2aab3b7b3b1b6b1ab1b5c57Aa","doi-asserted-by":"crossref","unstructured":"H. Zhang, H. Shen and F. Manya, Exact algorithms for max-sat, Electron. Notes Theor. Comput. Sci.86 (2003), 190\u2013203.10.1016\/S1571-0661(04)80663-7","DOI":"10.1016\/S1571-0661(04)80663-7"},{"key":"2025120523275890023_j_jisys-2016-0129_ref_058_w2aab3b7b3b1b6b1ab1b5c58Aa","doi-asserted-by":"crossref","unstructured":"D. Zou, L. Gao, S. Li and J. Wu, Solving 0\u20131 knapsack problem by a novel global harmony search algorithm, Appl. Soft Comput.11 (2011), 1556\u20131564.10.1016\/j.asoc.2010.07.019","DOI":"10.1016\/j.asoc.2010.07.019"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jisys.2018.27.issue-4\/jisys-2016-0129\/jisys-2016-0129.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0129\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0129\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:28:37Z","timestamp":1764977317000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0129\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,4]]},"references-count":58,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,7,14]]},"published-print":{"date-parts":[[2018,10,25]]}},"alternative-id":["10.1515\/jisys-2016-0129"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2016-0129","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2017,5,4]]}}}