{"id":"https://openalex.org/W4289656833","doi":"https://doi.org/10.1109/tase.2022.3194082","title":"Dynamic Optimization of Conflict-Free Routing of Automated Guided Vehicles for Just-in-Time Delivery","display_name":"Dynamic Optimization of Conflict-Free Routing of Automated Guided Vehicles for Just-in-Time Delivery","publication_year":2022,"publication_date":"2022-08-03","ids":{"openalex":"https://openalex.org/W4289656833","doi":"https://doi.org/10.1109/tase.2022.3194082"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3194082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3194082","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","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/A5070021408","display_name":"Kosei Nishida","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kosei Nishida","raw_affiliation_strings":["Division of Mathematical Science for Social Systems, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Division of Mathematical Science for Social Systems, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033193171","display_name":"Tatsushi Nishi","orcid":"https://orcid.org/0000-0003-1354-3939"},"institutions":[{"id":"https://openalex.org/I163770644","display_name":"Okayama University","ror":"https://ror.org/02pc6pc55","country_code":"JP","type":"education","lineage":["https://openalex.org/I163770644"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsushi Nishi","raw_affiliation_strings":["Division of Mechanical and Systems Engineering, Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan"],"affiliations":[{"raw_affiliation_string":"Division of Mechanical and Systems Engineering, Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan","institution_ids":["https://openalex.org/I163770644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070021408"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":3.9206,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93751979,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"3","first_page":"2099","last_page":"2114"},"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.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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9857000112533569,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9725027084350586},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6497668027877808},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6184942126274109},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5931739211082458},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.570533037185669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5662944912910461},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5410147905349731},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5303654670715332},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4113262891769409},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3653746545314789},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3556564450263977},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3243739604949951},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.22745376825332642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22209981083869934},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0822344422340393}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9725027084350586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6497668027877808},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6184942126274109},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5931739211082458},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.570533037185669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5662944912910461},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5410147905349731},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5303654670715332},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4113262891769409},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3653746545314789},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3556564450263977},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3243739604949951},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.22745376825332642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22209981083869934},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0822344422340393},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2022.3194082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3194082","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3501187282","display_name":null,"funder_award_id":"18HO3826","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W234652880","https://openalex.org/W597432580","https://openalex.org/W1964733380","https://openalex.org/W2009747959","https://openalex.org/W2021634924","https://openalex.org/W2021709881","https://openalex.org/W2026545122","https://openalex.org/W2040029476","https://openalex.org/W2042342424","https://openalex.org/W2044456402","https://openalex.org/W2067884717","https://openalex.org/W2084951638","https://openalex.org/W2097800777","https://openalex.org/W2103597368","https://openalex.org/W2105060405","https://openalex.org/W2108666666","https://openalex.org/W2109417943","https://openalex.org/W2144623944","https://openalex.org/W2145493798","https://openalex.org/W2153406083","https://openalex.org/W2161081508","https://openalex.org/W2164163287","https://openalex.org/W2295519298","https://openalex.org/W2470319613","https://openalex.org/W2791724942","https://openalex.org/W2792991645","https://openalex.org/W2802408425","https://openalex.org/W2888729493","https://openalex.org/W2897405579","https://openalex.org/W2897842891","https://openalex.org/W2915814342","https://openalex.org/W2945320416","https://openalex.org/W2947950562","https://openalex.org/W2953139447","https://openalex.org/W2954300542","https://openalex.org/W2964290823","https://openalex.org/W2969171068","https://openalex.org/W2971714626","https://openalex.org/W2989626717","https://openalex.org/W2995613083","https://openalex.org/W2998671458","https://openalex.org/W3011468419","https://openalex.org/W3020055354","https://openalex.org/W3023381051","https://openalex.org/W3034038218","https://openalex.org/W3038152318","https://openalex.org/W3039852076","https://openalex.org/W3046916964","https://openalex.org/W3049715010","https://openalex.org/W3062144270","https://openalex.org/W4211073396","https://openalex.org/W4283733393","https://openalex.org/W6767924402"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W74759090","https://openalex.org/W4247589463","https://openalex.org/W2006534204","https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2162001022"],"abstract_inverted_index":{"This":[0,60,279],"paper":[1,280],"studies":[2],"the":[3,7,22,33,40,69,98,115,122,133,165,177,183,188,198,201,237,249,258,266,270,275,282,294,299,309,316,346,349,353,356],"solution":[4,79,140,147],"procedure":[5,80],"to":[6,20,83,144,210,256,264,331,336],"problem":[8,41,61,88],"of":[9,26,39,56,102,114,176,179,185,226,234,239,287,298,318,355],"conflict-free":[10,86,285],"route":[11],"planning":[12],"for":[13,17,269,289,321],"automated":[14],"guided":[15],"vehicles":[16],"just-in-time":[18,268,290,350],"delivery":[19,29,72,351],"minimize":[21],"earliness":[23,91],"and":[24,71,92,164,187,220,229,245,251,284,352],"tardiness":[25,93],"a":[27,44,65,85,138],"specified":[28],"time":[30,50,101,152,168,191,272,297,311,359],"while":[31,97,292],"minimizing":[32,293],"total":[34,99,166,189,276,295,357],"completion":[35,100,167,190,296,358],"time.":[36],"The":[37,112,129,158,174,194,232],"characteristic":[38],"is":[42,62,81,105,118,142,169,262,327,341],"that":[43,90,132,141,154],"vehicle":[45],"can":[46,136,204,360],"have":[47],"an":[48,145],"idle":[49],"at":[51],"any":[52],"nodes":[53],"considering":[54],"dispatching":[55,283],"dynamic":[57,109],"task":[58,104,110,180],"arrivals.":[59,111],"modeled":[63],"by":[64,120],"time-space":[66],"network":[67],"where":[68],"pickup":[70],"tasks":[73],"are":[74,95,192,215],"dynamically":[75],"scheduled.":[76],"A":[77],"heuristic":[78],"developed":[82],"derive":[84],"routing":[87,286],"such":[89],"penalties":[94,163],"minimized":[96,107],"each":[103],"also":[106,335],"under":[108],"effectiveness":[113],"proposed":[116,134],"method":[117,135],"demonstrated":[119],"comparing":[121],"performance":[123,184],"with":[124,148,223,305],"Gurobi":[125],"from":[126,156],"computational":[127,151,195],"results.":[128],"results":[130,196,344],"show":[131,197,345],"obtain":[137],"better":[139],"close":[143],"optimal":[146],"significantly":[149],"shorter":[150],"than":[153],"derived":[155],"Gurobi.":[157],"trade-off":[159,202],"relationship":[160,203],"between":[161],"earliness/tardiness":[162,186],"investigated":[170],"in":[171,217,248],"various":[172],"situations.":[173],"effects":[175],"interval":[178],"assignment":[181],"on":[182],"studied.":[193],"conditions":[199],"when":[200,339,348],"be":[205,361],"obtained.":[206],"<italic":[207],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[208],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Note":[209],"Practitioners</i>":[211],"\u2014The":[212],"multiple":[213,306],"AGVs":[214,288,319],"used":[216],"public":[218],"transportation":[219,291,312,326],"social":[221],"systems":[222],"rapid":[224],"development":[225],"artificial":[227],"intelligence":[228],"optimization":[230],"methods.":[231],"benefits":[233],"AGV":[235],"affect":[236],"reduction":[238],"congestion,":[240],"traffic":[241],"police,":[242],"legal":[243],"services,":[244],"economic":[246],"savings":[247],"manufacturing":[250],"logistics":[252],"industries.":[253],"In":[254,301],"order":[255],"satisfy":[257],"customer\u2019s":[259],"demands,":[260],"it":[261,340],"requested":[263],"deliver":[265],"products":[267],"desired":[271],"without":[273],"decreasing":[274],"system":[277],"performance.":[278],"presents":[281],"tasks.":[300],"many":[302],"real":[303],"factories":[304],"production":[307],"processes,":[308],"shortest":[310],"may":[313],"sometimes":[314],"cause":[315],"congestions":[317],"waiting":[320],"handling":[322],"or":[323],"overstocked.":[324],"Just-in-time":[325],"required":[328],"not":[329],"only":[330,338],"reduce":[332],"inventories":[333],"but":[334],"supply":[337],"needed.":[342],"Computational":[343],"situations":[347],"minimization":[354],"achieved.":[362]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}