{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:50:48Z","timestamp":1762325448205,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007225","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","award":["MOST111-2221-E-324-021"],"award-info":[{"award-number":["MOST111-2221-E-324-021"]}],"id":[{"id":"10.13039\/100007225","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04880-y","type":"journal-article","created":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T14:02:44Z","timestamp":1666792964000},"page":"5730-5758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Incorporate seagull optimization into ordinal optimization for solving the constrained binary simulation optimization problems"],"prefix":"10.1007","volume":"79","author":[{"given":"Shih-Cheng","family":"Horng","sequence":"first","affiliation":[]},{"given":"Shieh-Shing","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"key":"4880_CR1","doi-asserted-by":"publisher","first-page":"108102","DOI":"10.1016\/j.cpc.2021.108102","volume":"269","author":"E Valiante","year":"2021","unstructured":"Valiante E, Hernandez M, Barzegar A, Katzgraber HG (2021) Computational overhead of locality reduction in binary optimization problems. Comput Phys Commun 269:108102","journal-title":"Comput Phys Commun"},{"key":"4880_CR2","doi-asserted-by":"publisher","first-page":"105576","DOI":"10.1016\/j.asoc.2019.105576","volume":"82","author":"M Aslan","year":"2019","unstructured":"Aslan M, Gunduz M, Kiran MS (2019) JayaX: Jaya algorithm with XOR operator for binary optimization. Appl Soft Comput 82:105576","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4880_CR3","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1007\/s12351-018-0427-9","volume":"20","author":"A Baykasoglu","year":"2020","unstructured":"Baykasoglu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction algorithm for binary optimization problems. Oper Res Int J 20(4):2555\u20132581","journal-title":"Oper Res Int J"},{"key":"4880_CR4","doi-asserted-by":"publisher","first-page":"107655","DOI":"10.1016\/j.compchemeng.2021.107655","volume":"159","author":"J Javaloyes-Anton","year":"2022","unstructured":"Javaloyes-Anton J, Kronqvist J, Caballero JA (2022) Simulation-based optimization of distillation processes using an extended cutting plane algorithm. Comput Chem Eng 159:107655","journal-title":"Comput Chem Eng"},{"issue":"2","key":"4880_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10589-019-00153-2","volume":"75","author":"K Kobayashi","year":"2020","unstructured":"Kobayashi K, Takano Y (2020) A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems. Comput Optim Appl 75(2):493\u2013513","journal-title":"Comput Optim Appl"},{"issue":"3","key":"4880_CR6","doi-asserted-by":"publisher","first-page":"3293","DOI":"10.32604\/cmc.2021.015495","volume":"67","author":"P Anghelescu","year":"2021","unstructured":"Anghelescu P (2021) Parallel optimization of program instructions using genetic algorithms. CMC-Comput Mater Contin 67(3):3293\u20133310","journal-title":"CMC-Comput Mater Contin"},{"key":"4880_CR7","doi-asserted-by":"publisher","first-page":"107635","DOI":"10.1016\/j.asoc.2021.107635","volume":"111","author":"NK Sreelaja","year":"2021","unstructured":"Sreelaja NK (2021) Ant colony optimization based light weight binary search for efficient signature matching to filter Ransomware. Appl Soft Comput 111:107635","journal-title":"Appl Soft Comput"},{"key":"4880_CR8","doi-asserted-by":"publisher","first-page":"100454","DOI":"10.1016\/j.swevo.2018.10.005","volume":"50","author":"WW Zhang","year":"2019","unstructured":"Zhang WW, Zhang WZ, Yen GG, Jing HL (2019) A cluster-based clonal selection algorithm for optimization in dynamic environment. Swarm Evolut Comput 50:100454","journal-title":"Swarm Evolut Comput"},{"issue":"10","key":"4880_CR9","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/JAS.2021.1004129","volume":"8","author":"J Tang","year":"2021","unstructured":"Tang J, Liu G, Pan QT (2021) A review on representative swarm intelligence algorithms for solving optimization problems: applications and trends. IEEE-CAA J Autom Sin 8(10):1627\u20131643","journal-title":"IEEE-CAA J Autom Sin"},{"key":"4880_CR10","doi-asserted-by":"publisher","first-page":"107250","DOI":"10.1016\/j.cie.2021.107250","volume":"157","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-qaness MAA, Gandomi AH (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng 157:107250","journal-title":"Comput Ind Eng"},{"key":"4880_CR11","doi-asserted-by":"publisher","first-page":"106711","DOI":"10.1016\/j.knosys.2020.106711","volume":"213","author":"F MiarNaeimi","year":"2021","unstructured":"MiarNaeimi F, Azizyan G, Rashki M (2021) Horse herd optimization algorithm: A nature-inspired algorithm for high-dimensional optimization problems. Knowl-Based Syst 213:106711","journal-title":"Knowl-Based Syst"},{"key":"4880_CR12","doi-asserted-by":"publisher","first-page":"107050","DOI":"10.1016\/j.cie.2020.107050","volume":"152","author":"A Mohammadi-Balani","year":"2021","unstructured":"Mohammadi-Balani A, Nayeri MD, Azar A, Taghizadeh-Yazdi M (2021) Golden eagle optimizer: A nature-inspired metaheuristic algorithm. Comput Ind Eng 152:107050","journal-title":"Comput Ind Eng"},{"issue":"6","key":"4880_CR13","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1080\/0305215X.2019.1624740","volume":"52","author":"AG Hussien","year":"2020","unstructured":"Hussien AG, Hassanien AE, Houssein EH, Amin M, Azar AT (2020) New binary whale optimization algorithm for discrete optimization problems. Eng Optim 52(6):945\u2013959","journal-title":"Eng Optim"},{"key":"4880_CR14","doi-asserted-by":"publisher","first-page":"106946","DOI":"10.1016\/j.cie.2020.106946","volume":"151","author":"M Abdel-Basset","year":"2021","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S (2021) A binary equilibrium optimization algorithm for 0\u20131 knapsack problems. Comput Ind Eng 151:106946","journal-title":"Comput Ind Eng"},{"key":"4880_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.knosys.2018.11.024","volume":"165","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kumar V (2019) Seagull optimization algorithm: Theory and its applications for large-scale industrial engineering problems. Knowl-Based Syst 165:169\u2013196","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"4880_CR16","doi-asserted-by":"publisher","first-page":"640","DOI":"10.3139\/120.111529","volume":"62","author":"N Panagant","year":"2020","unstructured":"Panagant N, Pholdee N, Bureerat S, Yildiz AR, Sait SM (2020) Seagull optimization algorithm for solving real-world design optimization problems. Materials Testing 62(6):640\u2013644","journal-title":"Materials Testing"},{"key":"4880_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68692-9","volume-title":"Ordinal optimization: soft optimization for hard problems","author":"YC Ho","year":"2007","unstructured":"Ho YC, Zhao QC, Jia QS (2007) Ordinal optimization: soft optimization for hard problems. Springer-Verlag, New York"},{"issue":"4","key":"4880_CR18","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/LRA.2020.3005125","volume":"5","author":"AD Liu","year":"2020","unstructured":"Liu AD, Luh PB, Bragin MA, Yan B (2020) Ordinal-optimization concept enabled decomposition and coordination of mixed-integer linear programming problems. IEEE Robot Autom Lett 5(4):5051\u20135058","journal-title":"IEEE Robot Autom Lett"},{"issue":"1","key":"4880_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.3390\/app11010136","volume":"11","author":"SC Horng","year":"2021","unstructured":"Horng SC, Lee CT (2021) Integration of ordinal optimization with ant lion optimization for solving the computationally expensive simulation optimization problems. Appl Sci 11(1):136","journal-title":"Appl Sci"},{"issue":"6","key":"4880_CR20","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.3390\/app10062075","volume":"10","author":"SC Horng","year":"2020","unstructured":"Horng SC, Lin SS (2020) Coupling elephant herding with ordinal optimization for solving the stochastic inequality constrained optimization problems. Appl Sci 10(6):2075","journal-title":"Appl Sci"},{"issue":"11","key":"4880_CR21","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.3390\/app8112153","volume":"8","author":"SC Horng","year":"2018","unstructured":"Horng SC, Lin SS (2018) Embedding ordinal optimization into tree\u2013seed algorithm for solving the probabilistic constrained simulation optimization problems. Appl Sci 8(11):2153","journal-title":"Appl Sci"},{"key":"4880_CR22","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.matcom.2019.06.003","volume":"166","author":"SC Horng","year":"2019","unstructured":"Horng SC, Lin SS (2019) Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems. Math Comput Simul 166:346\u2013364","journal-title":"Math Comput Simul"},{"key":"4880_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ast.2017.12.030","volume":"75","author":"JT Hwang","year":"2018","unstructured":"Hwang JT, Martins JRRA (2018) A fast-prediction surrogate model for large datasets. Aerosp Sci Technol 75:74\u201387","journal-title":"Aerosp Sci Technol"},{"issue":"3","key":"4880_CR24","doi-asserted-by":"publisher","first-page":"444","DOI":"10.3390\/atmos13030444","volume":"13","author":"SH Huang","year":"2022","unstructured":"Huang SH, Mahmud K, Chen CJ (2022) Meaningful trend in climate time series: A discussion based on linear and smoothing techniques for drought analysis in Taiwan. Atmosphere 13(3):444","journal-title":"Atmosphere"},{"issue":"3","key":"4880_CR25","doi-asserted-by":"publisher","first-page":"A1809","DOI":"10.1137\/19M1238265","volume":"42","author":"R Estrin","year":"2020","unstructured":"Estrin R, Friedlander MP, Orban D, Saunders MA (2020) Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. SIAM J Sci Comput 42(3):A1809\u2013A1835","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"4880_CR26","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1080\/17480930.2019.1577940","volume":"34","author":"CK Arthur","year":"2020","unstructured":"Arthur CK, Temeng VA, Ziggah YY (2020) Multivariate adaptive regression splines (MARS) approach to blast-induced ground vibration prediction. Int J Min Reclam Environ 34(3):198\u2013222","journal-title":"Int J Min Reclam Environ"},{"key":"4880_CR27","doi-asserted-by":"publisher","first-page":"106589","DOI":"10.1016\/j.ast.2021.106589","volume":"112","author":"HD Hu","year":"2021","unstructured":"Hu HD, Yu JY, Song YP, Chen F (2021) The application of support vector regression and mesh deformation technique in the optimization of transonic compressor design. Aerosp Sci Technol 112:106589","journal-title":"Aerosp Sci Technol"},{"key":"4880_CR28","doi-asserted-by":"publisher","first-page":"107319","DOI":"10.1016\/j.asoc.2021.107319","volume":"106","author":"Y Chen","year":"2021","unstructured":"Chen Y, Tong CD, Ge YH, Lan T (2021) Fault detection based on auto-regressive extreme learning machine for nonlinear dynamic processes. Appl Soft Comput 106:107319","journal-title":"Appl Soft Comput"},{"issue":"1","key":"4880_CR29","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TAC.2020.2982907","volume":"66","author":"WX Han","year":"2021","unstructured":"Han WX, Wang ZH, Shen Y, Xu B (2021) Interval estimation for uncertain systems via polynomial chaos expansions. IEEE Trans Autom Control 66(1):468\u2013475","journal-title":"IEEE Trans Autom Control"},{"issue":"1","key":"4880_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00051144.2021.1997253","volume":"63","author":"A Subramanian","year":"2022","unstructured":"Subramanian A, Raman J (2022) Modified seagull optimization algorithm based MPPT for augmented performance of photovoltaic solar energy systems. Automatika 63(1):1\u201315","journal-title":"Automatika"},{"key":"4880_CR31","doi-asserted-by":"publisher","first-page":"17268","DOI":"10.1109\/ACCESS.2021.3127164","volume":"10","author":"YH Wu","year":"2022","unstructured":"Wu YH, Sun XB, Zhang Y, Zhong XJ, Cheng L (2022) A power transformer fault diagnosis method-based hybrid improved seagull optimization algorithm and support vector machine. IEEE Access 10:17268\u201317286","journal-title":"IEEE Access"},{"issue":"24","key":"4880_CR32","doi-asserted-by":"publisher","first-page":"8496","DOI":"10.3390\/s21248496","volume":"21","author":"P Jagannathan","year":"2021","unstructured":"Jagannathan P, Gurumoorthy S, Stateczny A, Divakarachar PB, Sengupta J (2021) Collision-aware routing using multi-objective seagull optimization algorithm for WSN-Based IoT. Sensors 21(24):8496","journal-title":"Sensors"},{"issue":"2","key":"4880_CR33","doi-asserted-by":"publisher","first-page":"387","DOI":"10.3390\/pr9020387","volume":"9","author":"X Chen","year":"2021","unstructured":"Chen X, Li YL, Zhang YC, Ye XL, Xiong X, Zhang FH (2021) A novel hybrid model based on an improved seagull optimization algorithm for short-term wind speed forecasting. Processes 9(2):387","journal-title":"Processes"},{"key":"4880_CR34","doi-asserted-by":"publisher","DOI":"10.1142\/7437","volume-title":"Stochastic simulation optimization: an optimal computing budget allocation","author":"CH Chen","year":"2010","unstructured":"Chen CH, Lee LH (2010) Stochastic simulation optimization: an optimal computing budget allocation. World Scientific, New Jersey"},{"issue":"5","key":"4880_CR35","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/24725854.2019.1659524","volume":"52","author":"H Xiao","year":"2020","unstructured":"Xiao H, Gao F, Lee LH (2020) Optimal computing budget allocation for complete ranking with input uncertainty. IISE Trans 52(5):489\u2013499","journal-title":"IISE Trans"},{"key":"4880_CR36","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.renene.2016.05.018","volume":"96","author":"K Chen","year":"2016","unstructured":"Chen K, Song MC, Zhang X, Wang SF (2016) Wind turbine layout optimization with multiple hub height wind turbines using greedy algorithm. Renew Energy 96:676\u2013686","journal-title":"Renew Energy"},{"issue":"5","key":"4880_CR37","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1007\/s00158-019-02449-7","volume":"61","author":"H Fairclough","year":"2020","unstructured":"Fairclough H, Gilbert M (2020) Layout optimization of simplified trusses using mixed integer linear programming with runtime generation of constraints. Struct Multidiscip Optim 61(5):1977\u20131999","journal-title":"Struct Multidiscip Optim"},{"issue":"5","key":"4880_CR38","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TCYB.2019.2926248","volume":"51","author":"X Yang","year":"2021","unstructured":"Yang X, He HB, Zhong XN (2021) Approximate dynamic programming for nonlinear-constrained optimizations. IEEE Trans Cybernetics 51(5):2419\u20132432","journal-title":"IEEE Trans Cybernetics"},{"key":"4880_CR39","doi-asserted-by":"publisher","first-page":"102192","DOI":"10.1016\/j.simpat.2020.102192","volume":"106","author":"TL Chen","year":"2021","unstructured":"Chen TL, Chen JC, Huang CF, Chang PC (2021) Solving the layout design problem by simulation-optimization approach: a case study on a sortation conveyor system. Simul Modelli Pract Theory 106:102192","journal-title":"Simul Modelli Pract Theory"},{"key":"4880_CR40","doi-asserted-by":"publisher","DOI":"10.1002\/9781118439241","volume-title":"Sample size determination and power","author":"TP Ryan","year":"2013","unstructured":"Ryan TP (2013) Sample size determination and power. John Wiley and Sons, New Jersey"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04880-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04880-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04880-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T09:40:24Z","timestamp":1676626824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04880-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,26]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4880"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04880-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,10,26]]},"assertion":[{"value":"5 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors claim that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study does not include any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}