{"id":"https://openalex.org/W2800792697","doi":"https://doi.org/10.1109/tevc.2018.2835565","title":"Synthesis of Constraints for Mathematical Programming With One-Class Genetic Programming","display_name":"Synthesis of Constraints for Mathematical Programming With One-Class Genetic Programming","publication_year":2018,"publication_date":"2018-05-11","ids":{"openalex":"https://openalex.org/W2800792697","doi":"https://doi.org/10.1109/tevc.2018.2835565","mag":"2800792697"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2018.2835565","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2018.2835565","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary 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/A5079242784","display_name":"Tomasz P. Pawlak","orcid":"https://orcid.org/0000-0002-8353-0562"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Tomasz P. Pawlak","raw_affiliation_strings":["Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034406933","display_name":"Krzysztof Krawiec","orcid":"https://orcid.org/0000-0001-5439-3231"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Krawiec","raw_affiliation_strings":["Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079242784"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":1.7917,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.88452013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"117","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9908999800682068,"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/constraint-programming","display_name":"Constraint programming","score":0.7041511535644531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6716222167015076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6690242886543274},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6575444340705872},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5896221995353699},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5632073879241943},{"id":"https://openalex.org/keywords/reactive-programming","display_name":"Reactive programming","score":0.526406466960907},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.5105867981910706},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5019540786743164},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.477678120136261},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4730890393257141},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47157543897628784},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.43763479590415955},{"id":"https://openalex.org/keywords/functional-reactive-programming","display_name":"Functional reactive programming","score":0.42398664355278015},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.418337881565094},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.33783966302871704},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.2864367961883545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24300643801689148},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22300225496292114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21041089296340942},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.17508649826049805},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1621767282485962}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7041511535644531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6716222167015076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6690242886543274},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6575444340705872},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5896221995353699},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5632073879241943},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.526406466960907},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.5105867981910706},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5019540786743164},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.477678120136261},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4730890393257141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47157543897628784},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.43763479590415955},{"id":"https://openalex.org/C119489759","wikidata":"https://www.wikidata.org/wiki/Q5508843","display_name":"Functional reactive programming","level":5,"score":0.42398664355278015},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.418337881565094},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.33783966302871704},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.2864367961883545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24300643801689148},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22300225496292114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21041089296340942},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.17508649826049805},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1621767282485962},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tevc.2018.2835565","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2018.2835565","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7796491340","display_name":null,"funder_award_id":"2014/15/B/ST6/05205","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G8693229903","display_name":null,"funder_award_id":"09/91/DSMK/0634","funder_id":"https://openalex.org/F4320322481","funder_display_name":"Politechnika Pozna\u0144ska"}],"funders":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320322481","display_name":"Politechnika Pozna\u0144ska","ror":"https://ror.org/00p7p3302"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W141304919","https://openalex.org/W1479834111","https://openalex.org/W1504694836","https://openalex.org/W1534539971","https://openalex.org/W1576818901","https://openalex.org/W2027649639","https://openalex.org/W2041192064","https://openalex.org/W2056234582","https://openalex.org/W2072128103","https://openalex.org/W2072473332","https://openalex.org/W2076402663","https://openalex.org/W2103459159","https://openalex.org/W2119821739","https://openalex.org/W2125055259","https://openalex.org/W2126105956","https://openalex.org/W2130652100","https://openalex.org/W2153477625","https://openalex.org/W2153504150","https://openalex.org/W2155348816","https://openalex.org/W2158797600","https://openalex.org/W2186013251","https://openalex.org/W2345951342","https://openalex.org/W2574105555","https://openalex.org/W2588072912","https://openalex.org/W2590041095","https://openalex.org/W2604349812","https://openalex.org/W2800045081","https://openalex.org/W4231109964","https://openalex.org/W4239510810","https://openalex.org/W6628698747","https://openalex.org/W6682743627","https://openalex.org/W6682894622","https://openalex.org/W6731505055","https://openalex.org/W6733577878","https://openalex.org/W6750916411"],"related_works":["https://openalex.org/W4243324743","https://openalex.org/W2611103758","https://openalex.org/W1840715060","https://openalex.org/W1548690989","https://openalex.org/W4242995941","https://openalex.org/W2495969191","https://openalex.org/W1529354938","https://openalex.org/W2145543519","https://openalex.org/W103385983","https://openalex.org/W2314685986"],"abstract_inverted_index":{"Mathematical":[0],"programming":[1,72,75],"(MP)":[2],"models":[3],"are":[4,12],"common":[5],"in":[6,18,70],"optimization":[7,16],"of":[8,57,60,63,99,108,123],"real-world":[9,121],"processes.":[10],"Models":[11],"usually":[13],"built":[14],"by":[15],"experts":[17],"an":[19,22,85,92],"iterative":[20],"manner:":[21],"imperfect":[23],"model":[24],"is":[25],"continuously":[26],"improved":[27],"until":[28],"it":[29,118],"approximates":[30],"the":[31,100],"reality":[32],"well-enough":[33],"and":[34,89,111,126],"meets":[35],"all":[36],"technical":[37],"requirements":[38],"(e.g.,":[39],"linearity).":[40],"To":[41],"facilitate":[42],"this":[43],"task,":[44],"we":[45],"propose":[46],"a":[47,55,64,120],"genetic":[48],"one-class":[49],"constraint":[50],"synthesis":[51],"method":[52],"(GOCCS).":[53],"Given":[54],"set":[56],"exemplary":[58],"states":[59],"normal":[61],"operation":[62],"business":[65],"process,":[66],"GOCCS":[67,104],"synthesizes":[68],"constraints":[69,79],"linear":[71],"or":[73],"nonlinear":[74],"form.":[76],"The":[77],"synthesized":[78],"can":[80],"be":[81],"then":[82],"paired":[83],"with":[84],"arbitrary":[86],"objective":[87],"function":[88],"supplied":[90],"to":[91,95,119],"off-the-shelf":[93],"solver":[94],"find":[96],"optimal":[97],"parameters":[98],"process.":[101,129],"We":[102,115],"assess":[103],"on":[105],"three":[106],"families":[107],"MP":[109],"benchmarks":[110],"conclude":[112],"promising":[113],"results.":[114],"also":[116],"apply":[117],"process":[122],"wine":[124],"production":[125],"optimize":[127],"that":[128]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}