{"id":"https://openalex.org/W4391094138","doi":"https://doi.org/10.1109/iciscae59047.2023.10393019","title":"Dynamic Scheduling Strategy for RGV Car Based on Hybrid Genetic Simulated Annealing Algorithm","display_name":"Dynamic Scheduling Strategy for RGV Car Based on Hybrid Genetic Simulated Annealing Algorithm","publication_year":2023,"publication_date":"2023-09-23","ids":{"openalex":"https://openalex.org/W4391094138","doi":"https://doi.org/10.1109/iciscae59047.2023.10393019"},"language":"en","primary_location":{"id":"doi:10.1109/iciscae59047.2023.10393019","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iciscae59047.2023.10393019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 6th International Conference on Information Systems and Computer Aided Education (ICISCAE)","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/A5101472341","display_name":"Qihang Chen","orcid":"https://orcid.org/0000-0003-4438-1100"},"institutions":[{"id":"https://openalex.org/I116265982","display_name":"Qinghai University","ror":"https://ror.org/05h33bt13","country_code":"CN","type":"education","lineage":["https://openalex.org/I116265982"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qihang Chen","raw_affiliation_strings":["Qinghai University,Xining,China","Qinghai University, Xining, China"],"affiliations":[{"raw_affiliation_string":"Qinghai University,Xining,China","institution_ids":["https://openalex.org/I116265982"]},{"raw_affiliation_string":"Qinghai University, Xining, China","institution_ids":["https://openalex.org/I116265982"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101472341"],"corresponding_institution_ids":["https://openalex.org/I116265982"],"apc_list":null,"apc_paid":null,"fwci":0.6229,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75410369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"731","last_page":"736"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9629999995231628,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9629999995231628,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9218000173568726,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9125000238418579,"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/computer-science","display_name":"Computer science","score":0.6112743020057678},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6071301102638245},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5949950814247131},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.560929000377655},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5413224101066589},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4307659864425659},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4275246262550354},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4213157892227173},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.3770768642425537},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2029828131198883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1873784065246582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6112743020057678},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6071301102638245},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5949950814247131},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.560929000377655},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5413224101066589},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4307659864425659},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4275246262550354},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4213157892227173},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3770768642425537},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2029828131198883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1873784065246582},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":1,"locations":[{"id":"doi:10.1109/iciscae59047.2023.10393019","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iciscae59047.2023.10393019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 6th International Conference on Information Systems and Computer Aided Education (ICISCAE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2365679959","https://openalex.org/W2150034320","https://openalex.org/W2141923342","https://openalex.org/W32630872","https://openalex.org/W4387445197","https://openalex.org/W2557418835","https://openalex.org/W2371242158","https://openalex.org/W2146800915","https://openalex.org/W2134269501","https://openalex.org/W4244749153"],"abstract_inverted_index":{"In":[0,60,82],"the":[1,5,10,19,24,31,37,41,51,63,86,94,98,128,134,146,152,163,185,190],"intelligent":[2],"processing":[3,55,72],"system,":[4,21],"scheduling":[6,25,43,78,109],"of":[7,12,44,47,66,88,100,187,192],"RGV":[8,32,45,107],"determines":[9],"quantity":[11],"materials":[13],"and":[14,22,35,57,68,75,97,126,158,161],"work":[15,38],"efficiency":[16,56,191],"generated":[17],"by":[18,197],"entire":[20],"if":[23],"is":[26,46,73,80,181,195],"improper,":[27],"it":[28,156],"will":[29],"prolong":[30],"waiting":[33],"time":[34,102],"reduce":[36,58],"efficiency.":[39],"Therefore,":[40],"reasonable":[42],"great":[48],"significance":[49],"to":[50,53,84,132,140,169,199],"factory":[52],"improve":[54],"costs.":[59],"this":[61,91,149],"paper,":[62],"operation":[64,194],"process":[65],"CVC":[67],"RVG":[69],"during":[70],"two-process":[71,77,106,193],"described,":[74],"a":[76,105,113,117,171],"model":[79],"established.":[81],"order":[83,139],"maximize":[85],"amount":[87],"finished":[89],"material,":[90],"paper":[92,150],"defines":[93],"\"proximity":[95],"principle\"":[96],"\"principle":[99],"least":[101],"cost\",":[103],"proposes":[104],"dynamic":[108],"heuristic":[110],"algorithm,":[111],"obtains":[112],"feasible":[114],"solution,":[115],"adopts":[116],"hybrid":[118],"genetic":[119],"simulation":[120],"annealing":[121],"algorithm":[122],"with":[123,145],"two-segment":[124],"coding,":[125],"considers":[127],"optimal":[129,135],"preservation":[130],"strategy":[131],"obtain":[133,170],"solution.":[136],"Finally,":[137],"in":[138,143,184],"be":[141],"more":[142],"line":[144],"production":[147],"reality,":[148],"constructs":[151],"random":[153,172],"variables":[154],"\"whether":[155],"fails\"":[157],"\"troubleshooting":[159],"time\",":[160],"uses":[162],"Monte":[164],"Carlo":[165],"inverse":[166],"function":[167],"method":[168],"number":[173],"sampling":[174],"formula":[175],"for":[176],"\"trouble-free":[177],"working":[178],"time\".":[179],"It":[180],"concluded":[182],"that":[183],"presence":[186],"machine":[188],"failure,":[189],"reduced":[196],"up":[198],"1.25":[200],"pieces/h.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}