{"id":"https://openalex.org/W4205325099","doi":"https://doi.org/10.1109/smc52423.2021.9658903","title":"Neural Network Assisted Branch-and-Bound Method for Dynamic Berth Allocation Problems","display_name":"Neural Network Assisted Branch-and-Bound Method for Dynamic Berth Allocation Problems","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W4205325099","doi":"https://doi.org/10.1109/smc52423.2021.9658903"},"language":"en","primary_location":{"id":"doi:10.1109/smc52423.2021.9658903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc52423.2021.9658903","pdf_url":null,"source":{"id":"https://openalex.org/S4363607761","display_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5040764351","display_name":"Shinya Korekane","orcid":null},"institutions":[{"id":"https://openalex.org/I163770644","display_name":"Okayama University","ror":"https://ror.org/02pc6pc55","country_code":"JP","type":"education","lineage":["https://openalex.org/I163770644"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shinya Korekane","raw_affiliation_strings":["Graduate School of Natural Science and Technology, Okayama University, Okayama City, Okayama, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Natural Science and Technology, Okayama University, Okayama City, Okayama, Japan","institution_ids":["https://openalex.org/I163770644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033193171","display_name":"Tatsushi Nishi","orcid":"https://orcid.org/0000-0003-1354-3939"},"institutions":[{"id":"https://openalex.org/I163770644","display_name":"Okayama University","ror":"https://ror.org/02pc6pc55","country_code":"JP","type":"education","lineage":["https://openalex.org/I163770644"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsushi Nishi","raw_affiliation_strings":["Graduate School of Natural Science and Technology, Okayama University, Okayama City, Okayama, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Natural Science and Technology, Okayama University, Okayama City, Okayama, Japan","institution_ids":["https://openalex.org/I163770644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040764351"],"corresponding_institution_ids":["https://openalex.org/I163770644"],"apc_list":null,"apc_paid":null,"fwci":0.8849,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72173913,"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":"208","last_page":"213"},"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.9923999905586243,"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/T12126","display_name":"Maritime Transport Emissions and Efficiency","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.8106141090393066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7098650336265564},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6481849551200867},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6466158032417297},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5588560700416565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5519440174102783},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5278544425964355},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5242759585380554},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.44907811284065247},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3342462182044983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26113271713256836},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16445210576057434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13183262944221497},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11341419816017151}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.8106141090393066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7098650336265564},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6481849551200867},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6466158032417297},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5588560700416565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5519440174102783},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5278544425964355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5242759585380554},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.44907811284065247},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3342462182044983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26113271713256836},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16445210576057434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13183262944221497},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11341419816017151},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc52423.2021.9658903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc52423.2021.9658903","pdf_url":null,"source":{"id":"https://openalex.org/S4363607761","display_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Life below water","id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1522301498","https://openalex.org/W1965361176","https://openalex.org/W1968350460","https://openalex.org/W2019200365","https://openalex.org/W2072979369","https://openalex.org/W2074506596","https://openalex.org/W2155167223","https://openalex.org/W2156387975","https://openalex.org/W2164163287","https://openalex.org/W2768883843","https://openalex.org/W2927001788","https://openalex.org/W2970019720","https://openalex.org/W3108769970","https://openalex.org/W6631190155","https://openalex.org/W6682889407","https://openalex.org/W6684544315","https://openalex.org/W6786235891"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2004980487","https://openalex.org/W2990947859","https://openalex.org/W2139895272","https://openalex.org/W1982719520","https://openalex.org/W2072438481","https://openalex.org/W2045837509","https://openalex.org/W2962818638","https://openalex.org/W2786277681","https://openalex.org/W2009869936"],"abstract_inverted_index":{"The":[0,27,62],"berth":[1,24,29,45],"allocation":[2,30,36],"problem":[3,31,73,86],"is":[4,101,154],"one":[5],"of":[6,40,55,60,97,123,132,141,147,165],"the":[7,11,23,35,44,48,72,85,88,95,120,128,133,138,142,145,148,151,158,163,166,170],"important":[8],"problems":[9],"in":[10],"maritime":[12],"ship":[13],"operations.":[14],"Efficient":[15],"sea":[16],"transportation":[17],"can":[18],"be":[19],"realized":[20],"by":[21,87],"optimizing":[22],"operation":[25],"schedule.":[26],"dynamic":[28],"asks":[32],"to":[33,43,70,83,118,126],"determine":[34,119],"and":[37,57,64,91,99,173],"berthing":[38],"time":[39,51,131],"each":[41,124],"vessel":[42],"that":[46],"minimizes":[47],"total":[49,129],"service":[50],"given":[52],"a":[53,58,108],"set":[54,59],"vessels":[56],"berths.":[61],"branch":[63,90,172],"bound":[65,92,174],"algorithms":[66,93],"have":[67],"been":[68],"used":[69],"solve":[71,84],"as":[74],"an":[75],"exact":[76],"solution":[77,153],"algorithm.":[78],"However,":[79],"it":[80],"becomes":[81],"intractable":[82],"conventional":[89,171],"when":[94],"number":[96],"ships":[98],"berths":[100],"increased.":[102],"In":[103],"this":[104],"paper,":[105],"we":[106],"propose":[107],"new":[109],"branch-and-bound":[110,134],"algorithm":[111],"called":[112],"Neural":[113],"Network":[114],"Assisted":[115],"Branch-and-Bound":[116],"(NN-B&B)":[117],"search":[121,139],"priority":[122,140],"node":[125,143],"reduce":[127],"computation":[130],"method.":[135],"By":[136],"determining":[137],"from":[144,176],"result":[146],"neural":[149],"network,":[150],"optimal":[152],"quickly":[155],"searched":[156],"for":[157],"learned":[159],"problem.":[160],"We":[161],"compare":[162],"performance":[164],"proposed":[167],"method":[168,175],"with":[169],"computational":[177],"experiments.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}