References

Agerschou, H., 2004. Planning and Design of Ports and Marine Terminals. 2nd Edn., Thomas Telford Ltd, London, England, UK., ISBN:9780727732248, Pages: 424.

Akyuz, H.M. and C.Y. Lee, 2014. A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Nav. Res. Logistics NRL., 61: 101-118.
CrossRef  |  Direct Link  |  

Aslidis, A.H., 1989. Combinatorial algorithms for stacking problems. Ph.D Thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts.

Avriel, M., M. Penn and N. Shpirer, 2000. Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl. Math., 103: 271-279.
Direct Link  |  

Avriel, M., M. Penn, N. Shpirer and S. Witteboon, 1998. Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res., 76: 55-71.
Direct Link  |  

Battarra, M., G. Erdogan, G. Laporte and D. Vigo, 2010. The traveling salesman problem with pickups, deliveries and handling costs. Transp. Sci., 44: 383-399.
Direct Link  |  

Bektas, T., 2006. The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34: 209-219.
Direct Link  |  

Bigras, L.P., M. Gamache and G. Savard, 2008. The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim., 5: 685-699.
Direct Link  |  

Carrabs, F., J.F. Cordeau and G. Laporte, 2007. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J. Comput., 19: 618-632.
Direct Link  |  

Casey, B. and E. Kozan, 2012. Optimising container storage processes at multimodal terminals. J. Oper. Res. Soc., 63: 1126-1142.
Direct Link  |  

Cherkesly, M., G. Desaulniers and G. Laporte, 2014. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transp. Sci., 49: 752-766.
Direct Link  |  

Cherkesly, M., G. Desaulniers, S. Irnich and G. Laporte, 2016. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res., 250: 782-793.
Direct Link  |  

Christiansen, M., K. Fagerholt and D. Ronen, 2004. Ship routing and scheduling: Status and perspectives. Trans. Sci., 38: 1-18.
CrossRef  |  

Cordeau, J.F., G. Laporte, P. Legato and L. Moccia, 2005. Models and tabu search heuristics for the berth-allocation problem. Transp. Sci., 39: 526-538.
CrossRef  |  

Cordeau, J.F., M. Iori, G. Laporte and S.J.J. Gonzalez, 2010. A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks, 55: 46-59.
CrossRef  |  Direct Link  |  

Crainic, T.G. and K.H. Kim, 2007. Intermodal transportation. Handbooks Oper Res. Manage. Sci., 14: 467-537.
Direct Link  |  

Dekker, R., P. Voogd and V.E. Asperen, 2006. Advanced methods for container stacking. OR. Spectr., 28: 563-586.
Direct Link  |  

Delgado, A., R.M. Jensen and C. Schulte, 2009. Generating Optimal Stowage Plans for Container Vessel Bays. In: Principles and Practice of Constraint Programming, Gent, I.P. (Ed.). Springer, Berlin, Germany, ISBN:978-3-642-04243-0, pp: 6-20.

Douma, A., M. Schutten andd P. Schuur, 2009. Waiting profiles: An efficient protocol for enabling distributed planning of container barge rotations along terminals in the port of Rotterdam. Transp. Res. Part C. Emerging Technol., 17: 133-148.
Direct Link  |  

Dubrovsky, O., G. Levitin and M. Penn, 2002. A genetic algorithm with a compact solution encoding for the container ship stowage problem. J. Heuristics, 8: 585-599.
Direct Link  |  

Erdogan, G., J.F. Cordeau and G. Laporte, 2009. The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res., 36: 1800-1808.
Direct Link  |  

Erdogan, G., M. Battarra, G. Laporte and D. Vigo, 2012. Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Comput. Oper. Res., 39: 1074-1086.
Direct Link  |  

Garey, M.R. and D.S. Johnson, 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York, USA., Pages: 338.

Gunther, H.O. and K.H. Kim, 2006. Container terminals and terminal operations. OR. Spectr., 28: 437-445.
Direct Link  |  

Ichoua, S., M. Gendreau and J.Y. Potvin, 2003. Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res., 144: 379-396.
CrossRef  |  Direct Link  |  

Iori, M. and S. Martello, 2010. Routing problems with loading constraints. Top, 18: 4-27.
Direct Link  |  

Petersen, H.L. and O.B. Madsen, 2009. The double travelling salesman problem with multiple stacks formulation and heuristic solution approaches. Eur. J. Oper. Res., 198: 139-147.
Direct Link  |  

Stahlbock, R. and S. Voβ, 2008. Operations research at container terminals: A literature update. OR Spectrum, 30: 1-52.
CrossRef  |  

Steenken, D., S. Voβ and R. Stahlbock, 2004. Container terminal operation and operations research-a classification and literature review. OR Spectrum, 26: 3-49.
CrossRef  |  

Tagmouti, M., M. Gendreau and J.Y. Potvin, 2007. Arc routing problems with time-dependent service costs. Eur. J. Oper. Res., 181: 30-39.
Direct Link  |  

Tagmouti, M., M. Gendreau and J.Y. Potvin, 2011. A dynamic capacitated arc routing problem with time-dependent service costs. Transp. Res. Part C. Emerging Technol., 19: 20-28.
Direct Link  |  

Veenstra, M., K.J. Roodbergen, I.F.A. Vis and L.C. Coelho, 2017. The pickup and delivery traveling salesman problem with handling costs. Eur. J. Oper. Res., 257: 118-132.
Direct Link  |  

Veenstra, M., M. Cherkesly, G. Desaulniers and G. Laporte, 2017. The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res., 77: 127-140.
Direct Link  |  

Vis, I.F.A. and R. de Koster, 2003. Transshipment of containers at a container terminal: An overview. Eur. J. Oper. Res., 147: 1-16.
CrossRef  |  Direct Link  |  

Wang, N., Z. Zhang and A. Lim, 2014. The Stowage Stack Minimization Problem with Zero Rehandle Constraint. In: Modern Advances in Applied Intelligence, Ali M., J.S. Pan, S.M. Chen and M.F. Horng (Eds.). Springer, Cham Municipality, Switzerland, ISBN:978-3-319-07466-5, pp: 456-465.

Wiel, V.R.J. and N.V. Sahinidis, 1996. An exact solution approach for the time‐dependent traveling‐salesman problem. Nav. Res. Logist. NRL., 43: 797-820.
Direct Link  |  

Wilson, I.D. and P.A. Roach, 1999. Principles of combinatorial optimization applied to container-ship stowage planning. J. Heuristics, 5: 403-418.
CrossRef  |  

Wilson, I.D. and P.A. Roach, 2000. Container stowage planning: A methodology for generating computerised solutions. J. Operational Res. Soc., 51: 1248-1255.
Direct Link  |  

Wilson, I.D., P.A. Roach and J.A. Ware, 2001. Container stowage pre-planning: Using search to generate solutions, a case study. Knowledge-Based Syst., 14: 137-145.
CrossRef  |  

Yaagoubi, A.E., A.E.H. Alaoui and J. Boukachour, 2016. Multiobjective container barge transport problem. Proceedings of the 2016 3rd International Conference on Logistics Operations Management (GOL), May 23-25, 2016, IEEE, Fez, Morocco, ISBN:978-1-4673-8571-8, pp: 1-6.