{"id":"https://openalex.org/W2983168209","doi":"https://doi.org/10.1109/rtsi.2019.8895543","title":"Optimally Scheduling Complex Logistics Operations Involving Acquisition, Elaboration and Action Tasks","display_name":"Optimally Scheduling Complex Logistics Operations Involving Acquisition, Elaboration and Action Tasks","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2983168209","doi":"https://doi.org/10.1109/rtsi.2019.8895543","mag":"2983168209"},"language":"en","primary_location":{"id":"doi:10.1109/rtsi.2019.8895543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtsi.2019.8895543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 5th International forum on Research and Technology for Society and Industry (RTSI)","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/A5033546468","display_name":"Lohic Fotio Tiotsop","orcid":"https://orcid.org/0000-0001-5127-9935"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Lohic Fotio Tiotsop","raw_affiliation_strings":["Politecnico di Torino, Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055486014","display_name":"Antonio Servetti","orcid":"https://orcid.org/0000-0002-0159-5718"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Antonio Servetti","raw_affiliation_strings":["Politecnico di Torino, Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052707121","display_name":"Enrico Masala","orcid":"https://orcid.org/0000-0001-8906-354X"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Masala","raw_affiliation_strings":["Politecnico di Torino, Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Torino, Torino, Italy","institution_ids":["https://openalex.org/I177477856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6631,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77365841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"149","last_page":"154"},"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.998199999332428,"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.998199999332428,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937000274658203,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9884999990463257,"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/computer-science","display_name":"Computer science","score":0.745489239692688},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5850389003753662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338711738586426},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5313917398452759},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45270204544067383},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4454902112483978},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4352061152458191},{"id":"https://openalex.org/keywords/clarity","display_name":"CLARITY","score":0.42493975162506104},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3417963981628418},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3204498887062073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1492435336112976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10734084248542786}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.745489239692688},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5850389003753662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338711738586426},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5313917398452759},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45270204544067383},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4454902112483978},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4352061152458191},{"id":"https://openalex.org/C2777146004","wikidata":"https://www.wikidata.org/wiki/Q14949826","display_name":"CLARITY","level":2,"score":0.42493975162506104},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3417963981628418},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3204498887062073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1492435336112976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10734084248542786},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rtsi.2019.8895543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtsi.2019.8895543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 5th International forum on Research and Technology for Society and Industry (RTSI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/2","display_name":"Zero hunger"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W174230839","https://openalex.org/W1546581765","https://openalex.org/W1628727861","https://openalex.org/W1659349535","https://openalex.org/W1817159186","https://openalex.org/W1992780165","https://openalex.org/W2004433746","https://openalex.org/W2019400639","https://openalex.org/W2019416082","https://openalex.org/W2027033718","https://openalex.org/W2055186043","https://openalex.org/W2069209512","https://openalex.org/W2465486865","https://openalex.org/W2472944192","https://openalex.org/W2474116940","https://openalex.org/W2587566806","https://openalex.org/W2606265598","https://openalex.org/W2615516218","https://openalex.org/W2742612991","https://openalex.org/W2793690105","https://openalex.org/W2803109568","https://openalex.org/W2803836921","https://openalex.org/W2962824291","https://openalex.org/W3082467900","https://openalex.org/W4232139954","https://openalex.org/W4232783703","https://openalex.org/W4235723617","https://openalex.org/W6638295957","https://openalex.org/W6782884825"],"related_works":["https://openalex.org/W2086338133","https://openalex.org/W4367679314","https://openalex.org/W225526533","https://openalex.org/W2078361494","https://openalex.org/W2009234990","https://openalex.org/W4244083766","https://openalex.org/W2091016074","https://openalex.org/W2134615400","https://openalex.org/W2023583523","https://openalex.org/W2022769024"],"abstract_inverted_index":{"Optimization":[0],"algorithms":[1,207],"can":[2,130],"dramatically":[3],"improve":[4],"the":[5,48,56,121,135,143,155,174,186,192,202,205],"efficiency":[6,203],"of":[7,21,50,85,147,181,191,199,204,210],"logistics":[8],"operations.":[9,187],"However,":[10],"when":[11,29],"complex":[12,88],"tasks":[13,80],"are":[14],"involved,":[15],"there":[16],"is":[17,31,72,105,170],"a":[18,83,196],"significant":[19],"lack":[20],"good":[22],"models":[23],"and":[24,78,128],"optimized":[25],"solutions.":[26],"For":[27,113],"instance,":[28],"it":[30],"necessary":[32],"to":[33,74,107,134,172,184],"perform":[34,75],"more":[35,140],"than":[36],"one":[37,70],"operation":[38],"at":[39],"each":[40],"specific":[41],"point":[42],"in":[43,68,109,139,142,179,208],"space,":[44],"potentially":[45],"depending":[46],"on":[47,120,189],"outcome":[49],"others,":[51],"finding":[52],"optimal":[53],"solutions":[54],"for":[55],"operator":[57,71],"movements":[58],"may":[59],"become":[60],"extremely":[61],"difficult.":[62],"This":[63],"work":[64],"addresses":[65],"such":[66],"context,":[67],"which":[69],"required":[73,106],"acquisition,":[76],"elaboration":[77],"action":[79],"while":[81],"visiting":[82],"set":[84],"positions,":[86],"with":[87,195],"sequential":[89],"dependencies.":[90],"An":[91],"example":[92],"could":[93],"be":[94,131],"an":[95,99,160,167],"automatic":[96],"operator,":[97],"i.e.,":[98],"unmanned":[100],"ground":[101],"vehicle":[102],"(UGV),":[103],"that":[104,169],"help":[108],"precision":[110,122],"agriculture":[111,123],"activities.":[112],"clarity's":[114],"sake,":[115],"we":[116,165],"will":[117],"mostly":[118],"focus":[119],"scenario,":[124],"but":[125],"our":[126],"model":[127],"results":[129],"readily":[132],"applied":[133],"other":[136],"contexts":[137],"described":[138],"details":[141],"paper,":[144],"e.g.,":[145],"scheduling":[146],"robot":[148],"operations":[149],"or":[150],"repair":[151],"companies.":[152],"After":[153],"formulating":[154],"general":[156],"problem":[157],"analytically":[158],"as":[159],"integer":[161],"linear":[162],"programming":[163],"problem,":[164],"propose":[166],"algorithm":[168],"guaranteed":[171],"find":[173],"global":[175],"minimum":[176],"cost":[177],"solution":[178],"terms":[180,209],"time":[182],"needed":[183],"complete":[185],"Tests":[188],"instances":[190],"optimization":[193],"problems":[194],"different":[197],"number":[198],"nodes":[200],"show":[201],"proposed":[206],"computational":[211],"time.":[212]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}