Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

DOI10.1016/j.ejor.2021.10.037zbMath1506.90110OpenAlexW3209728093MaRDI QIDQ2116934

Matteo Petris, Paola Pellegrini, Raffaele Pesenti

Publication date: 18 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.037

zbMATH Keywords

transportationOR in maritime industryvessel schedulingtug assignment

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• The lockmaster's problem
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Discrete optimization in public rail transport
• A two-phase heuristic for an in-port ship routing problem with tank allocation
• Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
• Exact and heuristic methods for optimizing lock-quay system in inland waterway
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• Selecting algorithms for large berth allocation problems
• Scheduling ships movements within a canal harbor
• Ship routing and scheduling in the new millennium
• Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Improving Discrete Model Representations via Symmetry Considerations
• The locomotive assignment problem: a survey on optimization models
• Ship Traffic Optimization for the Kiel Canal

This page was built for publication: Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor