The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.
This review article presents a summary of the main categories of models developed for modeling cavitation, a multiphase phenomenon in which a fluid locally experiences phase change due to a drop in ambient pressure. The most common approaches to modeling cavitation along with the most common modifications to said approaches due to other effects of cavitating flows are identified and categorized. The application of said categorization is demonstrated through an analysis of selected cavitation models. For each of the models presented, the various assumptions and simplifications made by the authors of the model are discussed, and applications of the model to simulating various aspects of cavitating flow are also presented. The result of the analysis is demonstrated via a visualization of the categorizations of the highlighted models. Using the preceding discussion of the various cavitation models presented, the review concludes with an outlook toward future improvements in the modeling of cavitation.
In this study, the periodic train timetabling problem is formulated using a time-space graph formulation that exploits the properties of a symmetric timetable. Three solution methods are proposed and compared where solutions are built by what we define as a dive-and-cut-and-price procedure. An LP relaxed version of the problem with a subset of constraints is solved using column generation where each column corresponds to the train paths of a line. Violated constraints are added by separation and a heuristic process is applied to help to find integer solutions. The passenger travel time is computed based on a solution timetable and Benders’ optimality cuts are generated allowing the method to integrate the routing of the passengers. We propose two large neighborhood search methods where the solution is iteratively destroyed and repaired into a new one and one random iterative method. The problem is tested on the morning rush hour period of the Regional and InterCity train network of Zealand, Denmark. The solution approaches show robust performance in a variety of scenarios, being able to find good quality solutions in terms of travel time and path length relatively fast. The inclusion of the proposed Benders’ cuts provide stronger relaxations to the problem. In addition, the graph formulation covers different real-life constraints and has the potential to easily be extended to accommodate more constraints.
The utilization of green energy resources for supplying energy to ships in the marine industry has received increasing attention during the last years, where different green resource combinations and control strategies have been used. This article considers a ferry ship supplied by fuel cells (FCs) and batteries as the main sources of ship's power. Based on the designers' and owners' preferences, different scenarios can be considered for managing the operation of the FCs and batteries in all-electric marine power systems. In this article, while considering different constraints of the system, six operating scenarios for the set of FCs and batteries are proposed. Impacts of each proposed scenario on the optimal daily scheduling of FCs and batteries and operation costs of the ship are calculated using a mixed-integer nonlinear programming model. Model predictive control (MPC) is also applied to consider the deviations from hourly forecast demand. Moreover, since the efficiency of FCs varies for different output powers, the impacts of applying a linear model for FCs' efficiency are compared with the proposed nonlinear model and its related deviations from the optimal operation of the ship are investigated. The proposed model is solved by GAMS software using actual system data and the simulation results are discussed. Finally, detailed real-time hardware-in-the-loop (HiL) simulation outcomes and comparative analysis are presented to confirm the adaptation capability of the proposed strategy.
The approach documented in this paper employs system identification (SI), or data-based modelling, techniques as an alternative to model determination from first principles for modelling a vented oscillating water column wave energy converter, using real wave tank data gathered at Danmarks Tekniske Universitet. In SI, the parameters of the model are obtained from the experimental input/output data by minimizing a cost function, related to model fidelity. The main advantage of SI is its simplicity, as well as its potential validity range, where the dynamic model is valid over the full range for which the identification data was recorded. Furthermore, SI models are somewhat flexible, since they can be solely based on data (black-box models), or else can incorporate some physics-based information (grey-box models). However, a suitable excitation signal is of primary importance for the parametric model to be representative over a wide range of operating conditions.
In transportation of goods in large container ships, shipping industries need to minimize the time spent at ports to load/unload containers. An optimal stowage of containers on board minimizes unnecessary unloading/reloading movements, while satisfying many operational constraints. We address the basic container stowage planning problem (CSPP). Different heuristics and formulations have been proposed for the CSPP, but finding an optimal stowage plan remains an open problem even for small-sized instances. We introduce a novel formulation that decomposes CSPPs into two sets of decision variables: the first defining how single container stacks evolve over time and the second modeling port-dependent constraints. Its linear relaxation is solved through stabilized column generation and with different heuristic and exact pricing algorithms. The lower bound achieved is then used to find an optimal stowage plan by solving a mixed-integer programming model. The proposed solution method outperforms the methods from the literature and can solve to optimality instances with up to 10 ports and 5,000 containers in a few minutes of computing time.
Havebrugsindustrien i nordiske lande er meget afhængig af drivhussystemer på grund af begrænsningen af det naturlige miljø og de strenge plantekrav for bestemte plantetyper. Kommercielle avlere i disse regioner støder på betydelige udfordringer med at garantere kvaliteten af planterne, mens de minimerer produktionsomkostningerne. På den ene side skal et drivhussystem forbruge en stor mængde energi for at give et tilfredsstillende klima for plantevækst. På den anden side, i de senere år, har energiprisen stigende i Europa ført til en stigning i produktionsomkostningerne for drivhuse, hvilket gør energibesparelse og optimering imperativ. Det er dog udfordrende for avlere at håndtere dette dilemma, fordi drivhusklimakontrol er et meget dynamisk og meget koblet komplekst system. Ved at analysere funktionerne i ikke-linearitet og dynamik i drivhusklimaet kan de eksisterende løsninger ikke korrekt opfylde de praktiske krav i gartneriindustrien.
For at tackle disse problemer foreslås en digital tvilling af drivhusklimakontrol (DT-GCC) rammer i denne forskning for at optimere aktuatorens driftsplan til minimering af energiforbrug og produktionsomkostninger uden at gå på kompromis med produktionskvaliteten. Arkitekturen i DT-GCC-rammen og de anvendte metoder er uddybet modulært, herunder fysisk tvilling af drivhusklimakontrol (PT-GCC) systemforståelse, design af DT-GCC-system, sammenkobling af DTGCC og PT-GCC og integration med andre digitale tvillinger (DTS).
DT-GCC omfatter en virtuel drivhus (VGH) og en multi-objektiv optimeringsbaseret klimakontrol (MOOCC) platform. VGH er den digitale repræsentation af det fysiske drivhus gennem modellering af de faktorer, der kan påvirke drivhusklimaet markant og aktuatorens driftsstrategier. MOOCC er ansvarlig for at definere drivhusklimakontrol som et multi-objektivt optimeringsproblem (MOO) og optimere driftsplanen for kunstigt lys (lysplan) og varmesystem (varmeplan). Desuden er en hierarkisk struktur af DT-GCC designet i henhold til funktionerne og ansvaret for individuelle lag, der gavner den praktiske realisering af DT-GCC med en organiseret arkitektur af design og styring.
Funktionaliteterne i DT-GCC er udviklet i en drivhusklimakontrolplatform, der er navngivet af Dynalight, som er kombineret med en genetisk algoritme (GA) ramme kaldet Controleum. Dynalight definerer et MOO -problem til at abstrahere drivhusklimakontrolsystemet med flere objektive funktioner, og omkostningerne beregnes baseret på modelleringsresultaterne fra VGH. Controleum er ansvarlig for implementeringen af GA for at generere en Pareto Frontier (PF) og endelig løsning af løsning til let plan og varmeplan.
Forskellige scenarier og tilsvarende eksperimenter er designet til at evaluere ydelsen af DT-GCC fra individuelle perspektiver, herunder VGH, MOOCC og DT-integration. Eksperimenterne på VGH verificerer forudsigelsesydelsen for kunstigt neuralt netværk (ANN) metoder på indendørs temperatur, opvarmning af forbrug og netto fotosyntese (PN). Hvad angår de to standaloneeksperimenter, garanterer resultaterne DT-GCCs evne til at kortlægge avlernes beslutningstagning om let plan og varmeplan og verificere MOOCC-ydelsen for at opfylde voksende krav og samtidig reducere energiforbruget og omkostningerne. Endelig, i DT-integrationseksperimenterne med Digital Twin of Production Twin (DT-PF) og Digital Twin of Energy System (DT-ES), afslutter DT-GCC det tilsvarende svar på forudsigelser og optimeringsanmodninger.
Having a well-designed liner shipping network is paramount to ensure competitive freight rates, adequate capacity on trade-lanes, and reasonable transportation times. The most successful algorithms for liner shipping network design make use of a two-phase approach, where they first design the routes of the vessels, and then flow the containers through the network in order to calculate how many of the customers’ demands can be satisfied, and what the imposed operational costs are. In this article, we reverse the approach by first flowing the containers through a relaxed network, and then design routes to match this flow. This gives a better initial solution than starting from scratch, and the relaxed network reflects the ideas behind a physical internet of having a distributed multi-segment intermodal transport. Next, the initial solution is improved by use of a variable neighborhood search method, where six different operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity flow problem to route the containers through the network, the flow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange heuristic for flowing containers is 2–5% from the optimal solution, the solution quality is sufficiently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to find improved solutions for large-scale instances from LINER-LIB, and it is the first heuristic to report results for the biggest WorldLarge instance.
In order to enhance sustainability in maritime shipping, shipping companies spend good efforts in improving the operational energy efficiency of existing ships. Accurate fuel consumption prediction model is a prerequisite of such operational improvements. Existing grey-box models (GBMs) are found with significant performance potential for ship fuel consumption prediction, although having a limitation of separating weather directions. Aiming to overcome this limitation, we propose a novel genetic algorithm-based GBM (GA-based GBM), where ship fuel consumption is modelled in a procedure based on basic principles of ship propulsion and the unknown parameters in this model are estimated with a GA-based procedure. Real ship operation data from a crude oil tanker over a 7-year sailing period are used to demonstrate the accuracy and reliability of the proposed model. To highlight the contribution of this work, we compare the proposed model against the latest GBM. The results show that the fitting performance of the proposed model is remarkably better, especially for oblique weather directions. The proposed model can be employed as a basis of ship energy efficiency management programs to reduce fuel consumption and greenhouse gas (GHG) emissions of a ship. This is beneficial to achieve the goal of sustainable shipping.
Linear potential flow (LPF) models remain the tools-of-the-trade in marine and ocean engineering despite their well-known assumptions of small amplitude waves and motions. As of now, nonlinear simulation tools are still too computationally demanding to be used in the entire design loop, especially when it comes to the evaluation of numerous irregular sea states. In this paper we aim to enhance the performance of the LPF models by introducing a hybrid LPF-ML (machine learning) approach, based on identification of nonlinear force corrections. The corrections are defined as the difference in hydrodynamic force (viscous and pressure-based) between high-fidelity CFD and LPF models. Using prescribed chirp motions with different amplitudes, we train a long short-term memory (LSTM) network to predict the corrections. The LSTM network is then linked to the MoodyMarine LPF model to provide the nonlinear correction force at every time-step, based on the dynamic state of the body and the corresponding forces from the LPF model. The method is illustrated for the case of a heaving sphere in decay, regular and irregular waves – including passive control. The hybrid LPF model is shown to give significant improvements compared to the baseline LPF model, even though the training is quite generic.