{"id":"https://openalex.org/W2071219991","doi":"https://doi.org/10.1109/cec.2014.6900425","title":"A route planning strategy for the automatic garment cutter based on genetic algorithm","display_name":"A route planning strategy for the automatic garment cutter based on genetic algorithm","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2071219991","doi":"https://doi.org/10.1109/cec.2014.6900425","mag":"2071219991"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","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/A5022855978","display_name":"Wenchao Yu","orcid":"https://orcid.org/0000-0001-9483-7423"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenchao Yu","raw_affiliation_strings":["Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing Shanghai, P. R. China","Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing, Shanghai, P. R. China"],"affiliations":[{"raw_affiliation_string":"Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing Shanghai, P. R. China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing, Shanghai, P. R. China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044402639","display_name":"LU Lin-ji","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Linji Lu","raw_affiliation_strings":["Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing Shanghai, P. R. China","Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing, Shanghai, P. R. China"],"affiliations":[{"raw_affiliation_string":"Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing Shanghai, P. R. China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Dept. Automation of Shanghai Jiao Tong University, Key Lab of System Control and Information Processing, Shanghai, P. R. China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022855978"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":1.2315,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83445426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"379","last_page":"386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9865999817848206,"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.8459829688072205},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7215362787246704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.628943920135498},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5906122922897339},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5718859434127808},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5506701469421387},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5496287941932678},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5399382710456848},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5073162913322449},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4464595913887024},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23941397666931152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17701297998428345},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14749303460121155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12106505036354065}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8459829688072205},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7215362787246704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.628943920135498},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5906122922897339},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5718859434127808},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5506701469421387},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5496287941932678},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5399382710456848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5073162913322449},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4464595913887024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23941397666931152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17701297998428345},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14749303460121155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12106505036354065},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900425","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W201105387","https://openalex.org/W1499264356","https://openalex.org/W1598952354","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2023947722","https://openalex.org/W2036691792","https://openalex.org/W2054083850","https://openalex.org/W2070484240","https://openalex.org/W2150367356","https://openalex.org/W2163428398","https://openalex.org/W2170558868","https://openalex.org/W4213121121","https://openalex.org/W6664369923"],"related_works":["https://openalex.org/W2153505252","https://openalex.org/W2114549389","https://openalex.org/W2371108399","https://openalex.org/W2525152177","https://openalex.org/W2979917306","https://openalex.org/W2369738212","https://openalex.org/W2383252209","https://openalex.org/W2152922390","https://openalex.org/W2381787154","https://openalex.org/W1617803207"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,12,53,97,106],"route":[4,32,47,166],"planning":[5,48,167],"algorithm":[6,68,81,100,130],"for":[7,33,39,63],"the":[8,17,23,27,34,40,46,60,77,80,93,129,149,154,162],"automatic":[9],"garment":[10,157],"cutter,":[11],"machine":[13],"extensively":[14],"used":[15],"in":[16,169],"clothing":[18],"industry,":[19],"aiming":[20],"at":[21],"reducing":[22],"length":[24],"and":[25,43,82,113,153,175],"improving":[26],"smoothness":[28],"of":[29,59,79,128,156,164,171],"quick":[30],"moving":[31],"cutter.":[35],"With":[36],"proper":[37],"constraints":[38],"cloth":[41],"segments":[42],"knife-down":[44],"points,":[45],"problem":[49,57],"is":[50,69],"resolved":[51],"into":[52,136],"generalized":[54],"travelling":[55],"salesman":[56],"(GTSP)":[58],"first":[61],"category,":[62],"which":[64,124,160],"an":[65,114],"enhanced":[66],"genetic":[67],"proposed.":[70],"In":[71],"this":[72],"paper,":[73],"we":[74],"firstly":[75],"outline":[76],"procedure":[78],"discuss":[83],"some":[84],"important":[85],"details,":[86],"including":[87],"individual":[88],"fitness":[89],"calculation":[90],"based":[91,110,118],"on":[92,111,119,148],"multistage":[94],"graph":[95],"problem,":[96],"local":[98,137],"search":[99],"with":[101],"2-opt":[102],"method,":[103],"etc.":[104],"Then":[105],"positionreservation":[107],"crossover":[108],"operator":[109,117],"dual-relevancy,":[112],"adaptive":[115],"mutation":[116],"population":[120],"dispersion":[121],"are":[122,146],"proposed,":[123],"can":[125],"accelerate":[126],"convergence":[127],"as":[131,133,139,141],"well":[132],"prevent":[134],"locking":[135],"minima":[138],"much":[140],"possible.":[142],"Finally,":[143],"experimental":[144],"tests":[145],"performed":[147],"GTSP":[150],"Instances":[151],"Library":[152],"data":[155],"CAD":[158],"files,":[159],"demonstrates":[161],"effectiveness":[163],"our":[165],"strategy":[168],"terms":[170],"both":[172],"solution":[173],"quality":[174],"running":[176],"time.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-08T23:21:52.890332","created_date":"2025-10-10T00:00:00"}