{"id":"https://openalex.org/W2058404589","doi":"https://doi.org/10.1016/s0305-0548(01)00039-9","title":"A new evolutionary approach to cutting stock problems with and without contiguity","display_name":"A new evolutionary approach to cutting stock problems with and without contiguity","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2058404589","doi":"https://doi.org/10.1016/s0305-0548(01)00039-9","mag":"2058404589"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(01)00039-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(01)00039-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5085106321","display_name":"Ko-Hsin Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Ko-Hsin Liang","raw_affiliation_strings":["School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I40053085"]},{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, UK","School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT UK#TAB#","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000091869","display_name":"Charles Newton","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Charles Newton","raw_affiliation_strings":["School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I40053085"]},{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108792582","display_name":"David Hoffman","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I40053085","display_name":"Australian Defence Force Academy","ror":"https://ror.org/02j5s7g39","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571","https://openalex.org/I40053085","https://openalex.org/I4394709116"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"David Hoffman","raw_affiliation_strings":["School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia","institution_ids":["https://openalex.org/I31746571","https://openalex.org/I40053085"]},{"raw_affiliation_string":"School of Computer Science, University College, The University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Australia#TAB#","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085106321"],"corresponding_institution_ids":["https://openalex.org/I31746571","https://openalex.org/I40053085"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":12.1491,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.98506864,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"29","issue":"12","first_page":"1641","last_page":"1659"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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.9871000051498413,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9768000245094299,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8638334274291992},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6817604899406433},{"id":"https://openalex.org/keywords/contiguity","display_name":"Contiguity","score":0.5738232135772705},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5354540348052979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4950932562351227},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4689920246601105},{"id":"https://openalex.org/keywords/trim","display_name":"Trim","score":0.4488334357738495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43555474281311035},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.43548673391342163},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4325270354747772},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4274342954158783},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4044201672077179},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17484408617019653}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8638334274291992},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6817604899406433},{"id":"https://openalex.org/C68767595","wikidata":"https://www.wikidata.org/wiki/Q1677999","display_name":"Contiguity","level":2,"score":0.5738232135772705},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5354540348052979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4950932562351227},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4689920246601105},{"id":"https://openalex.org/C88611116","wikidata":"https://www.wikidata.org/wiki/Q957004","display_name":"Trim","level":2,"score":0.4488334357738495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43555474281311035},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.43548673391342163},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4325270354747772},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4274342954158783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4044201672077179},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17484408617019653},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0305-0548(01)00039-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(01)00039-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.3167","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.3167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~xin/papers/COR_LiangYaoNewtonHoffman.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.8424","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.8424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://www.cs.adfa.edu.au/pub/xin/csp2.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/85ef8e8a-7005-4993-8b9f-5b7e574c6c3e","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/85ef8e8a-7005-4993-8b9f-5b7e574c6c3e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liang, KH, Yao, X, Newton, CS & Hoffman, D 2002, 'A new evolutionary approach to cutting stock problems with and without contiguity', Computers & Operations Research, vol. 29, no. 12, pp. 1641-1659. https://doi.org/10.1016/S0305-0548(01)00039-9","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W195444827","https://openalex.org/W200867373","https://openalex.org/W609513197","https://openalex.org/W652309760","https://openalex.org/W1486199311","https://openalex.org/W1506499706","https://openalex.org/W1536221476","https://openalex.org/W1559956479","https://openalex.org/W1605965346","https://openalex.org/W1639032689","https://openalex.org/W1969193848","https://openalex.org/W1974206331","https://openalex.org/W1978970913","https://openalex.org/W1979415050","https://openalex.org/W1990897806","https://openalex.org/W1993905290","https://openalex.org/W1998647932","https://openalex.org/W2011944551","https://openalex.org/W2013067314","https://openalex.org/W2024001269","https://openalex.org/W2065515648","https://openalex.org/W2085478109","https://openalex.org/W2085774108","https://openalex.org/W2086263357","https://openalex.org/W2086717587","https://openalex.org/W2103774065","https://openalex.org/W2123469274","https://openalex.org/W2144946856","https://openalex.org/W2166843422","https://openalex.org/W2284330674","https://openalex.org/W2293593839","https://openalex.org/W2330425234","https://openalex.org/W2489387716","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W1575663621","https://openalex.org/W2031422533","https://openalex.org/W4205535298","https://openalex.org/W4381955283","https://openalex.org/W2800489847","https://openalex.org/W2401708139","https://openalex.org/W4291700806","https://openalex.org/W167806033","https://openalex.org/W4211080865","https://openalex.org/W3111586637"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}