{"id":"https://openalex.org/W2130842070","doi":"https://doi.org/10.1109/coase.2008.4626458","title":"Petri Net decomposition approach for the simultaneous optimization of task assignment and routing with automated guided vehicles","display_name":"Petri Net decomposition approach for the simultaneous optimization of task assignment and routing with automated guided vehicles","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2130842070","doi":"https://doi.org/10.1109/coase.2008.4626458","mag":"2130842070"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2008.4626458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","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/A5033193171","display_name":"Tatsushi Nishi","orcid":"https://orcid.org/0000-0003-1354-3939"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsushi Nishi","raw_affiliation_strings":["Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013347732","display_name":"Yuki Tanaka","orcid":"https://orcid.org/0000-0002-0141-5131"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuki Tanaka","raw_affiliation_strings":["Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075050549","display_name":"Masahiro Inuiguchi","orcid":"https://orcid.org/0000-0001-9970-1621"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masahiro Inuiguchi","raw_affiliation_strings":["Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Systems for Social Systems, Graduate School of Engineering Science, Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.414,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69690638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"175","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9842000007629395,"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/subnet","display_name":"Subnet","score":0.920828104019165},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.873275101184845},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8352452516555786},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6990002393722534},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6935595273971558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6793602705001831},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6630278825759888},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48972848057746887},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4514835476875305},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.43303388357162476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3388451933860779},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.28327518701553345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15980157256126404},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1560213565826416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14715901017189026},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.09979572892189026},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09265559911727905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07490286231040955}],"concepts":[{"id":"https://openalex.org/C21099817","wikidata":"https://www.wikidata.org/wiki/Q7631721","display_name":"Subnet","level":2,"score":0.920828104019165},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.873275101184845},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8352452516555786},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6990002393722534},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6935595273971558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6793602705001831},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6630278825759888},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48972848057746887},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4514835476875305},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.43303388357162476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3388451933860779},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28327518701553345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15980157256126404},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1560213565826416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14715901017189026},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.09979572892189026},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09265559911727905},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07490286231040955},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2008.4626458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2008.4626458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Automation Science and Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1545946820","https://openalex.org/W1983788549","https://openalex.org/W1985405670","https://openalex.org/W2005570037","https://openalex.org/W2013162249","https://openalex.org/W2025582715","https://openalex.org/W2060466647","https://openalex.org/W2119364285","https://openalex.org/W2134561421","https://openalex.org/W2158051462","https://openalex.org/W6632512828"],"related_works":["https://openalex.org/W1671817583","https://openalex.org/W2295291212","https://openalex.org/W2377891237","https://openalex.org/W2014292684","https://openalex.org/W2377615010","https://openalex.org/W4238125051","https://openalex.org/W2046360368","https://openalex.org/W2155660625","https://openalex.org/W2908824635","https://openalex.org/W2142999730"],"abstract_inverted_index":{"In":[0,23,67],"this":[1,68],"paper,":[2],"we":[3],"propose":[4],"a":[5,58,70],"simultaneous":[6],"optimization":[7],"method":[8,73,87],"for":[9,15,35,52,61,74],"task":[10,36],"assignment":[11],"and":[12,38],"routing":[13],"problems":[14],"multiple":[16],"AGVs":[17],"by":[18,45,90],"decomposition":[19],"of":[20,50,84],"Petri":[21,28],"Nets.":[22],"the":[24,27,62,85,92],"proposed":[25,86],"method,":[26],"Net":[29],"is":[30,43,55,65,80,88],"decomposed":[31],"into":[32],"several":[33],"subnets":[34],"subproblems":[37,75],"AGV":[39],"subproblems.":[40],"Each":[41],"subproblem":[42,51],"solved":[44],"Dijkstra\u2019s":[46],"algorithm.":[47],"The":[48,82],"solution":[49,60,72],"each":[53],"subnet":[54],"repeated":[56],"until":[57],"feasible":[59],"original":[63],"problem":[64],"obtained.":[66],"study,":[69],"new":[71],"with":[76,94],"no":[77],"final":[78],"marking":[79],"developed.":[81],"effectiveness":[83],"confirmed":[89],"comparing":[91],"performance":[93],"conventional":[95],"methods.":[96]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}