Ship Traffic Optimization for the Kiel Canal

References

• Baker BS, Coffman EG Jr, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J. Comput. 9(4):846–855.Crossref, Google Scholar
• Bierwirth C, Corry P (2018) Integrating ship scheduling and berth allocation for container seaports with channel access. Freitag M, Kotzab H, Pannek J, eds. Dynamics in Logistics, Lecture Notes in Logistics (Springer, Cham, Switzerland), 144–147.Crossref, Google Scholar
• Błądek I, Drozdowski M, Guinand F, Schepler X (2015) On contiguous and non-contiguous parallel task scheduling. J. Scheduling 18(5):487–495.Crossref, Google Scholar
• Brockmann J, Heeling A, Pohl M, Uliczka K (2008) The Kiel canal. Die Küste 74:317–332.Google Scholar
• Campbell JF, Smith LD, Sweeney DC II, Mundy R, Nauss RM (2007) Decision tools for reducing congestion at locks on the Upper Mississippi River. Sprague E, ed. Proc. 40th Hawaii Internat. Conf. System Sci. (IEEE, Piscataway, NJ), 56–65.Crossref, Google Scholar
• Carey M, Lockwood D (1995) A model, algorithms and strategy for train pathing. J. Oper. Res. Soc. 46(8):988–1005.Crossref, Google Scholar
• Carroll JL, Bronzini MS (1973) Waterway transportation simulation models: Development and application. Water Resources Res. 9(1):51–63.Crossref, Google Scholar
• Ceder A (2007) Public Transit Planning and Operation: Theory, Modelling and Practice (Elsevier, Butterworth-Heinemann, Oxford, UK).Crossref, Google Scholar
• D’Ariano A, Corman F, Pacciarelli D, Pranzo M (2008) Reordering and local rerouting strategies to manage train traffic in real time. Transportation Sci. 42(4):405–419.Link, Google Scholar
• Desrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR Inform. Systems Oper. Res. 26(3):191–212.Crossref, Google Scholar
• Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Routing, Handbooks in Operations Research and Management Science, vol. 8 (Elsevier, Amsterdam), 35–139.Crossref, Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Math. 1(1):269–271.Crossref, Google Scholar
• Disser Y, Klimm M, Lübbecke E. 2015. Scheduling bidirectional traffic on a path. Halldórsson MM, Iwama K, Kobayashi N, Speckmann B, eds. International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 9135 (Springer, Berlin), 406–418.Crossref, Google Scholar
• Duin CW, Van Der Sluis E (2006) On the complexity of adjacent resource scheduling. J. Scheduling 9(1):49–62.Crossref, Google Scholar
• Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper. Res. 6(3):419–433.Link, Google Scholar
• Ford LR, Fulkerson DR (1962) Flows in Networks (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Gawrilow E, Köhler E, Möhring RH, Stenzel B (2008) Dynamic routing of automated guided vehicles in real-time. Krebs H-J, Jäger W, eds. Mathematics: Key Technology for the Future (Springer, Berlin), 165–177.Crossref, Google Scholar
• Griffiths JD (1995) Queueing at the Suez Canal. J. Oper. Res. Soc. 46(11):1299–1309.Crossref, Google Scholar
• Gucma S (2016) Parameter optimization of sea waterway system dredged to the specified depth case of the modernized Świnoujście-Szczecin fairway. Arch. Transport 40(4):29–38.Crossref, Google Scholar
• Günther E, König FG, Megow N (2014) Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. J. Combin. Optim. 27(1):164–181.Crossref, Google Scholar
• Harbering J, Ranade A, Schmidt M (2015) Single track train scheduling. Zdenek Hanzálek Z, Kendall G, McCollum B, Premysl Šůcha P, eds. Proc. 7th Multidisciplinary Internat. Conf. Scheduling Theory Appl. 2015, Prague, Czech Republic, 102–117.Google Scholar
• Higgins A, Kozan E, Ferreira L (1997) Heuristic techniques for single line train scheduling. J. Heuristics 3(1):43–62.Crossref, Google Scholar
• Holm H, Grundevik P (2015) Ship traffic scheduling in the Göta River. Accessed January 6, 2019, https://www.sspa.se/port-and-logistics/ship-traffic-scheduling-gota-river.Google Scholar
• Jaumard B, Hoa Le T, Tian H, Akgunduz A, Finnie P (2013) An enhanced optimization model for scheduling freight trains. Proc. 2013 ASME/IEEE Joint Rail Conf., Knoxville, Tennessee, V001T04A003.Crossref, Google Scholar
• Koch Th, et al.. (2011) MIPLIB 2010—Mixed integer programming library version 5. Math. Programming Comput. 3(2):103–163.Crossref, Google Scholar
• Lalla-Ruiz E, Shi X, Voß S (2016) The waterway ship scheduling problem. Transportation Res. Part D 60:191–209.Crossref, Google Scholar
• Lamorgese L, Mannino C (2015) An exact decomposition approach for the real-time train dispatching problem. Oper. Res. 63(1):48–64.Link, Google Scholar
• Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. Graves SC, Rinnooy Kan AHG, Zipkin PH, eds. Handbooks in Operations Research and Management Science, vol. 4 (Elsevier, Amsterdam), 445–522.Google Scholar
• Lübbecke E (2015) On- and offline scheduling of bidirectional traffic. PhD thesis, Institut für Mathematik, Technische Universität, Berlin.Google Scholar
• Lübbecke ME, Höhn W (2009) DFG Science TV: Discrete optimisers. Accessed January 6, 2019, http://www.dfg.de/service/dfg_bewegt/dfgscience_tv/.Google Scholar
• Lusby RM, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: Models and methods. OR Spectrum 33(4):843–883.Crossref, Google Scholar
• Luy M (2010) Algorithmen zum Scheduling von Schleusungsvorgängen am Beispiel des Nord-Ostsee-Kanals. Master’s thesis, Institut für Mathematik, Technische Universität, Berlin.Google Scholar
• Mitchell KN, Wang BX, Khodakarami M (2013) Selection of dredging projects for maximizing waterway system performance. Transportation Res. Record 2330:39–46.Crossref, Google Scholar
• Passchyn W, Coene S, Briskorn D, Hurink JL, Spieksma FCR, Vanden Berghe G (2016) The lockmaster’s problem. Eur. J. Oper. Res. 251(2):432–441.Crossref, Google Scholar
• Petersen ER, Taylor AJ (1988) An optimal scheduling system for the Welland Canal. Transportation Sci. 22(3):173–185.Link, Google Scholar
• Potts CN, Kovalyov MY (2000) Scheduling with batching: A review. Eur. J. Oper. Res. 120(2):228–249.Crossref, Google Scholar
• Rambau J, Schwarz C (2010) How to avoid collisions in scheduling industrial robots? Working paper, Bayreuth University, Bayreuth, Germany.Google Scholar
• Righini G (2016) A network flow model of the Northern Italy waterway system. EURO J. Transportation Logist. 5:99–122.Crossref, Google Scholar
• Schlechte T (2012) Railway track allocation: Models and algorithms. PhD thesis, Institut für Mathematik, Technische Universität, Berlin.Google Scholar
• Schonfeld P, Ting C-J (1998) Optimization through simulation of waterway transportation investments. Transportation Res. Record 1620:11–16.Crossref, Google Scholar
• Schonfeld P, Wang S-L (2005) Scheduling interdependent waterway projects through simulation and genetic optimization. J. Waterway Port Coastal Ocean Engrg. 131(3):89–97.Crossref, Google Scholar
• Shih M-C, Lai Y-C, Dick T, Wu M-H (2014) Optimization of siding location for single-track lines. Transportation Res. Record 2448(1):71–79.Crossref, Google Scholar
• Skutella M (2009) An introduction to network flows over time. Cook W, Lovász L, Vygen J, eds. Research Trends in Combinatorial Optimization (Springer, Berlin), 451–482.Crossref, Google Scholar
• Skutella M, Welz W (2011) Route planning for robot systems. Hu B, Morasch K, Pickl St, Siegle M, eds. Operations Research Proceedings 2010 (Springer, Berlin), 307–312.Crossref, Google Scholar
• Solomon MM, Desrosiers J (1988) Survey paper—Time window constrained routing and scheduling problems. Transportation Sci. 22(1):1–13.Link, Google Scholar
• Szpigel B (1973) Optimal train scheduling on a single track railway. Ross M, ed. Operational Research ’72 (North-Holland, Amsterdam), 343–352.Google Scholar
• Ulusçu ÖS, Özbaş B, Altıok T, Or İ, Yılmaz T (2009) Transit vessel scheduling in the Strait of Istanbul. J. Navigation 62(1):59–77.Crossref, Google Scholar
• Verstichel J, Vanden Berghe G (2009) A late acceptance algorithm for the lock scheduling problem. Voß S, Pahl J, Schwarze S, eds. Logistik Management (Physica, Heidelberg, Germany), 457–478.Crossref, Google Scholar