{"id":"https://openalex.org/W2565456727","doi":"https://doi.org/10.1109/itsc.2016.7795667","title":"An exact approach for the container retrieval problem to reduce crane's trajectory","display_name":"An exact approach for the container retrieval problem to reduce crane's trajectory","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2565456727","doi":"https://doi.org/10.1109/itsc.2016.7795667","mag":"2565456727"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2016.7795667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","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/A5090736933","display_name":"Andresson da Silva Firmino","orcid":"https://orcid.org/0000-0002-7586-2604"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Andresson da Silva Firmino","raw_affiliation_strings":["Center for Informatics, Federal University of Pernambuco, Recife, PE, BR"],"affiliations":[{"raw_affiliation_string":"Center for Informatics, Federal University of Pernambuco, Recife, PE, BR","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043194913","display_name":"Ricardo Martins de Abreu Silva","orcid":"https://orcid.org/0000-0003-3117-6191"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ricardo Martins de Abreu Silva","raw_affiliation_strings":["Center for Informatics, Federal University of Pernambuco, Recife, PE, Brazil"],"affiliations":[{"raw_affiliation_string":"Center for Informatics, Federal University of Pernambuco, Recife, PE, Brazil","institution_ids":["https://openalex.org/I25112270"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012491524","display_name":"Val\u00e9ria Ces\u00e1rio Times","orcid":"https://orcid.org/0000-0002-0398-6173"},"institutions":[{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Valeria Cesario Times","raw_affiliation_strings":["Center for Informatics, Federal University of Pernambuco, Recife, PE, Brazil"],"affiliations":[{"raw_affiliation_string":"Center for Informatics, Federal University of Pernambuco, Recife, PE, Brazil","institution_ids":["https://openalex.org/I25112270"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090736933"],"corresponding_institution_ids":["https://openalex.org/I25112270"],"apc_list":null,"apc_paid":null,"fwci":1.6988,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87091809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"933","last_page":"938"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11223","display_name":"Maritime Ports and Logistics","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/T11223","display_name":"Maritime Ports and Logistics","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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9843000173568726,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9819999933242798,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/container","display_name":"Container (type theory)","score":0.8300530314445496},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7640940546989441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.724393367767334},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.7184152007102966},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6341482400894165},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5851914286613464},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5799102187156677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5551851391792297},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49897241592407227},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4430268704891205},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41902586817741394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.344965398311615},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.22970864176750183},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1759779453277588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1476205587387085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1417568027973175}],"concepts":[{"id":"https://openalex.org/C2781018962","wikidata":"https://www.wikidata.org/wiki/Q5164884","display_name":"Container (type theory)","level":2,"score":0.8300530314445496},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7640940546989441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.724393367767334},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7184152007102966},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6341482400894165},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5851914286613464},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5799102187156677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5551851391792297},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49897241592407227},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4430268704891205},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41902586817741394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.344965398311615},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.22970864176750183},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1759779453277588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1476205587387085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1417568027973175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2016.7795667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W122651092","https://openalex.org/W183154860","https://openalex.org/W1606890799","https://openalex.org/W1943991695","https://openalex.org/W1965855194","https://openalex.org/W1981661902","https://openalex.org/W1985569099","https://openalex.org/W1987034989","https://openalex.org/W1991868993","https://openalex.org/W2001760565","https://openalex.org/W2003523115","https://openalex.org/W2031041022","https://openalex.org/W2045317807","https://openalex.org/W2061300551","https://openalex.org/W2067728749","https://openalex.org/W2069902640","https://openalex.org/W2079967095","https://openalex.org/W2081851509","https://openalex.org/W2082119322","https://openalex.org/W2082199534","https://openalex.org/W2083198433","https://openalex.org/W2156797534","https://openalex.org/W2219568167","https://openalex.org/W2296283287","https://openalex.org/W2585037806"],"related_works":["https://openalex.org/W2904060783","https://openalex.org/W4385832323","https://openalex.org/W2356996864","https://openalex.org/W4244391535","https://openalex.org/W2015393961","https://openalex.org/W2378339670","https://openalex.org/W2359353485","https://openalex.org/W2139910871","https://openalex.org/W2361427670","https://openalex.org/W2886240924"],"abstract_inverted_index":{"The":[0,20,116,134],"container":[1,17,59],"retrieval":[2],"problem":[3],"(CRP)":[4],"is":[5,51,89],"an":[6,25,121,143],"important":[7],"issue":[8],"to":[9,23,33,42,76,90,124,153],"achieve":[10,142],"high":[11],"yard":[12],"operational":[13],"efficiency":[14],"in":[15,80,83,130,146],"a":[16,43,147],"terminal":[18],"system.":[19],"CRP":[21],"aims":[22],"find":[24],"optimal":[26,47,144],"sequence":[27,48],"of":[28,49,58,120],"operations":[29,50],"for":[30],"the":[31,36,39,56,63,69,81,86,92,126,131,139],"crane":[32],"retrieve":[34],"all":[35],"containers":[37],"from":[38],"bay":[40],"according":[41],"predefined":[44],"order.":[45],"An":[46],"obtained":[52],"by":[53,68,95],"either":[54],"reducing":[55,62],"number":[57],"relocations":[60],"or":[61],"total":[64],"travel":[65],"distance":[66],"performed":[67],"crane,":[70],"i.e.,":[71],"crane's":[72],"trajectory.":[73],"In":[74,97],"contrast":[75],"previous":[77],"studies":[78],"discussed":[79],"literature,":[82],"this":[84,98,100],"study,":[85],"optimization":[87,105],"goal":[88],"minimize":[91],"trajectory":[93],"undertaken":[94],"crane.":[96],"regard,":[99],"paper":[101],"proposes":[102],"two":[103],"exact":[104],"algorithms":[106,141],"based":[107],"on":[108],"Dijkstra's":[109],"algorithm":[110,114],"and":[111],"A*":[112],"search":[113,132],"frameworks.":[115],"latter":[117],"includes":[118],"proposal":[119],"intelligent":[122],"strategy":[123],"explore":[125],"most":[127],"promising":[128],"nodes":[129],"tree.":[133],"experimental":[135],"results":[136],"show":[137],"that":[138],"proposed":[140],"solution":[145],"shorter":[148],"computation":[149],"time":[150],"when":[151],"applied":[152],"realistic":[154],"scenarios.":[155]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}