{"id":"https://openalex.org/W3210113475","doi":"https://doi.org/10.3390/a14110305","title":"Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds","display_name":"Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds","publication_year":2021,"publication_date":"2021-10-23","ids":{"openalex":"https://openalex.org/W3210113475","doi":"https://doi.org/10.3390/a14110305","mag":"3210113475"},"language":"en","primary_location":{"id":"doi:10.3390/a14110305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14110305","pdf_url":"https://www.mdpi.com/1999-4893/14/11/305/pdf?version=1635921337","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/11/305/pdf?version=1635921337","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055760744","display_name":"Bonfim Amaro","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Bonfim Amaro Junior","raw_affiliation_strings":["N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil"],"affiliations":[{"raw_affiliation_string":"N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026013353","display_name":"Marcio Costa Santos","orcid":"https://orcid.org/0000-0002-5452-0226"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcio Costa Santos","raw_affiliation_strings":["N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil"],"affiliations":[{"raw_affiliation_string":"N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002106042","display_name":"Guilherme Nepomuceno de Carvalho","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Guilherme Nepomuceno de Carvalho","raw_affiliation_strings":["N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil"],"affiliations":[{"raw_affiliation_string":"N\u00facleo de Estudo em Machine Learning e Otimiza\u00e7\u00e3o (NEMO), Federal University of Cear\u00e1, Russas 62900-000, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004944009","display_name":"Luiz Jonat\u00e3 Pires de Ara\u00fajo","orcid":"https://orcid.org/0000-0001-7450-7945"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Luiz Jonat\u00e3 Pires de Ara\u00fajo","raw_affiliation_strings":["Machine Learning & Knowledge Representation (MlKr) Lab, Innopolis University, 420500 Innopolis, Russia"],"affiliations":[{"raw_affiliation_string":"Machine Learning & Knowledge Representation (MlKr) Lab, Innopolis University, 420500 Innopolis, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014786069","display_name":"Pl\u00e1cido Rog\u00e9rio Pinheiro","orcid":"https://orcid.org/0000-0002-1718-1712"},"institutions":[{"id":"https://openalex.org/I3125581668","display_name":"Universidade de Fortaleza","ror":"https://ror.org/02ynbzc81","country_code":"BR","type":"education","lineage":["https://openalex.org/I3125581668"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Placido Rogerio Pinheiro","raw_affiliation_strings":["Graduate Program in Applied Informatics, University of Fortaleza (UNIFOR), Fortaleza 60811-905, Brazil"],"affiliations":[{"raw_affiliation_string":"Graduate Program in Applied Informatics, University of Fortaleza (UNIFOR), Fortaleza 60811-905, Brazil","institution_ids":["https://openalex.org/I3125581668"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5014786069"],"corresponding_institution_ids":["https://openalex.org/I3125581668"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.0378,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81069821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"11","first_page":"305","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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.9975000023841858,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/metaheuristic","display_name":"Metaheuristic","score":0.8658113479614258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6349717974662781},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5953161120414734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4830949306488037},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44742611050605774},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.4246100187301636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33403170108795166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2746604084968567}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8658113479614258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6349717974662781},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5953161120414734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4830949306488037},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44742611050605774},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.4246100187301636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33403170108795166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2746604084968567},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a14110305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14110305","pdf_url":"https://www.mdpi.com/1999-4893/14/11/305/pdf?version=1635921337","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:eprints.lincoln.ac.uk:52663","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196275","display_name":"Lincoln Repository (University of Lincoln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51532219","host_organization_name":"University of Lincoln","host_organization_lineage":["https://openalex.org/I51532219"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:20e44d3344f8454da7194fe4fad662c7","is_oa":true,"landing_page_url":"https://doaj.org/article/20e44d3344f8454da7194fe4fad662c7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 11, p 305 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/11/305/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14110305","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 11; Pages: 305","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14110305","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14110305","pdf_url":"https://www.mdpi.com/1999-4893/14/11/305/pdf?version=1635921337","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3210113475.pdf","grobid_xml":"https://content.openalex.org/works/W3210113475.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W54627691","https://openalex.org/W172249175","https://openalex.org/W215955642","https://openalex.org/W294617725","https://openalex.org/W1966490238","https://openalex.org/W1983190776","https://openalex.org/W1986955497","https://openalex.org/W1989024760","https://openalex.org/W1992272252","https://openalex.org/W1994089682","https://openalex.org/W1996472849","https://openalex.org/W2010113720","https://openalex.org/W2016869987","https://openalex.org/W2021757872","https://openalex.org/W2024496499","https://openalex.org/W2036452636","https://openalex.org/W2039011874","https://openalex.org/W2052820274","https://openalex.org/W2053822166","https://openalex.org/W2056554671","https://openalex.org/W2058937865","https://openalex.org/W2071219991","https://openalex.org/W2076225437","https://openalex.org/W2081680160","https://openalex.org/W2083148528","https://openalex.org/W2096882197","https://openalex.org/W2105175235","https://openalex.org/W2110824994","https://openalex.org/W2122645796","https://openalex.org/W2122978540","https://openalex.org/W2129970609","https://openalex.org/W2134964438","https://openalex.org/W2136150677","https://openalex.org/W2142044601","https://openalex.org/W2168079536","https://openalex.org/W2293398679","https://openalex.org/W2464361750","https://openalex.org/W2754611409","https://openalex.org/W2897022983","https://openalex.org/W2944379335","https://openalex.org/W2966288920","https://openalex.org/W2969243652","https://openalex.org/W2982735258","https://openalex.org/W3009339760","https://openalex.org/W3015449785","https://openalex.org/W3161031731","https://openalex.org/W6610613709","https://openalex.org/W6630838125","https://openalex.org/W6635946665","https://openalex.org/W6680094227"],"related_works":["https://openalex.org/W4241523039","https://openalex.org/W2360028903","https://openalex.org/W4280543773","https://openalex.org/W178231042","https://openalex.org/W2366083136","https://openalex.org/W2387622493","https://openalex.org/W2789681586","https://openalex.org/W1932132538","https://openalex.org/W3095745430","https://openalex.org/W4243663106"],"abstract_inverted_index":{"The":[0,107,134],"problem":[1,19,89],"of":[2,24,35,52,125,155],"efficiently":[3],"cutting":[4,25,53,66,119],"smaller":[5],"two-dimensional":[6],"pieces":[7],"from":[8,116],"a":[9,33,50],"larger":[10],"surface":[11],"is":[12],"recurrent":[13],"in":[14,81,110],"several":[15],"manufacturing":[16,63],"settings.":[17],"This":[18,30,84],"belongs":[20],"to":[21,48,61,76,121,130],"the":[22,39,58,72,87,91,123,126,150,156],"domain":[23],"and":[26,54,67,94],"packing":[27],"(C&P)":[28],"problems.":[29],"study":[31,85,112],"approached":[32],"category":[34],"C&P":[36],"problems":[37],"called":[38],"minimum":[40],"time":[41,152],"cut":[42],"path":[43],"(MTCP)":[44],"problem,":[45],"which":[46],"aims":[47],"identify":[49],"sequence":[51],"sliding":[55],"movements":[56],"for":[57,98,153],"head":[59],"device":[60],"minimize":[62],"time.":[64],"Both":[65],"slide":[68],"speeds":[69],"(just":[70],"moving":[71],"head)":[73],"vary":[74],"according":[75],"equipment,":[77],"despite":[78],"their":[79],"relevance":[80],"real-world":[82,105],"scenarios.":[83],"applied":[86],"MTCP":[88],"on":[90],"practical":[92,144],"scope":[93],"presents":[95],"two":[96],"metaheuristics":[97],"tackling":[99],"more":[100],"significant":[101],"instances":[102],"that":[103,137],"resemble":[104],"requirements.":[106],"experiments":[108],"presented":[109],"this":[111],"utilized":[113],"parameter":[114],"values":[115],"typical":[117],"laser":[118],"machines":[120],"assess":[122],"feasibility":[124],"proposed":[127],"methods":[128],"compared":[129],"existing":[131],"commercial":[132],"software.":[133],"results":[135],"show":[136],"metaheuristic-based":[138],"solutions":[139],"are":[140],"competitive":[141],"when":[142],"addressing":[143],"problems,":[145],"achieving":[146],"increased":[147],"performance":[148],"regarding":[149],"processing":[151],"94%":[154],"instances.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-11-08T00:00:00"}