{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:47:20Z","timestamp":1776811640770,"version":"3.51.2"},"reference-count":8,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2022,1,26]]},"abstract":"<jats:p>With the development of economic globalization, shipping exchanges between countries are rapidly increasing and the container throughput of shipping ports has increased quickly, and the operation of most seaport terminals in China has reached a bottleneck which puts forward new requirements for the efficiency of container shipping terminal operations. Therefore, locating for export containers intelligently is of great significance for the development of terminals. This paper focuses on receiving containers intelligently, and establishes the export container locating model based on the principle of actual shipping terminal operations. The Monte Carlo Tree Search algorithm for export container locating problem was proposed and constructed. After examples, the algorithm can effectively solve the problem that meet the constraints, which further proves the practicability of the algorithm and the correctness of the model. The research shows that the method of locating for export container based on Monte Carlo Tree Search algorithm can effectively solve the problem and maintain the green, energy-saving and sustainable development of the shipping terminal. The ideas and methods have certain academic value and reference significance for other NP-Hard problems.<\/jats:p>","DOI":"10.3233\/jcm-215582","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T14:53:23Z","timestamp":1636124003000},"page":"89-96","source":"Crossref","is-referenced-by-count":2,"title":["Monte Carlo Tree Search algorithm for the receiving containers intelligently problem among container shipping terminals"],"prefix":"10.66113","volume":"22","author":[{"given":"Beng","family":"Xuan","sequence":"first","affiliation":[{"name":"Logistics Engineering College, Shanghai Maritime University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Zhao","sequence":"additional","affiliation":[{"name":"Logistics Engineering College, Shanghai Maritime University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Shen","sequence":"additional","affiliation":[{"name":"Logistics Engineering College, Shanghai Maritime University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqiang","family":"Du","sequence":"additional","affiliation":[{"name":"Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"55691","reference":[{"issue":"5","key":"10.3233\/JCM-215582_ref1","first-page":"490","article-title":"Optimization model and algorithm for export box position distribution of container yards","volume":"30","author":"Liu","year":"2016","journal-title":"Journal of Jiangsu University of Science and Technology (Natural Science Edition)"},{"issue":"2","key":"10.3233\/JCM-215582_ref2","first-page":"163","article-title":"Dynamic model of spatial distribution in export container box area of container terminals","volume":"35","author":"Yan","year":"2016","journal-title":"Journal of Chongqing Jiaotong University (Natural Science Edition)"},{"issue":"5","key":"10.3233\/JCM-215582_ref3","first-page":"112","article-title":"Research on the planning of container yard export box site based on genetic algorithm","volume":"37","author":"Li","year":"2015","journal-title":"Logistics Engineering and Management"},{"issue":"4","key":"10.3233\/JCM-215582_ref4","first-page":"70","article-title":"The selection strategy of the exit box of container terminal based on the hybrid mode","volume":"29","author":"Xie","year":"2008","journal-title":"Journal of Shanghai Maritime University"},{"key":"10.3233\/JCM-215582_ref5","unstructured":"P.F. Zhou, J.Q. Zhao and E.J. Shang, Optimal interference management of export bins in mixed container yards, Journal of Harbin Engineering University 38(6) (2017), 866-873+938."},{"key":"10.3233\/JCM-215582_ref7","unstructured":"Z.Y. Hao and X.L. Han, Research on the allocation of export container bins based on random delivery, Journal of Wuhan University of Technology (Transportation Science and Engineering) 38(1) (2014), 157-161+166."},{"key":"10.3233\/JCM-215582_ref8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(99)00116-2","article-title":"Deriving decision rules to locate export containers in container yards","author":"Kim","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.3233\/JCM-215582_ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","article-title":"A survey of Monte Carlo tree search methods","volume":"4","author":"Browne","year":"2012","journal-title":"IEEE Transactions on Computational Intelligence and Ai in Games"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-215582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:06:48Z","timestamp":1776809208000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-215582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,26]]},"references-count":8,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jcm-215582","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,26]]}}}