{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:32:32Z","timestamp":1761352352316,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T00:00:00Z","timestamp":1529539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71501190","71771218"],"award-info":[{"award-number":["71501190","71771218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s12652-018-0918-9","type":"journal-article","created":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T05:29:45Z","timestamp":1529558985000},"page":"483-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Research on optimization of multi stage yard crane scheduling based on genetic algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"Dingyou","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinggui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangkun","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,21]]},"reference":[{"issue":"3","key":"918_CR1","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.ejor.2011.10.005","volume":"217","author":"Bortfeldt","year":"2012","unstructured":"Bortfeldt, Forster F (2012a) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217(3):532\u2013541","journal-title":"Eur J Oper Res"},{"issue":"2","key":"918_CR3","first-page":"456","volume":"57","author":"Boysen","year":"2014","unstructured":"Boysen, Roodbergen KJ (2014) Scheduling of container storage and retrieval. Oper Res 57(2):456\u2013467","journal-title":"Oper Res"},{"issue":"2","key":"918_CR4","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"Carlo","year":"2014","unstructured":"Carlo, Vis J (2014) Storage yard operations in container terminals lite overview. Eur J Oper Res 235(2):412\u2013430","journal-title":"Eur J Oper Res"},{"issue":"1","key":"918_CR5","first-page":"38","volume":"5482","author":"Caserta","year":"2011","unstructured":"Caserta, Schwarze S (2011) A new binary description of the blocks relocation problem and benefits in a look ahead heuristic. Lect Notes Comput Sci 5482(1):38\u201349","journal-title":"Lect Notes Comput Sci"},{"issue":"11","key":"918_CR6","first-page":"3296","volume":"34","author":"Chao","year":"2010","unstructured":"Chao, Hsu NY (2010) An optimization model for the container pre-marshalling problem. Comput Oper Res 34(11):3296\u20133314","journal-title":"Comput Oper Res"},{"issue":"1","key":"918_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ijpe.2010.09.019","volume":"135","author":"Chen","year":"2012","unstructured":"Chen, Lu Z (2012) The storage location assignment problem for outbound containers in a maritime terminal. Int J Prod Econ 135(1):73\u201380","journal-title":"Int J Prod Econ"},{"issue":"2","key":"918_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","volume":"39","author":"Forster","year":"2012","unstructured":"Forster, Bortfeldt A (2012b) A tree search procedure for the container relocation problem. Comput Oper Res 39(2):299\u2013309","journal-title":"Comput Oper Res"},{"issue":"2","key":"918_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/nav.21569","volume":"61","author":"Hakan Akyuz","year":"2014","unstructured":"Hakan Akyuz, Lee CY (2014) A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Nav Res Logist 61(2):101\u2013108","journal-title":"Nav Res Logist"},{"issue":"3","key":"918_CR9","first-page":"313","volume":"47","author":"Hong","year":"2017","unstructured":"Hong, Fliedner M (2017) A survey on container processing in railway yards. Transp Sci 47(3):313\u2013330","journal-title":"Transp Sci"},{"issue":"1","key":"918_CR10","first-page":"14","volume":"62","author":"Huang","year":"2012","unstructured":"Huang, Lin TH (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62(1):14\u201321","journal-title":"Comput Ind Eng"},{"key":"918_CR11","first-page":"374","volume":"172","author":"Imai","year":"2016","unstructured":"Imai, Sasaki K (2016) Multi-objective simulations stowage and load planning for a container ship with container in yard stacks. Eur J Oper Res 172:374\u2013390","journal-title":"Eur J Oper Res"},{"issue":"2","key":"918_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ijpe.2012.06.033","volume":"143","author":"Jang","year":"2013","unstructured":"Jang, Kim SW (2013) The optimization of mixed block stacking requiring locations. Int J Prod Econ 143(2):256\u2013262","journal-title":"Int J Prod Econ"},{"issue":"1","key":"918_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","volume":"75","author":"Jovanovic","year":"2014","unstructured":"Jovanovic, Vop S (2014) A chain heuristic for the blocks relocation problem. Comput Ind Eng 75(1):79\u201386","journal-title":"Comput Ind Eng"},{"issue":"4","key":"918_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10845-005-0013-x","volume":"17","author":"Kang","year":"2016","unstructured":"Kang, Ryu K (2016) Deriving stacking strategies for export containers with uncertain weight information. J Intell Manuf 17(4):399\u2013410","journal-title":"J Intell Manuf"},{"issue":"4","key":"918_CR15","first-page":"656","volume":"35","author":"Kim","year":"2016","unstructured":"Kim, Bae JW (2016) Re-marshaling export containers in port container terminals. Comput Ind Eng 35(4):656\u2013659","journal-title":"Comput Ind Eng"},{"issue":"4","key":"918_CR16","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"Kim","year":"2016","unstructured":"Kim, Hong GP (2016) A heuristic rule for relocation blocks. Comput Oper Res 33(4):940\u2013954","journal-title":"Comput Oper Res"},{"issue":"3","key":"918_CR17","first-page":"469","volume":"196","author":"Lee","year":"2015","unstructured":"Lee, Chao SL (2015) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196(3):469\u2013476","journal-title":"Eur J Oper Res"},{"issue":"6","key":"918_CR18","first-page":"1140","volume":"37","author":"Lee","year":"2013","unstructured":"Lee, Zhang YJ (2013) A heuristic for retrieving containers from a yard. Comput Oper Res 37(6):1140\u20131148","journal-title":"Comput Oper Res"},{"issue":"2","key":"918_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","volume":"239","author":"Lehnfeld","year":"2014","unstructured":"Lehnfeld, Knust (2014) Loading and unloading and premarshalling of stacks in storage areas survey and classification. Eur J Oper Res 239(2):297\u2013312","journal-title":"Eur J Oper Res"},{"key":"918_CR20","first-page":"570","volume":"32","author":"Meisel","year":"2011","unstructured":"Meisel, Wichmann M (2011) Container sequencing for quay cranes with internal reshuffles. OR Spectr 32:570\u2013592","journal-title":"OR Spectr"},{"key":"918_CR21","first-page":"264","volume":"30","author":"Ng","year":"2015","unstructured":"Ng, Mak K (2015) Yard crane scheduling in port container terminals. Appl Math Model 30:264\u2013277","journal-title":"Appl Math Model"},{"issue":"1","key":"918_CR22","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ejor.2013.05.037","volume":"231","author":"Petering","year":"2013","unstructured":"Petering, Hussein MI (2013) A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur J Oper Res 231(1):121\u2013131","journal-title":"Eur J Oper Res"},{"issue":"1","key":"918_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00293-X","volume":"147","author":"Vis","year":"2013","unstructured":"Vis, Koster (2013) Transshipment of containers at a container terminal an overview. Eur J Oper Res 147(1):1\u201315","journal-title":"Eur J Oper Res"},{"issue":"4","key":"918_CR24","first-page":"711","volume":"9","author":"Zhu","year":"2012","unstructured":"Zhu, Qin H (2012) Iterative deepening A algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9(4):711\u2013724","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0918-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0918-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0918-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T09:10:44Z","timestamp":1580807444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0918-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,21]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0918-9","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2018,6,21]]},"assertion":[{"value":"4 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}