{"id":"https://openalex.org/W2566348707","doi":"https://doi.org/10.1080/03610918.2015.1134567","title":"A new metamodel-based method for solving semi-expensive simulation optimization problems","display_name":"A new metamodel-based method for solving semi-expensive simulation optimization problems","publication_year":2016,"publication_date":"2016-01-13","ids":{"openalex":"https://openalex.org/W2566348707","doi":"https://doi.org/10.1080/03610918.2015.1134567","mag":"2566348707"},"language":"en","primary_location":{"id":"doi:10.1080/03610918.2015.1134567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03610918.2015.1134567","pdf_url":null,"source":{"id":"https://openalex.org/S153329750","display_name":"Communications in Statistics - Simulation and Computation","issn_l":"0361-0918","issn":["0361-0918","1532-4141"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Statistics - Simulation and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041417545","display_name":"Samira Moghaddam","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Samira Moghaddam","raw_affiliation_strings":["Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012594102","display_name":"Hashem Mahlooji","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hashem Mahlooji","raw_affiliation_strings":["Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041417545"],"corresponding_institution_ids":["https://openalex.org/I133529467"],"apc_list":null,"apc_paid":null,"fwci":0.3591,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.7231507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"46","issue":"6","first_page":"4795","last_page":"4811"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13286","display_name":"Modeling and Simulation Systems","score":0.9661999940872192,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metamodeling","display_name":"Metamodeling","score":0.9390920400619507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6321960687637329},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6012026071548462},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4910604953765869},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4462505578994751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18488332629203796}],"concepts":[{"id":"https://openalex.org/C86610423","wikidata":"https://www.wikidata.org/wiki/Q1925081","display_name":"Metamodeling","level":2,"score":0.9390920400619507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6321960687637329},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6012026071548462},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4910604953765869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4462505578994751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18488332629203796},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03610918.2015.1134567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03610918.2015.1134567","pdf_url":null,"source":{"id":"https://openalex.org/S153329750","display_name":"Communications in Statistics - Simulation and Computation","issn_l":"0361-0918","issn":["0361-0918","1532-4141"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Statistics - Simulation and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1613273921","https://openalex.org/W1982672995","https://openalex.org/W1986172029","https://openalex.org/W2001842014","https://openalex.org/W2007981787","https://openalex.org/W2008952403","https://openalex.org/W2036310824","https://openalex.org/W2047427484","https://openalex.org/W2048253612","https://openalex.org/W2055063123","https://openalex.org/W2066561552","https://openalex.org/W2077650642","https://openalex.org/W2080648111","https://openalex.org/W2095962350","https://openalex.org/W2096318908","https://openalex.org/W2122987682","https://openalex.org/W2125437500","https://openalex.org/W2139136548","https://openalex.org/W2144304907","https://openalex.org/W2144808055","https://openalex.org/W2164094775","https://openalex.org/W2164442705","https://openalex.org/W2235056388","https://openalex.org/W2335719025","https://openalex.org/W3121339476","https://openalex.org/W3122455945"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4366549320","https://openalex.org/W4287863136","https://openalex.org/W3006015132","https://openalex.org/W2965078190","https://openalex.org/W3040644038","https://openalex.org/W4311207076","https://openalex.org/W4313459248","https://openalex.org/W3203633096","https://openalex.org/W2355226480"],"abstract_inverted_index":{"In":[0,18,36,49],"this":[1],"article,":[2],"a":[3,23,46,51],"new":[4,52],"algorithm":[5,54,86],"for":[6],"rather":[7],"expensive":[8],"simulation":[9,27,41],"problems":[10],"is":[11,29,43,55,66],"presented,":[12],"which":[13],"consists":[14],"of":[15,61],"two":[16],"phases.":[17],"the":[19,26,33,37,40,59,62,69,84,96],"first":[20],"phase,":[21,39],"as":[22,73,75],"model-based":[24],"algorithm,":[25,64],"output":[28],"used":[30],"directly":[31],"in":[32],"optimization":[34,53],"stage.":[35],"second":[38],"model":[42],"replaced":[44],"by":[45],"valid":[47],"metamodel.":[48],"addition,":[50],"presented.":[56],"To":[57],"evaluate":[58],"performance":[60],"proposed":[63,85],"it":[65],"applied":[67],"to":[68,76,88],"(s,S)":[70],"inventory":[71],"problem":[72],"well":[74],"five":[77],"test":[78],"functions.":[79],"Numerical":[80],"results":[81],"show":[82],"that":[83],"leads":[87],"better":[89],"solutions":[90],"with":[91],"less":[92],"computational":[93],"time":[94],"than":[95],"corresponding":[97],"metamodel-based":[98],"algorithm.":[99]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}