Scheduling Twin Yard Cranes in a Container Block

References

• Applegate DL, Bixby RE, Chvatal V, Cook WJ (2007) The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics (Princeton University Press, Princeton, NJ).Google Scholar
• Bartodziej P, Derigs U, Malcherek D, Vogel U (2009) Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation. OR Spectrum 31(2):405–429.Crossref, Google Scholar
• Bent R, Van Hentenryck P (2004) A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38(4):515–530.Link, Google Scholar
• Bontoux B, Artigues C, Feillet D (2010) A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput. Oper. Res. 37(11):1844–1852.Crossref, Google Scholar
• Böse JW (2011) Handbook of Terminal Planning (Springer, New York).Crossref, Google Scholar
• Bozer YA, Carlo HJ (2008) Optimizing inbound and outbound door assignments in less-than-truckload crossdocks. IIE Trans. 40(11):1007–1018.Crossref, Google Scholar
• Burkard RE, Deineko VG, Van Dal R, Van der Veen JAA, Woeginger GJ (1998) Well-solvable special cases of the traveling salesman problem: A survey. SIAM Rev. 40(3):496–546.Crossref, Google Scholar
• Cao Z, Lee DH, Meng Q (2008) Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals. Internat. J. Production Econom. 115(1):221–228.Crossref, Google Scholar
• Caserta M, Voß S (2009) A corridor method-based algorithm for the pre-marshalling problem. Giacobini M, Brabazon A, Cagnoni S, Di Caro GA, Ekárt A, Esparcia-Alcázar A, Farooq M, Fink A, Machado P, eds. Applications of Evolutionary Computing, Lecture Notes in Computer Science, Vol. 5484 (Springer, Berlin), 788–797.Crossref, Google Scholar
• Cheung RK, Li CL, Lin W (2002) Interblock crane deployment in container terminals. Transportation Sci. 36(1):79–93.Link, Google Scholar
• Choo S, Klabjan D, Simchi-Levi D (2010) Multiship crane sequencing with yard congestion constraints. Transportation Sci. 44(1):98–115.Link, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2012) The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11):2537–2548.Crossref, Google Scholar
• Cosmos NV (2012) Accessed December 5, 2012, http://www.cosmosworldwide.com/.Google Scholar
• Daganzo CF (1989) The crane scheduling problem. Transportation Res. Part B 23(3):159–175.Crossref, Google Scholar
• De Castillo B, Daganzo CF (1993) Handling strategies for import containers at marine terminals. Transportation Res. Part B 27(2):151–166.Crossref, Google Scholar
• de Koster R, Balk BM, Van Nus WTI (2009) On using DEA for benchmarking container terminals. Internat. J. Oper. Production Management 29(11):1140–1155.Crossref, Google Scholar
• Dekker R, Voogd P, Asperen E (2007) Advanced methods for container stacking. Kim KH, Günther HO, eds. Container Terminals and Cargo Systems (Springer, Berlin), 131–154.Crossref, Google Scholar
• Drewry (2011) Container Forecaster (Drewery Publications, London).Google Scholar
• Fischetti M, Gonzalez JJS, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3):378–394.Link, Google Scholar
• Froyland G, Koch T, Megow N, Duane E, Wren H (2008) Optimizing the landside operation of a container terminal. OR Spectrum 30(1):53–75.Crossref, Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York).Google Scholar
• Gharehgozli AH, Yu Y, de Koster R (2013) Sequencing storage and retrieval requests in a container block with multiple open locations. Technical report, Rotterdam School of Management, Rotterdam, Netherlands.Google Scholar
• Gharehgozli AH, Yu Y, de Koster R, Udding JT (2014a) A decision-tree stacking heuristic for large scale reshuffling problems at a container yard. Internat. J. Production Res. 52(9):2592–2611.Google Scholar
• Gharehgozli AH, Yu Y, de Koster R, Udding JT (2014b) An exact method for scheduling a yard crane. Eur. J. Oper. Res. 235(2):431–447.Google Scholar
• Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transportation Sci. 40(4):473–483.Link, Google Scholar
• Goodchild AV, Daganzo CF (2007) Crane double cycling in container ports: Planning methods and evaluation. Transportation Res. Part B 41(8):875–891.Crossref, Google Scholar
• Gutin G, Karapetyan D (2009) Generalized traveling salesman problem reduction algorithms. Algorithmic Oper. Res. 4(2):144–154.Google Scholar
• Gutin G, Karapetyan D (2010) A memetic algorithm for the generalized traveling salesman problem. Natural Comput. 9(1):47–60.Crossref, Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2):314–325.Link, Google Scholar
• Kang S, Medina JC, Ouyang Y (2008) Optimal operations of transportation fleet for unloading activities at container ports. Transportation Res. Part B 42(10):970–984.Crossref, Google Scholar
• Karapetyan D, Gutin G (2012) Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Eur. J. Oper. Res. 219(2):234–251.Crossref, Google Scholar
• Kim KH, Kim KY (1999) An optimal routing algorithm for a transfer crane in port container terminals. Transportation Sci. 33(1):17–33.Link, Google Scholar
• Kim KH, Park YM, Ryu KR (2000) Deriving decision rules to locate export containers in container yards. Eur. J. Oper. Res. 124(1):89–101.Crossref, Google Scholar
• Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680.Crossref, Google Scholar
• Laporte G (1992) The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2):231–247.Crossref, Google Scholar
• Laporte G, Mercure H, Nobert Y (1987) Generalized travelling salesman problem through n sets of nodes: The asymmetrical case. Discrete Appl. Math. 18(2):185–197.Crossref, Google Scholar
• Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Sci. 44(1):125–135.Link, Google Scholar
• Lattin J, Carrol JD, Green PE (2003) Analyzing Multivariate Data (Brooks/Cole, Pacific Grove, CA).Google Scholar
• Li W, Wu Y, Petering MEH, Goh M, de Souza R (2009) Discrete time model and algorithms for container yard crane scheduling. Eur. J. Oper. Res. 198(1):165–172.Crossref, Google Scholar
• Li W, Goh M, Wu Y, Petering MEH, De Souza R, Wu YC (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. Internat. J. Production Econom. 136(2):332–343.Crossref, Google Scholar
• Linn RJ, Zhang CQ (2003) A heuristic for dynamic yard crane deployment in a container terminal. IIE Trans. 35(2):161–174.Crossref, Google Scholar
• Modality Software Solutions BV (2012) Accessed December 5, 2012, http://www.modality.nl/products.php?lang=en.Google Scholar
• Narasimhan A, Palekar US (2002) Analysis and algorithms for the transtainer routing problem in container port operations. Transportation Sci. 36(1):63–78.Link, Google Scholar
• Newman AM, Yano CA (2000) Scheduling direct and indirect trains and containers in an intermodal setting. Transportation Sci. 34(3):256–270.Link, Google Scholar
• Ng WC (2005) Crane scheduling in container yards with inter-crane interference. Eur. J. Oper. Res. 164(1):64–78.Crossref, Google Scholar
• Ng WC, Mak KL (2005) Yard crane scheduling in port container terminals. Appl. Math. Modelling 29(3):263–276.Crossref, Google Scholar
• Noon CE, Bean JC (1991) A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Oper. Res. 39(4):623–632.Link, Google Scholar
• Pepin AS, Desaulniers G, Hertz A, Huisman D (2009) A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Scheduling 12(1):17–30.Crossref, Google Scholar
• Petering MEH (2011) Decision support for yard capacity, fleet composition, truck substitutability, and scalability issues at seaport container terminals. Transportation Res. Part E 47(1):85–103.Crossref, Google Scholar
• Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403–2435.Crossref, Google Scholar
• Port of Rotterdam Authority, ed. (2010) Port Statistics (Port of Rotterdam Authority, Rotterdam, Netherlands), 1–20.Google Scholar
• Renaud J, Boctor FF (1998) An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur. J. Oper. Res. 108(3):571–584.Crossref, Google Scholar
• Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3):750–775.Crossref, Google Scholar
• Sammarra M, Cordeau J-F, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J. Scheduling 10(4–5):327–336.Crossref, Google Scholar
• Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, University of Strathclyde, Glasgow, UK.Google Scholar
• Silberholz J, Golden BL (2007) The generalized traveling salesman problem: A new genetic algorithm approach. Baker EK, Joseph A, Mehrotra A, Trick MA, Sharda R, Voß S, eds. Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies, Vol. 37 (Springer, Boston), 165–181.Crossref, Google Scholar
• Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174(1):38–53.Crossref, Google Scholar
• Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—A classification and literature review. OR Spectrum 26(1):3–49.Crossref, Google Scholar
• Tasgetiren MF, Suganthan PN, Pan QK (2010) An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9):3356–3368.Crossref, Google Scholar
• Ultimate (2013) Ultimate: Efficient multimodal. Accessed January 3, 2013, http://www.dinalog.nl/en/projects/r_d_projects/ultimate__efficient_multimodal/.Google Scholar
• Vis IFA (2006) A comparative analysis of storage and retrieval equipment at a container terminal. Internat. J. Production Econom. 103(2):680–693.Crossref, Google Scholar
• Vis IFA, Carlo HJ (2010) Sequencing two cooperating automated stacking cranes in a container terminal. Transportation Sci. 44(2):169–182.Link, Google Scholar
• Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: An overview. Eur. J. Oper. Res. 147(1):1–16.Crossref, Google Scholar
• Vis IFA, Roodbergen KJ (2009) Scheduling of container storage and retrieval. Oper. Res. 57(2):456–467.Link, Google Scholar
• Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by a simulated annealing. IIE Trans. 19(1):107–119.Crossref, Google Scholar
• Zhang C, Wan YW, Liu J, Linn RJ (2002) Dynamic crane deployment in container storage yards. Transportation Res. Part B 36(6):537–555.Crossref, Google Scholar
• Zhen L, Chew EP, Lee LH (2011) An integrated model for berth template and yard template planning in transshipment hubs. Transportation Sci. 45(4):483–504.Link, Google Scholar