{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T07:51:57Z","timestamp":1768809117898,"version":"3.49.0"},"reference-count":45,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":1054,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s13676-016-0098-8","type":"journal-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T04:23:34Z","timestamp":1471235014000},"page":"307-348","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports"],"prefix":"10.1016","volume":"6","author":[{"given":"Niraj Ramesh","family":"Dayama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Ernst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vishnu","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narayan","family":"Rangaraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13676-016-0098-8_bib1","unstructured":"AAPA rankings (2010) Traffic of containers handled at major container ports. http:\/\/en.wikipedia.org\/wiki\/List_of_world\u2019s_busiest_container_ports. Last accessed 19 May 2013"},{"key":"10.1007\/s13676-016-0098-8_bib2","doi-asserted-by":"crossref","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. J ACM 55(5):23:1\u201323:27","DOI":"10.1145\/1411509.1411513"},{"key":"10.1007\/s13676-016-0098-8_bib3","unstructured":"Aslidis A (1989) Combinatorial algorithms for stacking problems. Ph.D. thesis, Massachusetts Institute of Technology"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1137\/0405027","article-title":"A polynomial algorithm for the 2-path problem for semicomplete digraphs","volume":"5","author":"Bang-Jensen","year":"1992","journal-title":"SIAM J Disc Math"},{"key":"10.1007\/s13676-016-0098-8_bib5","unstructured":"Bohrer P (2005) Crane scheduling in container terminals. Ph.D. thesis"},{"issue":"4","key":"10.1007\/s13676-016-0098-8_bib6","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","article-title":"Applying the corridor method to a blocks relocation problem","volume":"33","author":"Caserta","year":"2011","journal-title":"OR Spectr"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","article-title":"A mathematical formulation and complexity considerations for the blocks relocation problem","volume":"219","author":"Caserta","year":"2012","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13676-016-0098-8_bib8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0191-2615(93)90005-U","article-title":"Handling strategies for import containers at marine terminals","volume":"27","author":"Castillo","year":"1993","journal-title":"Transp Res Part B"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548306007887","article-title":"The minimum feedback arc set problem is NP-hard for tournaments","volume":"16","author":"Charbit","year":"2007","journal-title":"Comb Probab Comput"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/030888399287041","article-title":"Yard operations in the container terminal\u2014a study in the unproductive moves","volume":"26","author":"Chen","year":"1999","journal-title":"Marit Policy Manag"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.ijpe.2010.09.012","article-title":"A tabu search algorithm for the relocation problem in a warehousing system","volume":"129","author":"Chen","year":"2011","journal-title":"Int J Prod Econ"},{"issue":"2","key":"10.1007\/s13676-016-0098-8_bib12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1287\/opre.21.2.577","article-title":"The rearrangement of items in a warehouse","volume":"21","author":"Christofides","year":"1973","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0605004","article-title":"A new formulation for the travelling salesman problem","volume":"5","author":"Claus","year":"1984","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"10.1007\/s13676-016-0098-8_bib14","unstructured":"Container HandBook from GDV (2013) Structural and testing regulations. http:\/\/www.containerhandbuch.de\/chb_e\/stra\/index.html?\/chb_e\/stra\/stra_03_01_00.html. Last accessed 19 May 2013"},{"issue":"4","key":"10.1007\/s13676-016-0098-8_bib15","first-page":"393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper Res"},{"key":"10.1007\/s13676-016-0098-8_bib16","doi-asserted-by":"crossref","unstructured":"Dekker R, Voogd P, Asperen E (2007) Advanced methods for container stacking. In: Kim KH, Gunther HO(eds) Container terminals and cargo systems. Springer, Berlin, pp 131\u2013154","DOI":"10.1007\/978-3-540-49550-5_7"},{"issue":"2","key":"10.1007\/s13676-016-0098-8_bib17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","article-title":"A tree search procedure for the container relocation problem","volume":"39","author":"Forster","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13676-016-0098-8_bib18","doi-asserted-by":"crossref","unstructured":"Graham R, Lawler E, Lenstra J, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326. (In: Discrete optimization II proc of the adv research inst. on disc. opt. and systems applications. Elsevier)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"10.1007\/s13676-016-0098-8_bib19","unstructured":"Hamdi SE, Mabrouk A, Bourdeaudhuy T (2012) A heuristic for the container stacking problem in automated maritime ports. In: Information control problems in manufacturing, volume 14 | part 1. 14th IFAC symp. on information control problems in manufacturing"},{"issue":"2","key":"10.1007\/s13676-016-0098-8_bib20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.24006\/jilt.2008.6.2.69","article-title":"Analysis of container dwell time on marine terminal throughput and rehandling productivity","volume":"6","author":"Huynh","year":"2008","journal-title":"J Int Logist Trade"},{"key":"10.1007\/s13676-016-0098-8_bib21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10100-006-0165-6","article-title":"An optimization approach for planning daily drayage operations","volume":"14","author":"Ileri","year":"2006","journal-title":"Central Eur J Oper Res"},{"issue":"11","key":"10.1007\/s13676-016-0098-8_bib22","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/368996.369025","article-title":"Topological sorting of large networks","volume":"5","author":"Kahn","year":"1962","journal-title":"Commun ACM"},{"key":"10.1007\/s13676-016-0098-8_bib23","doi-asserted-by":"crossref","unstructured":"Karpinski M, Schudy W (2010) Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament. In: Algorithms and computation, lecture notes in computer science, vol 6506. Springer, Berlin, pp 3\u201314","DOI":"10.1007\/978-3-642-17517-6_3"},{"key":"10.1007\/s13676-016-0098-8_bib24","unstructured":"Kefi M, Korbaa O, Ghedira K, Yim P (2007) Heuristic-based model for container stacking problem. In: 19th intl. conf. on prod. research"},{"issue":"4","key":"10.1007\/s13676-016-0098-8_bib25","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0360-8352(97)00024-7","article-title":"Evaluation of the number of rehandles in container yards","volume":"32","author":"Kim","year":"1997","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib26","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","volume":"124","author":"Kim","year":"2000","journal-title":"EJOR"},{"key":"10.1007\/s13676-016-0098-8_bib27","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/S0360-8352(98)00182-X","article-title":"Re-marshaling export containers in port container terminals","volume":"35","author":"Kim","year":"1998","journal-title":"Comput Ind Eng"},{"issue":"9","key":"10.1007\/s13676-016-0098-8_bib28","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0191-2615(01)00033-9","article-title":"The optimal sizing of the storage space and handling facilities for import containers","volume":"36","author":"Kim","year":"2002","journal-title":"Transp Res"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib29","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1111\/j.1475-3995.1999.tb00158.x","article-title":"Genetic algorithms to schedule container transfers at multimodal terminals","volume":"6","author":"Kozan","year":"1999","journal-title":"Int Trans Oper Res"},{"issue":"11","key":"10.1007\/s13676-016-0098-8_bib30","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/S0305-0548(97)00013-0","article-title":"Modeling and solving several classes of arc routing problems as traveling salesman problems","volume":"24","author":"Laporte","year":"1997","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13676-016-0098-8_bib31","unstructured":"Mittal AK (1975) Optimal rearrangement of objects. Ph.D. thesis, Case Western Reserve University"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.apm.2004.09.009","article-title":"Yard crane scheduling in port container terminals","volume":"29","author":"Ng","year":"2005","journal-title":"Appl Math Model"},{"issue":"1\u20133","key":"10.1007\/s13676-016-0098-8_bib33","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the travelling salesman problem","volume":"52","author":"Padberg","year":"1991","journal-title":"Math Program"},{"key":"10.1007\/s13676-016-0098-8_bib34","first-page":"1","article-title":"Planning for selective remarshaling in an automated container terminal using coevolutionary algorithms","volume":"20","author":"Park","year":"2013","journal-title":"Int J Ind Eng Theory Appl Pract"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib35","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","article-title":"A branch and bound solution method for the crane scheduling problem","volume":"24","author":"Peterkofsky","year":"1990","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib36","first-page":"45","article-title":"A solution of the container stacking problem by genetic algorithm","volume":"5","author":"Phatchara","year":"2013","journal-title":"Int J Eng Tech"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib37","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0196-6774(88)90022-3","article-title":"Finding a minimum feedback arc set in reducible flow graphs","volume":"9","author":"Ramachandran","year":"1988","journal-title":"J Algorithms"},{"issue":"3","key":"10.1007\/s13676-016-0098-8_bib38","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.cor.2011.06.017","article-title":"Are stacker crane problems easy? A statistical study","volume":"40","author":"Srour","year":"2013","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0098-8_bib39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","article-title":"Container terminal operation and operations research\u2014a classification and literature review","volume":"26","author":"Steenken","year":"2004","journal-title":"OR Spectr"},{"issue":"2","key":"10.1007\/s13676-016-0098-8_bib40","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J Comput"},{"issue":"8","key":"10.1007\/s13676-016-0098-8_bib41","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1080\/07408179908969874","article-title":"A literature survey on planning and control of warehousing systems","volume":"31","author":"Van den Berg","year":"1999","journal-title":"IIE Trans"},{"key":"10.1007\/s13676-016-0098-8_bib42","first-page":"36","article-title":"Characteristics and analysis method of efficiencies of container terminal: an approach to the optimal loading\/unloading method","volume":"3","author":"Watanabe","year":"1991","journal-title":"Container Age"},{"key":"10.1007\/s13676-016-0098-8_bib43","unstructured":"World Shipping council (2013) Data on container ports. http:\/\/www.worldshipping.org\/about-the-industry\/global-trade\/top-50-world-container-ports. Last accessed 19 May 2013"},{"issue":"4","key":"10.1007\/s13676-016-0098-8_bib44","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10845-005-0018-5","article-title":"A grouped storage method for minimizing relocations in block stacking systems","volume":"17","author":"Yang","year":"2006","journal-title":"J Intell Manuf"},{"key":"10.1007\/s13676-016-0098-8_bib45","unstructured":"Zhu Y, Lim A (2004) Crane scheduling with spatial constraints: mathematical model and solving approaches. In: AIM 30-2004, 8th intl symp. on AI and math., vol\u00a06, pp 1\u201310"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-016-0098-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0098-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:21Z","timestamp":1761882201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["S2192437620300765"],"URL":"https:\/\/doi.org\/10.1007\/s13676-016-0098-8","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-016-0098-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}