{"id":"https://openalex.org/W3010172063","doi":"https://doi.org/10.1109/tcyb.2020.2974832","title":"Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints","display_name":"Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints","publication_year":2020,"publication_date":"2020-03-04","ids":{"openalex":"https://openalex.org/W3010172063","doi":"https://doi.org/10.1109/tcyb.2020.2974832","mag":"3010172063","pmid":"https://pubmed.ncbi.nlm.nih.gov/32149678"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2020.2974832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2020.2974832","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"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 Cybernetics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.rug.nl/en/publications/227016b6-56e2-41f5-8995-4f5e62515c82","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Xiaoshan Bai","orcid":"https://orcid.org/0000-0002-6782-5571"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]},{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaoshan Bai","raw_affiliation_strings":["College of Mechatronics and Control Engineering, Shenzhen University, Shenzhen, China","School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China"],"affiliations":[{"raw_affiliation_string":"College of Mechatronics and Control Engineering, Shenzhen University, Shenzhen, China","institution_ids":["https://openalex.org/I180726961"]},{"raw_affiliation_string":"School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ming Cao","orcid":"https://orcid.org/0000-0001-5472-562X"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ming Cao","raw_affiliation_strings":["Faculty of Science and Engineering, University of Groningen, Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Weisheng Yan","orcid":"https://orcid.org/0000-0002-6789-4411"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weisheng Yan","raw_affiliation_strings":["School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China"],"affiliations":[{"raw_affiliation_string":"School of Marine Science and Technology, Northwestern Polytechnical University, Xi\u2019an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Shuzhi Sam Ge","orcid":"https://orcid.org/0000-0001-5549-312X"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Shuzhi Sam Ge","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiaoyu Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoyu Zhang","raw_affiliation_strings":["College of Artificial Intelligence, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"College of Artificial Intelligence, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I17145004","https://openalex.org/I180726961"],"apc_list":null,"apc_paid":null,"fwci":0.7851,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.73658731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"51","issue":"12","first_page":"6274","last_page":"6283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6140999794006348,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6140999794006348,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.22030000388622284,"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.040800001472234726,"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/sorting","display_name":"Sorting","score":0.7052000164985657},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6442999839782715},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6395000219345093},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.5475000143051147},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5472999811172485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.522599995136261},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4740999937057495}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7052000164985657},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6442999839782715},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6395000219345093},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6014999747276306},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.5475000143051147},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5472999811172485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5278000235557556},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.522599995136261},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4740999937057495},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4602999985218048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4458000063896179},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3898000121116638},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29739999771118164},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2558000087738037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25049999356269836}],"mesh":[{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000066506","descriptor_name":"Heuristics","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":4,"locations":[{"id":"doi:10.1109/tcyb.2020.2974832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2020.2974832","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"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 Cybernetics","raw_type":"journal-article"},{"id":"pmid:32149678","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/32149678","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on cybernetics","raw_type":null},{"id":"pmh:oai:pure.rug.nl:openaire/227016b6-56e2-41f5-8995-4f5e62515c82","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/227016b6-56e2-41f5-8995-4f5e62515c82","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bai, X, Cao, M, Yan, W & Ge, S S 2021, 'Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints', IEEE Transactions on Cybernetics, vol. 51, no. 12, pp. 6274 - 6283. https://doi.org/10.1109/TCYB.2020.2974832","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/227016b6-56e2-41f5-8995-4f5e62515c82","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/227016b6-56e2-41f5-8995-4f5e62515c82","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bai, X, Cao, M, Yan, W & Ge, S S 2021, 'Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints', IEEE Transactions on Cybernetics, vol. 51, no. 12, pp. 6274 - 6283. https://doi.org/10.1109/TCYB.2020.2974832","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.rug.nl:openaire/227016b6-56e2-41f5-8995-4f5e62515c82","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/227016b6-56e2-41f5-8995-4f5e62515c82","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bai, X, Cao, M, Yan, W & Ge, S S 2021, 'Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints', IEEE Transactions on Cybernetics, vol. 51, no. 12, pp. 6274 - 6283. https://doi.org/10.1109/TCYB.2020.2974832","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2616550356","display_name":null,"funder_award_id":"61633002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2797167985","display_name":null,"funder_award_id":"61603094","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W109225361","https://openalex.org/W1827131769","https://openalex.org/W1921447628","https://openalex.org/W1975422970","https://openalex.org/W1994184140","https://openalex.org/W1994509633","https://openalex.org/W1994863634","https://openalex.org/W1997039203","https://openalex.org/W2009803313","https://openalex.org/W2021951771","https://openalex.org/W2041872606","https://openalex.org/W2042986967","https://openalex.org/W2052440028","https://openalex.org/W2076422387","https://openalex.org/W2086029661","https://openalex.org/W2111174053","https://openalex.org/W2111706284","https://openalex.org/W2116948045","https://openalex.org/W2145778119","https://openalex.org/W2161711991","https://openalex.org/W2508993989","https://openalex.org/W2688378291","https://openalex.org/W2740867407","https://openalex.org/W2756720074","https://openalex.org/W2783738786","https://openalex.org/W2797487617","https://openalex.org/W2808046530","https://openalex.org/W2887976588","https://openalex.org/W2905240675","https://openalex.org/W2912024007","https://openalex.org/W2938783033","https://openalex.org/W2947448184","https://openalex.org/W2951782192","https://openalex.org/W3014676508","https://openalex.org/W4246185962","https://openalex.org/W4252801674","https://openalex.org/W6770784973"],"related_works":[],"abstract_inverted_index":{"This":[0],"article":[1],"investigates":[2],"the":[3,20,25,30,37,45,50,56,65,72,78,85,91,107,116,125],"task":[4,117],"planning":[5,118],"problem":[6,58],"where":[7],"one":[8],"vehicle":[9],"needs":[10],"to":[11,28,35,42,63,114,131],"visit":[12,29,43],"a":[13,68,74,96],"set":[14],"of":[15,67],"target":[16],"locations":[17],"while":[18,47],"respecting":[19],"precedence":[21,51],"constraints":[22],"that":[23,55,124],"specify":[24],"sequence":[26],"orders":[27],"targets.":[31],"The":[32,120],"objective":[33],"is":[34,59,81,101],"minimize":[36],"vehicle's":[38],"total":[39],"travel":[40],"distance":[41],"all":[44,49],"targets":[46],"satisfying":[48,132],"constraints.":[52],"We":[53],"show":[54,123],"optimization":[57],"NP-hard,":[60],"and":[61,134],"consequently,":[62],"measure":[64],"proximity":[66],"suboptimal":[69],"solution":[70,80],"from":[71],"optimal,":[73],"lower":[75],"bound":[76],"on":[77,84],"optimal":[79],"constructed":[82],"based":[83],"graph":[86],"theory.":[87],"Then,":[88],"inspired":[89],"by":[90,106],"existing":[92],"topological":[93,98],"sorting":[94,99],"techniques,":[95],"new":[97],"strategy":[100],"proposed;":[102],"in":[103,138],"addition,":[104],"facilitated":[105],"sorting,":[108],"we":[109],"propose":[110],"several":[111],"heuristic":[112],"algorithms":[113,127],"solve":[115],"problem.":[119],"numerical":[121],"experiments":[122],"designed":[126],"can":[128],"quickly":[129],"lead":[130],"solutions":[133],"have":[135],"better":[136],"performance":[137],"comparison":[139],"with":[140],"popular":[141],"genetic":[142],"algorithms.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2020-03-13T00:00:00"}