With the current revolution in Shipping 4.0, a tremendous amount of data is accumulated during vessel operations.
Data quality (DQ) is becoming more and more important for the further digitalization and effective decision-making
in shipping industry. In this study, a practical DQ assessment method for raw data in vessel operations is proposed.
In this method, specific data categories and data dimensions are developed based on engineering practice and existing
literature. Concrete validation rules are then formed, which can be used to properly divide raw datasets. Afterwards,
a scoring method is used for the assessment of the data quality. Three levels, namely good, warning and alarm,
are adopted to reflect the final data quality. The root causes of bad data quality could be revealed once the internal
dependency among rules has been built, which will facilitate the further improvement of DQ in practice. A case study
based on the datasets from a Danish shipping company is conducted, where the DQ variation is monitored, assessed
and compared. The results indicate that the proposed method is effective to help shipping industry improve the quality
of raw data in practice. This innovation research can facilitate shipping industry to set a solid foundation at the early
stage of their digitalization journeys.
With the current revolution in Shipping 4.0, a tremendous amount of data is accumulated during vessel operations.
Data quality (DQ) is becoming more and more important for the further digitalization and effective decision-making
in shipping industry. In this study, a practical DQ assessment method for raw data in vessel operations is proposed.
In this method, specific data categories and data dimensions are developed based on engineering practice and existing
literature. Concrete validation rules are then formed, which can be used to properly divide raw datasets. Afterwards,
a scoring method is used for the assessment of the data quality. Three levels, namely good, warning and alarm,
are adopted to reflect the final data quality. The root causes of bad data quality could be revealed once the internal
dependency among rules has been built, which will facilitate the further improvement of DQ in practice. A case study
based on the datasets from a Danish shipping company is conducted, where the DQ variation is monitored, assessed
and compared. The results indicate that the proposed method is effective to help shipping industry improve the quality
of raw data in practice. This innovation research can facilitate shipping industry to set a solid foundation at the early
stage of their digitalization journeys.
Due to limited access to domain knowledge and domain-relevant benchmark data, the Container Stowage Planning Problem (CSPP) is notably under-researched. In particular, previous models of the CSPP have lacked two key aspects of the problem: lashing forces and paired block stowage. The former may reduce vessel capacity by up to 10%, and the latter is NP-hard. The Representative CSPP (RCSPP), which captures all critical aspects of the problem is formulated. The presented RCSPP incorporates overlooked constraints such as paired block stowage and lashing, along with an innovative method for estimating lashing forces, all while maintaining simplicity. A heuristic method, STOW, has been developed to identify solutions for the RCSPP using a specially designed benchmark suite based on real-world scenarios. STOW algorithm is an advanced search heuristic employing a diverse range of solution modification strategies, each tailored to address specific aspects of stowage optimization. Feasible solutions were successfully identified for all instances within the benchmark suite. Our initial findings emphasize the importance of accurately modeling lashing forces and employing paired block stowage. Results show that removing the lashing constraint can increase the number of containers stowed by over 7% on average, while disabling paired block stowage can result in nearly a 5% increase.
Due to limited access to domain knowledge and domain-relevant benchmark data, the Container Stowage Planning Problem (CSPP) is notably under-researched. In particular, previous models of the CSPP have lacked two key aspects of the problem: lashing forces and paired block stowage. The former may reduce vessel capacity by up to 10%, and the latter is NP-hard. The Representative CSPP (RCSPP), which captures all critical aspects of the problem is formulated. The presented RCSPP incorporates overlooked constraints such as paired block stowage and lashing, along with an innovative method for estimating lashing forces, all while maintaining simplicity. A heuristic method, STOW, has been developed to identify solutions for the RCSPP using a specially designed benchmark suite based on real-world scenarios. STOW algorithm is an advanced search heuristic employing a diverse range of solution modification strategies, each tailored to address specific aspects of stowage optimization. Feasible solutions were successfully identified for all instances within the benchmark suite. Our initial findings emphasize the importance of accurately modeling lashing forces and employing paired block stowage. Results show that removing the lashing constraint can increase the number of containers stowed by over 7% on average, while disabling paired block stowage can result in nearly a 5% increase.
We consider the Tramp Ship Routing and Scheduling Problem (TSRSP) in which we plan routes for a fleet of tramp shipping vessels operating on a combined contract and spot market. Earlier research has been fragmented due to variations in the side constraints studied. Hence we present the first unified model that can handle speed optimization, chartering costs, bunker planning, and hull cleaning. The model is solved by column generation, where the columns represent the possible routes of a vessel, while the master problem keeps track of the binding constraints. The pricing problem is solved efficiently using a time–space graph and several dominance rules. Real-life instances with up to 40 vessels, 35 geographic regions, and four months planning horizon can be solved to optimality in less than half an hour. The optimized routes increase earnings by 7% compared to historical schedules. Furthermore, policy-makers can use the model as a simulation of a rational agent behavior.
We consider the Tramp Ship Routing and Scheduling Problem (TSRSP) in which we plan routes for a fleet of tramp shipping vessels operating on a combined contract and spot market. Earlier research has been fragmented due to variations in the side constraints studied. Hence we present the first unified model that can handle speed optimization, chartering costs, bunker planning, and hull cleaning. The model is solved by column generation, where the columns represent the possible routes of a vessel, while the master problem keeps track of the binding constraints. The pricing problem is solved efficiently using a time–space graph and several dominance rules. Real-life instances with up to 40 vessels, 35 geographic regions, and four months planning horizon can be solved to optimality in less than half an hour. The optimized routes increase earnings by 7% compared to historical schedules. Furthermore, policy-makers can use the model as a simulation of a rational agent behavior.
This paper presents a literature survey on the fleet size and mix problem in maritime transportation. Fluctuations in the shipping market and frequent mismatches between fleet capacities and demands highlight the relevance of the problem and call for more accurate decision support. After analyzing the available scientific literature on the problem and its variants and extensions, we summarize the state of the art and highlight the main contributions of past research. Furthermore, by identifying important real life aspects of the problem which past research has failed to capture, we uncover the main areas where more research will be needed.
In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a set of ships simultaneously in multiple ports while also considering the sailing speed of ships between ports. Due to the highly combinatorial character of the problem, exact methods struggle to scale to large-size instances, which points to exploring heuristic methods. We present a mixed-integer problem formulation for the MCBAP and introduce an adaptive large neighborhood search (ALNS) algorithm enhanced with a local search procedure to solve it. The computational results highlight the method's suitability for larger instances by providing high-quality solutions in short computational times. Practical insights indicate that the carriers’ and terminal operators’ operational costs are impacted in different ways by fuel prices, external ships at port, and the modeling of a continuous quay.
The International Maritime Organization (IMO) has recently adopted short-term measures introducing technical standards for existing ships and a labeling system reflecting their operational carbon intensity. This paper investigates the relevant techno-economic implications from a shipowner's perspective and estimates the effect of six compliance options on six sample containerships. The study applies a new evidence-based bottom-up approach, and the results show that compliance, when possible, is not straightforward and costly. Engine power limitation is the most cost-effective option, but low power limits can lead to substantially increased sailing times (up to 793.92 h/year), which can be prohibitive. The option favors older ships with oversized engines as its effectiveness is mainly determined by the main engine load profile. In general, the effectiveness of the measures is not without limits, particularly concerning older ships and those that have already installed several options. Solutions such as market-based measures and alternative fuels, classed by IMO as medium- and long-term measures, must be considered soon.
The International Maritime Organization (IMO) has recently adopted short-term measures introducing technical standards for existing ships and a labeling system reflecting their operational carbon intensity. This paper investigates the relevant techno-economic implications from a shipowner's perspective and estimates the effect of six compliance options on six sample containerships. The study applies a new evidence-based bottom-up approach, and the results show that compliance, when possible, is not straightforward and costly. Engine power limitation is the most cost-effective option, but low power limits can lead to substantially increased sailing times (up to 793.92 h/year), which can be prohibitive. The option favors older ships with oversized engines as its effectiveness is mainly determined by the main engine load profile. In general, the effectiveness of the measures is not without limits, particularly concerning older ships and those that have already installed several options. Solutions such as market-based measures and alternative fuels, classed by IMO as medium- and long-term measures, must be considered soon.