{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:24:35Z","timestamp":1760300675411,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/smc52423.2021.9658903","type":"proceedings-article","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T20:34:35Z","timestamp":1641501275000},"page":"208-213","source":"Crossref","is-referenced-by-count":2,"title":["Neural Network Assisted Branch-and-Bound Method for Dynamic Berth Allocation Problems"],"prefix":"10.1109","author":[{"given":"Shinya","family":"Korekane","sequence":"first","affiliation":[]},{"given":"Tatsushi","family":"Nishi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/00207540802603767"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2715-9"},{"key":"ref12","first-page":"3957","article-title":"Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs","author":"nishi","year":"2010","journal-title":"International Journal of Production Research 47-14"},{"key":"ref13","article-title":"A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the bee colony optimisation algorithm","author":"prencipe","year":"2020","journal-title":"Appl Intell"},{"key":"ref4","first-page":"315","article-title":"Deep sparse rectifier neural networks","volume":"15","author":"glorot","year":"2011","journal-title":"AISTATS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.072"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00057-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104781"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.03.036"},{"key":"ref7","article-title":"Adam: a method for stochastic optimization","author":"kingma","year":"2014","journal-title":"International Conference on Learning Representations ICLR 2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0120"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2010.11.016"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2012.06.001"}],"event":{"name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2021,10,17]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,10,20]]}},"container-title":["2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9658572\/9658575\/09658903.pdf?arnumber=9658903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:56:28Z","timestamp":1652201788000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9658903\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/smc52423.2021.9658903","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}