{"id":"https://openalex.org/W2161502927","doi":"https://doi.org/10.1109/cec.2012.6256455","title":"An evolutionary algorithm for 2D semi-guillotinable circular saw cutting","display_name":"An evolutionary algorithm for 2D semi-guillotinable circular saw cutting","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2161502927","doi":"https://doi.org/10.1109/cec.2012.6256455","mag":"2161502927"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5041386867","display_name":"\u0160t\u011bp\u00e1n Balcar","orcid":"https://orcid.org/0000-0001-6614-2595"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Stepan Balcar","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082108573","display_name":"Martin Pil\u00e1t","orcid":"https://orcid.org/0000-0003-1239-1566"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Pilat","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037011091","display_name":"Roman Neruda","orcid":"https://orcid.org/0000-0003-2364-5357"},"institutions":[{"id":"https://openalex.org/I4210155092","display_name":"Czech Academy of Sciences, Institute of Computer Science","ror":"https://ror.org/0496n6574","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210155092"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Roman Neruda","raw_affiliation_strings":["Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic","institution_ids":["https://openalex.org/I4210155092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041386867"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23731529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7272511720657349},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6320592761039734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5788141489028931},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4814566969871521},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48055246472358704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47847864031791687},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4692264497280121},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.43227076530456543},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4254215359687805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41929125785827637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3034273684024811},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24685591459274292},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23688825964927673},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11991837620735168}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7272511720657349},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6320592761039734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5788141489028931},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4814566969871521},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48055246472358704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47847864031791687},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4692264497280121},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.43227076530456543},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4254215359687805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41929125785827637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3034273684024811},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24685591459274292},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23688825964927673},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11991837620735168},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6256455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0384758","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0007326","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W58255779","https://openalex.org/W160204346","https://openalex.org/W1975659290","https://openalex.org/W1983333862","https://openalex.org/W2031811260","https://openalex.org/W2069970312","https://openalex.org/W2120982812","https://openalex.org/W2976664243","https://openalex.org/W3041535420","https://openalex.org/W6602330416","https://openalex.org/W6780581034"],"related_works":["https://openalex.org/W2726551571","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875","https://openalex.org/W2802808995"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,29,35,66],"new":[3,36],"class":[4],"of":[5,23,41,69],"2D-stock":[6],"cutting":[7,26,56],"problems,":[8,13],"the":[9,21],"so":[10],"called":[11],"semi-quillotinable":[12],"and":[14,52,72],"show":[15],"its":[16],"practical":[17],"importance":[18],"in":[19],"solving":[20,40],"task":[22],"creating":[24],"optimal":[25],"plans":[27],"for":[28,39,49],"circular":[30],"saw.":[31],"Furthermore,":[32],"we":[33],"create":[34],"algorithm":[37,59],"suited":[38],"semi-guillotinable":[42],"problems":[43],"by":[44],"adapting":[45],"existing":[46],"evolutionary":[47],"algorithms":[48,64],"both":[50,70],"guillotinable":[51],"non-guillotinable":[53],"2D":[54],"stock":[55],"problems.":[57,74],"This":[58],"is":[60],"compared":[61],"to":[62],"standard":[63],"on":[65],"selected":[67],"set":[68],"benchmark":[71],"real-life":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-08T08:50:53.379069","created_date":"2025-10-10T00:00:00"}