Abstract
The research examines the optimization of fleet management of a shipping company through control algorithms, as finding an algorithm that will reduce a marine company’s exposure to risk by diversifying its fleet composition is one way to make it dominant. The study focused on three companies that, in 2014, invested US$$1 billion in a fleet of tankers, using three different techniques to optimize their fleet composition: equal number of ships of all types, the established risk minimization model and the proposed Risky Asset Pricing maximization model. Seven years of data was used for the synthesis and 4 years of data was used for the evaluation. The research findings show that classic portfolio management through risk minimization is ineffective, as it appears to reduce performance below what is a random or evenly distributed fleet. Comparing the three methods, the superiority of the Risky Asset Pricing model is clear. This algorithm looks for solutions where the demand for ships is low but has enormous fluctuation potential and seeks to identify ships that are at high risk with great potential for price increases to maximize investor returns. The value of the research lies in the identification of methods to optimize capital distribution and composition of a shipping company fleet, which presents valuable insights for the benefit of scholars and maritime companies. Moreover, and contrary to extant works that focus on Markowitz’s theory, this article instead describes how evolutionary algorithms can be used to optimize fleet management.
Introduction
Maritime cycles are divided into three general categories based on their periodicity: short-term shipping cycles, long-term shipping cycles and seasonal shipping cycles. Short-term shipping cycles are influenced by daily and short-term events but could nevertheless be said to have periodicity. The periodicity is not constant, but there are certain phases, and each cycle goes through all phases. Short-term shipping cycles are immediately visible and cannot be predicted, as their duration has been observed to range from 3 to 18 years (Stopford, 2009). Long maritime cycles, although they have little influence on the decisions of a shipowner, have an average life span of approximately 50 years (Rodrigue et al., 1997). Seasonal shipping cycles are very short in duration and are mainly influenced by the normal fluctuations in the marine goods offered. In this research a maritime cycle will be referred to in the short term, except when explicitly stated otherwise.
There is a direct correlation between maritime risk and maritime cycles. Every time the freight offered increases, it creates a high demand for ship availability. Because shipowners are unable to respond immediately to this requirement as a ship’s order takes more than a year to complete, an imbalance in the system happens so that cargo holders (charterers) pay more to serve. Shipowners, seeing a freight increase, understand that there is more demand and try to increase their fleet, but they cannot predict what the demand will be in 2 years when the new ships will be delivered. Also, the international performance of companies is influenced directly and indirectly by other factors such as institutional drivers (Torkkeli et al., 2019). One of the major goals of many institutional bodies, which deal with marine regulations, is the reduction of the total number of accidents (Lois et al., 2004).
The main method of managing the risk used in shipping is to divide the fleet into different markets with the main focus being to share the risk with the freighters. This happens when the shipowner decides to move to the time charter market to lease his/her ships at a projected fare price. However, shipowners do not wish to co-manage the risk with the charterers, let alone move the spots.
In the present research beyond this strategy, we will study the relevant factors that influence a shipowner’s decisions on the fleet’s composition to try to find an algorithm that does not manage the risk in the spot market by diversifying its fleet.
The Theoretical Foundations of Evolutionary Algorithms
Algorithms are used for marine surface vessels, such as a deterministic path planning algorithm that computes a practical and COLREGS-compliant navigation path to prevent vessels from being on a collision course (Tam & Bucknall, 2013). The algorithm was evaluated with a set of test cases, simulating various traffic scenarios. Different aspects of the algorithm were examined, such as the output consistency from different perspectives, practicality of the navigation path, and computational performance.
Evolutionary algorithms are used in neuroevolution for marine navigation. In neuroevolution, units are treated as individuals in a population of artificial neural networks, which, through environmental sensing and evolutionary algorithms, learn to perform given task efficiently (Lacki, 2016). The main task of the system is to learn continuously from environmental influences and to predict the values of navigational parameters of the vessel, after a certain amount of time. The result of a prediction may occur as a warning to a navigator about an incoming threat. Evolutionary algorithms have been used to search for an optimal set of safe trajectories for all the ships involved in an encounter (Szlapczynski, 2013). The methodology was originally designed for open waters or restricted waters when only the standard Convention on the International Regulations for Preventing Collisions at Sea rules apply. The methodology has been designed for possible application in Vessel Traffic Service centers. The examples included are the results of the computer simulation tests carried out for the Gulf of Gdansk TSS to illustrate the methodology’s effectiveness and functional scope.
Zacharioudakis et al. (2011) formulated the mathematical model of the cycle cost for the liner shipping company and attempted to optimize the operational profile of company assets in regards to a specific network of routes of cargo flows and vessel portfolios. In other words, it attempted to give a practical solution to deployment problem of the modern shipping company fleet. This was achieved by developing a generic cost model methodology that aims to minimize total operating costs by using genetic algorithms to optimize various predefined attributes such as operational speed. The finalized model could be applicable to liner shipping companies for optimizing liner networks, as well as for simulating and examining possible scenarios and what-if analyses. Also examined was an optimization model to define the technical and operative features of fleets, which maximizes the opportunities for success, in terms of cost and time, for multimodal chains against the road (Martinez-Lopez et al., 2015). This model regards the relationships among technical alternatives for fleets, vessels, port facilities, and cargo units and their influence on the activity of “many to many” transport networks through short sea shipping. A multi-objective evolutionary algorithm, the NSGA-II, has been applied to resolve this model as applied to multimodal chains between Spain and France through the Atlantic coast. Its application allows the verification of the utility of the proposed model. Finally, the most suitable fleets for the sea motorways Vigo-St. Nazaire and Gijón-St. Nazaire have been identified.
A genetic algorithm, coupled with a greedy heuristic and later with a block-based evolutionary algorithm, was also used to examine an integrated problem of optimizing the operations at a commercial bulk material port terminal (Pratap et al., 2016). They simultaneously optimized the stockyard operations and rake schedule for outbound cargo, in conjunction with the arriving vessels and the status of the stockyards at the port. The study resulted in a significant reduction of turnaround time for rakes at the port terminal, which in turn led to monetary savings. The model also automated the day-to-day operational decision-making at the port. Evolutionary algorithms and especially multi-objective evolutionary algorithms have been used to examine two conflicting objectives: total delay and total financial loss. Liner shipping is vulnerable to many disruptive factors such as port congestion or harsh weather, which could result in delays in arriving at ports, and in both financial and reputation losses. The vessel schedule recovery problem (VSRP) is concerned with different possible actions to reduce the effect of disruption, such as a strategy in VSRP which is called the speed-based vessel schedule recovery problem (S-VSRP). Pratap et al. (2016) evaluated the problem in three scenarios (i.e., scalability analysis, vessel steaming policies, and voyage distance analysis) and statistically validated their performance significance. According to experiments, the problem complexity varies in different scenarios. Liner shipping companies use multi-objective evolutionary algorithms in maritime logistics collaboration in the joint-routing network design. The model is called the ship routing problem and two objectives that are minimized are total cost and deviation in fair cost proportion. The method combines NSGA-II and the principles of effective genetic algorithms found in the literature, and an example of the application with data background was from the Indonesian archipelago. The application of evolutionary algorithms and polynomial interpolation is also used in the ship evolutionary trajectory planning method and its comparison to classic approach, where trajectory is modeled by straight lines. Evolutionary algorithms are groups of methods that allow the computation of a collision-free trajectory in real time, while polynomial interpolation models a smooth trajectory, which keeps continuity of velocity and acceleration values along a path in opposition to straight lines approach.
Fleet Composition Optimization Methods
In modern portfolio theory, models based on Markowitz’s theory (1952, 1959) have prevailed. These models are based on the assumption that the optimal portfolio is the one that maximizes profit for a given risk or minimizes the risk for a given profit. Using Markowitz’s theory to optimize the composition of a fleet, we apply the MV-Model, below, but in the reverse and consistent with the Risky Asset Pricing model (Equations [1]–[3]):
In this model, inputs are the risky returns and fluctuations of the fleet, and the outputs are the weights, which represent the percentage of total amount invested, corresponding to each type of ship. All solutions to an MV problem form the MV Efficiency Frontier. But there are restrictions to find the best fleet since a shipping company wishes to invest a certain amount with little divergence.
where qi is the number of ships of type I, and vj is the value of this ship type.
In their research, Lin et al. (2001) developed an evolutionary algorithm based on NSGA-II and GENOCOP techniques to solve restriction problems. The criteria for solving the problem were fixed transaction costs and minimum lot costs. The genes of each individual in the population expressed their weight in multiples of lots, and the coding was intact. SBX techniques for crossing and PM for mutation were used to initialize the population. The method showed that it was possible to find solutions and that it was also an NP-difficult problem that did not significantly increase the complexity of the calculation.
Fieldsend et al. (2004) focused on combining optimization with the MV-model. They added a third objective function that evaluated the number of securities structured by prospective. In this problem, the solutions were represented by weights on the total amount invested. In order to evaluate the optimal portfolio with one factor, taking into account the number of shares for its suitability, all combinations of number of securities should be evaluated with the MV-model. This added great computational complexity to the problem. In their work, they suggested that the evaluation of the two objective functions of the MV-model be carried out in parallel with the third criterion of minimizing participation. In particular, the algorithm they proposed is for each board to use information about the best weights on all fronts at the same time. The algorithm generates an n-set of k candidate portfolios, where k is the number of entries and n is the range of all possible k. In each generation the algorithm chooses one set at random and one individual from that set. Then with a 50% probability of either changing only the weights using the Dirichlet method or changing +/− the number of securities. Then it compares the new portfolio with the rest of the same set of crowd, and if not dominated, it adds and subtracts the dominant ones.
Streichert et al. in 2004 used the Markowitz model in combination with limitations on the number of entries, but also set the limit for the minimum amount of participation to avoid few investments in large amounts, trying to minimize transaction costs. Two variables were used for coding the solutions for each gene: one for the actual numbers to encode the weights and one for the binary coding variable indicating whether or not the securities were included in the portfolio. For the evolution cycle, the algorithm uses the NSGA technique. Due to the strong limitations of this technique, the evaluation of the objective functions is done in such a way that those individuals who violate the first criteria of the algorithm are rejected. At the beginning they are evaluated for the number of shares and for the minimum amount of participation. If they do not meet the second criterion then the weights are reset before moving to the third function that will evaluate the minimum lot size. Other methods for portfolio optimization using evolutionary algorithms are those developed by Subbu et al. (2005), Tsao and Liu (2006), and Branke et al. (2009), which search for an optimal portfolio with other constraints such as Rule 5-10-40 applicable to German Law and the Mean Value at Risk-Model as proposed by J. P. Morgan.
Research continues to find effective MOEA (multi-objective evolutionary algorithms) methods to solve the problem. Lin and Liu (2008) attempted to integrate the MV-model with the least-lot constraint and created three different models. In the first model, they created an objective function based on a demand performance and limited to integer solutions, attempting to minimize portfolio risk. But it did not appear to perform well due to the limitation of integer solutions. The second model used the technique of measuring the deviation of the tested portfolio from a target portfolio. By minimizing this distance, the optimal portfolio was detected in the search area. The third model used fuzzy logic programming. The coding of the solutions was done by converting the investment amounts into integers with the appropriate technique and the yield was applied as a penalty technique. In the end, the most efficient technique was measured to be that of vague logic.
Aranha and Iba (2007) used their single objective function algorithm to set the goal of continuous optimization of a structured portfolio with a view to minimize transaction costs. They did this by adding expected returns and subtracting the cost of risk. The Euclidean distance of weights from period t-1 to period t was used to measure costs. For the coding of the population atoms each gene was designated with two variables. The first being binary and representing whether or not the securities were included in the portfolio and the second variable being real numbers and representing the weight of the securities. The classical methods of genetic algorithms were used for crossover and mutation, which added the ability to copy material from the previous period to the next and the choice of objective function between Euclidean distance and Sharpe’s measure randomly in each generation. This technique, after evaluating it, appeared to perform well, finding optimal portfolios using the NASDAQ indices but did not perform well with the NIKKEI indices.
Design and Development of a Fleet Optimization System
In applying evolutionary algorithms to the composition of a fleet, the most important thing to determine is the objective function that will evaluate its efficiency and judge the suitability of a fleet’s reconstruction at a given time. The simplest model for generating an objective function is the simple Markowitz’s theoretical model where the objective function evaluates the efficiency of the portfolio structure, which is reversed to be compatible with the Risky Asset Pricing model through a single maximization function. This function evaluates the divergence of the fleet and gives us the maximum divergence portfolio:
where
is an N-dimensional vector, with N as the number of ships that build the fleet:
Through the simplest model we find the portfolio of maximum risk and on that basis we begin to build our objective function, introducing the constraints we want in this specific implementation. To the implementation, we will apply an objective function of third factors:
where f1 = evaluation function of fleet diversification
f2 = risk assessment function of the fleet
f3 = function of evaluating the present value of the fleet in relation to the same number of ships at the historically lowest market price
In order to be able to integrate the objective function factors to calculate a specific value, we introduce the concept of net return as follows:
where Q is the number of each ship, and V is the value of each ship.
To determine the differentiation of the fleet, we introduce the notion of the total number of ships and the minimum total value. In this way, we lead the algorithm to the preference of choosing many types of ships over a few expensive ones with the possibility of being trapped in a local extreme in the area of possible solutions.
where t is the time base of the fleet study.
To determine the cost of the fleet risk, we use historical data to find the variance of each ship type. The function that evaluates the combination is as follows:
where f2 determines the expected losses over time t.
In our study, we are trying to predict different criteria, where each type of ship is in the current shipping market so that we can make a decision on whether to buy or sell ships (Beenstock, 1985). With the rise of the others, due to the increase in orders, the prices of ships of each category are going up. So, the price increase of a ship in relation to the maximum fluctuation it may have historically contains all the information about where the market is located. Buying a ship whose price is at a historically high level indicates that it will soon decline and offers no opportunities. On the contrary, the price at a historically low level indicates that this type of ship has high opportunities. To evaluate the present value of the fleet, we find the historically lowest price and the historically highest price for each type of ship in the last 15 years. We then find the over price ratio as follows:
Over price ratio = (Current value – Historical minimum value)/(Historical maximum value – Historical minimum value)
Then the function that evaluates the combination is as follows:
where op is the over price ratio of each ship.
λ a factor determining the influence of the over price ratio on the selection of the optimal fleet composition.
Then, the objective function evaluation of the fleet performance takes the following form:
Clarkson Research data (2019) as published in Shipping Intelligence Weekly Report (2019) were used to evaluate the proposed evolutionary algorithm. The data selected are as follows:
Value of new ship per year Five-year ship purchase value Ten-year ship purchase value Gross revenue per day on the spot market
2014–2017 Tanker Market Price and Average Gross Revenue per Type.
2007–2013 Tanker Market Price and Average Gross Revenue per Type.
Evaluation of Historical Ship Performance
For the composition of the fleet, the performance of each ship was first evaluated as follows:
where “Value” is the value of the particular ship at time t, “Earnings” is the annual fare of the particular ship at time t, and prices are in the millions of dollars.
MR, LR Clean, R Dirty, AFRAMAX, SUEZMAX, VLCC, Performance Analysis, and Evaluation for Years 2007–2017.
Fleet Covariance.
Fleet Composition and Assessment
The evaluation was made of three companies that chose to invest US$1 billion in 2014 in a fleet of tankers. The three companies optimized the fleet composition with three different techniques:
• An equal number of ships of all types • The established risk minimization model • The proposed Risky Asset Pricing maximization model
Equal Fleet Fitness Results.
Equal Fleet Composition.
Equal Fleet Annual Return and Gross Revenue.
Minimum Risk Fleet Results.
Minimum Risk Fleet Composition.
Minimum Risk Fleet Annual Return and Gross Revenue.
Maximum Risk Fleet Results.
Maximum Risk Fleet Composition.
Maximum Risk Fleet Annual Return and Gross Revenue.
Findings using the maximum risk from the Risky Asset Pricing model indicate that at the end of 2017 the total return is US$1,284.36 million since the creation of the fleet in 2014 (Tables 11–13).
Results and Discussion
This research examines the management and optimization of fleet management of a shipping company through the control algorithms. Finding an algorithm that will reduce a marine company’s exposure to risk by diversifying its fleet composition is one way to make it dominant. Classic portfolio management through risk minimization is clearly ineffective, as it seems to reduce performance below what is a random or evenly distributed fleet. By comparing three methods, it is clear that the Risky Asset Pricing model is superior, as it optimizes the fleet over the excess present value of ships with an effective 25% over an accidental fleet and 60% over the conventional minimum risk method. In essence, this algorithm looks for solutions where the demand for ships is low but has enormous fluctuation potential. It is basically looking to find ships that are at high risk with great potential for price increases to give the investor possible big returns on which the most successful players in shipping operate.
Portfolio management through risk minimization is ineffective as it appears to reduce performance. Finally, it is clear that using the expected performance to optimize a fleet is ineffective and offers nothing due to the large variation.
Results are important for investors and companies. In the present study, due to a lack of access to a large number of historical data, perhaps data may be within the same shipping cycle. In order to draw safer conclusions, in future research, the composition should be at least 17 years old with current prices at present value.
Also, optimization should be done again for a time period at least 17 years so that a company has experienced at least one full shipping cycle. In such a model, the fleet should also be reorganized at regular intervals.
Footnotes
Declaration of Conflicting Interests
The authors declared no potential conflicts of interest with respect to the research, authorship and/or publication of this article.
Funding
The authors received no financial support for the research, authorship and/or publication of this article.
