{"id":"https://openalex.org/W88527779","doi":null,"title":"Context-aware logistic routing and scheduling","display_name":"Context-aware logistic routing and scheduling","publication_year":2007,"publication_date":"2007-09-22","ids":{"openalex":"https://openalex.org/W88527779","mag":"88527779"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.578.774","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.578.774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/ICAPS/2007/ICAPS07-042.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5112227470","display_name":"Adriaan ter Mors","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Adriaan W. ter Mors","raw_affiliation_strings":["Delft University of Technology and Almende BV#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology and Almende BV#TAB#","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082790394","display_name":"Jonne Zutt","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"J. Zutt","raw_affiliation_strings":["Delft University of Technology,,,,,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology,,,,,","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087895051","display_name":"Cees Witteveen","orcid":"https://orcid.org/0000-0002-7717-1209","observed_orcids":["https://orcid.org/0000-0002-7717-1209"]},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Cees Witteveen","raw_affiliation_strings":["Delft University of Technology,,,,,"],"raw_orcid":"https://orcid.org/0000-0002-7717-1209","affiliations":[{"raw_affiliation_string":"Delft University of Technology,,,,,","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":4.93,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.94336787,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"328","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9442999958992004,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9442999958992004,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11489","display_name":"Air Traffic Management and Optimization","score":0.021700000390410423,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00989999994635582,"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/context-aware-routing","display_name":"context-aware routing","score":0.9169999957084656},{"id":"https://openalex.org/keywords/automated-guided-vehicles","display_name":"automated guided vehicles","score":0.7609999775886536},{"id":"https://openalex.org/keywords/conflict-free-routing","display_name":"conflict-free routing","score":0.746999979019165},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.5389999747276306},{"id":"https://openalex.org/keywords/airport-throughput","display_name":"airport throughput","score":0.6769999861717224},{"id":"https://openalex.org/keywords/bottleneck-avoidance","display_name":"bottleneck avoidance","score":0.6600000262260437},{"id":"https://openalex.org/keywords/algorithmic-complexity","display_name":"algorithmic complexity","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7750507593154907},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6016621589660645},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5662235021591187},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5098689794540405},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4956625699996948},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41290441155433655},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.40841731429100037},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.40415143966674805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3599753975868225},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18945330381393433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08736854791641235}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.578.774","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.578.774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/ICAPS/2007/ICAPS07-042.pdf","raw_type":"text"},{"id":"mag:88527779","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/ICAPS/2007/ICAPS07-042.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Automated Planning and Scheduling","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.7207000255584717},{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4000000059604645}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1497519077","https://openalex.org/W1570861500","https://openalex.org/W1986112535","https://openalex.org/W2025582715","https://openalex.org/W2102509281","https://openalex.org/W2116585604","https://openalex.org/W2134634502","https://openalex.org/W2161484642"],"related_works":["https://openalex.org/W7074673066","https://openalex.org/W567047478","https://openalex.org/W173221315","https://openalex.org/W2338536693","https://openalex.org/W2331343301","https://openalex.org/W1999528952","https://openalex.org/W2128303554","https://openalex.org/W6922144042","https://openalex.org/W4213262712","https://openalex.org/W1509268606"],"abstract_inverted_index":{"In":[0,64],"context-aware":[1,35],"route":[2,9,129,147],"planning,":[3],"agents":[4,23,125,144,198],"have":[5],"to":[6,114,215,232,248],"plan":[7,145],"their":[8,146,200],"on":[10,34,49,88,98],"a":[11,16,73,89,103,116,122,131,135,138,182,224,236],"common":[12],"infrastructure":[13,61,107],"in":[14,38,142,176,195,251],"such":[15],"way":[17],"that":[18,169,222],"plans":[19,201],"made":[20],"by":[21,126],"other":[22],"are":[24,30],"not":[25,152,203],"invalidated,":[26],"and":[27],"no":[28],"conflicts":[29],"introduced.":[31],"Previous":[32],"research":[33],"routing,":[36,46],"mostly":[37],"the":[39,53,58,92,99,106,128,140,150,155,162,177,186,190,193,197,207,252],"domain":[40],"of":[41,55,60,75,94,118,124,154,161,189,227],"automated":[42],"guided":[43],"vehicle":[44],"(AGV)":[45],"has":[47],"reported":[48],"an":[50,69,171],"O(n4v2)":[51],"(n":[52],"number":[54,59,123],"ve-hicles,":[56],"v":[57],"resources)":[62],"algorithm.":[63],"this":[65],"paper":[66],"we":[67],"present":[68],"improved":[70],"algorithm":[71,110],"with":[72],"com-plexity":[74],"only":[76,153],"O(nv":[77],"log(nv)":[78],"+":[79],"nv2).":[80],"Our":[81,109,165],"free":[82,95,211,237],"path":[83,212,217,238],"routing":[84,213,239],"approach":[85,214,240],"is":[86,202],"based":[87],"search":[90,104],"through":[91,105],"graph":[93],"time":[96,230],"windows":[97],"resources,":[100],"rather":[101],"than":[102],"itself.":[108],"can":[111,180],"be":[112],"used":[113],"find":[115],"set":[117],"conflict-free":[119],"routes":[120],"for":[121,130,170,185,223],"finding":[127],"single":[132],"agent":[133,157],"at":[134],"time.":[136],"As":[137],"consequence,":[139],"order":[141,194],"which":[143,196],"will":[148],"determine":[149],"quality":[151],"individual":[156,172],"plans,":[158,244],"but":[159],"also":[160],"global":[163],"plan.":[164],"experimental":[166],"results":[167],"confirm":[168],"agent,":[173],"its":[174],"position":[175],"planning":[178],"queue":[179],"make":[181,199],"significant":[183],"dif-ference;":[184],"total":[187],"throughput":[188],"airport,":[191],"however,":[192],"highly":[204],"sig-nificant.":[205],"Also":[206],"experiments":[208],"compare":[209],"our":[210],"fixed":[216],"scheduling":[218],"approaches.":[219],"We":[220],"show":[221],"reasonable":[225],"amount":[226],"extra":[228],"computation":[229],"(required":[231],"investigate":[233],"alternative":[234],"routes),":[235],"finds":[241],"more":[242],"efficient":[243],"because":[245],"it":[246],"manages":[247],"avoid":[249],"bottle-necks":[250],"infrastructure.":[253]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2016-06-24T00:00:00"}