Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2020 / Article

Research Article | Open Access

Volume 2020 |Article ID 3528026 | https://doi.org/10.1155/2020/3528026

Yisong Lin, Xuefeng Wang, Jian Gang Jin, "Yield Management by Reconstruction of Cargo Contribution for Container Shipping", Mathematical Problems in Engineering, vol. 2020, Article ID 3528026, 12 pages, 2020. https://doi.org/10.1155/2020/3528026

Yield Management by Reconstruction of Cargo Contribution for Container Shipping

Academic Editor: Frederic Kratz
Received03 Apr 2020
Revised15 May 2020
Accepted21 May 2020
Published16 Jun 2020

Abstract

This study provides a cargo contribution yield management model to solve the ship capacity control problem for the container liner shipping industry. We propose a new objective to optimize cargo contribution to replace the focus on total revenue or average revenue in the current research. We reflect the special characteristics of yield management in container liner shipping, and all cost items were identified and calculated to develop a new cargo contribution evaluating system. We propose a mathematical model for service route segments’ allocation distribution based on cargo contribution. We use a genetic algorithm to solve the model further with comparative analysis with actual practice. The study cultivates new ground in the current literature with a wide range of innovative applications at a practical level.

1. Introduction

Yield management (YM), alternatively known as revenue management (RM) is a practice that originated in the airline industry in the 1970s following the deregulation of the US airline market. The practice has been successfully applied to airlines, hotel management, and retail management. However, the research on YM for container liner shipping service is scant. There are few articles published in the last 50 years after filtering out irrelevant studies, and the unique features and usability of models developed for air transport remain unclear [1]. The main characteristics of YM application noted by Hellermann include perishability, fixed capacities, high fixed costs versus low marginal costs, stochastic demand, advance bookings, demand segmentation, and the possibility of collecting historical data [2]. The conformity of YM in container liner shipping was well presented in the previous research by Ting and Tzeng; however, when addressing YM in container liner shipping, the distinct characteristics should not be neglected, and the objectives, constraints, and models should be adjusted accordingly [3]. The YM for container shipping differs from revenue management for airline passengers. Most airline passengers travel on return itineraries, so that passenger flow balance comes naturally. In contrast, a typical container shipment travels only one way, and there is significant imbalance in container shipments. That necessitates empty container repositioning, a problem that is not encountered in airline passenger transportation. In addition, in container shipping, a large fraction of containers are shipped under the terms of long-term contracts between carriers and shippers. Therefore, in the different booking orders, the price of some orders has been locked, while some others depend on the spot market. In contrast, most airline tickets for passengers are bought on the spot market, and the prices can change at any time. Weatherford and Bodily presented a whole picture of the basic structure of YM research and found that the objectives were focused on maximizing profit, maximizing capacity utilization, maximizing average revenue, maximizing total revenue, maximizing net present value, minimizing lo st customer goodwill, and extracting each customer’s maximum price [4]. The related costs associated with revenue have been neither systematically defined nor fully reflected in decision-making objectives. The cargo contribution related to the balance area or imbalance area also has not been well reflected. Gordon et al. analysed the weakness of the existing revenue measure and concluded that factors such as cost, utilization, the demand related to a change in service price, and seasonality should be incorporated; however, the proposed new yield optimization measure still focuses on the increase in revenue per capacity unit [5].

Meng et al. presented a summary of the YM problem for container liner shipping services and concluded that the YM problem is composed of ship capacity control and pricing for shipping services. This paper proposes an optimization model based on cargo contribution evaluation (here, we define the difference between cargo revenue and the apportioned cost calculated by cost logic as cargo contribution). The model maximizes the overall cargo contribution instead of total revenue, profit, or capacity utilization in the previous research studies.

The contribution of this study is threefold. First, the study reflects the special characteristics of YM in container liner shipping and proposes a new optimization model to solve the YM ship capacity control problem. The new research idea is based on the reconstruction of cargo contributions, which reflects both cargo revenue and cost. The cost-apportioned logic is established by the business process of the participative observation, which solves the problem of dealing with evaluating of empty container repositioning fee. Second, the study analyzes the complete shipping cycle and identifies all the cost items associated with container shipping and formulates an optimization problem of allocating container slots. The new idea based on cargo contribution evaluation provides a new direction for future research. Third, the optimization model reflects not only the contribution difference between long-term customer and spot market customers but also the difference caused by quantity discount, cargo flow direction, and cargo category. This has significant practical contribution through case study verification.

The remainder of the paper is organized as follows: Section 2 presents a literature review and analyzes the gap in the research that this study fills. Section 3 discusses the capacity control problem. Section 4 formulates a slot allocation model through mathematical programming. Section 5 provides a case study with a genetic algorithm (GA) solution. Section 6 presents the conclusion.

2. Literature Review

Yield management (YM) is a practice that originated in the airline industry; therefore, the earlier studies were focused on demand forecasting, overbooking control, dynamic pricing, and seat allocation in the airline industry. Littlewood, Lee and Hersh, and McGill studied the demand forecasting problem [68]. Weatherford and Bodily, Robinson, Belobaba and Farkas, Chatwin, and Liang studied the overbooking of airline passenger revenue management [4, 912]. Feng and Gallego, Feng and Xiao, and Gallego and Van Ryzin studied on dynamic pricing in air passenger transport [1315]. Glover et al., Belobaba, Curry, and Brumelle studied on seat allocation in the airline industry [1619]. The research extended to railway transportation, hotel management, and car rental management accompanied by in-depth study and significant achievements in the application in the airline industry.

The research of yield management in container shipping began in the 1990s. Brooks and Button analysed the pricing structure and proposed a potential application of yield management in container shipping [20]. Ha studied the allocation and pricing problem in container shipping and proposed a possible yield management solution [21]. Maragos proposed an allocation management and pricing model [22]. Subsequently, the research on yield management in container shipping increased but is still very limited in general. Meng et al. presented a critical review of RM for container liner shipping services. The authors concluded that the RM problem is composed of ship capacity control and pricing for shipping services. However, there are few articles after filtering out irrelevant studies. The following gaps were found by their research: some of the characteristics of containerized cargo are not fully considered; constraints such as the number of refrigerated container slots are not considered; and the differing behaviours of spot markets and long-term markets are not reflected. The future research directions proposed focus on demand forecasting, customer behaviour modelling, dynamic capacity control, and dynamic pricing determination. We present the main literature in container shipping as shown in Table 1.


Literature reportsYM problemsMain contributionLimitation

Brooks and ButtonDynamic pricing strategyAnalyzed the pricing structure and proposed a potential application of yield management in container shippingProposed an overall application suggestion, without clear solution
HaAllocation control and pricingProposed an allocation control and pricing modelEvaluated revenue while cost was ignored, and the special characteristics of shipping were not reflected
MaragosAllocation control and pricingProposed an allocation control and pricing modelEvaluated revenue while cost was ignored, and the special characteristics of shipping were not reflected
Ting and TzengAllocation managementProposed a conceptual model for liner shipping revenue management (LSRM) and recognized the special characteristics of empty container reposition of YM for container shippingThe empty container reposition fee, which is a variable cost, was calculated repeatedly in the objective function while cargo costs, transportation costs, equipment costs, vessel costs, and fuel cost were not reflected
Gordon et al.Allocation managementAnalyzed the weakness of the existing revenue measure and concluded that factors such as cost and utilization should be incorporatedThe proposed new yield optimization measure still focuses on the increase in revenue per capacity unit
Zurheide and Fischer [23]Allocation managementProposed a slot allocation model to maximize expected profits through booking limits to different demand segmentsThe empty container reposition cost, container leasing, and storage costs were reflected in the slot allocation without distribution in the whole service network
Zurheide and Fischer [24]Booking order controlPresented a booking limit strategy, nested booking limit strategy, and bid-price strategy based on the booking class defined by combined segmentationThe slot allocation model was evaluated by the average price and average cost without considering cost logic
Wang et al. [25]Seasonal revenue problemProposed multitype container selection, routing, assignment, and sailing speed in each shipping leg of the service networkThe model focused on maximizing seasonal profit; however, only operating cost was evaluated without considering cost logic.
Feng and Chang [26]Allocation managementOptimized the space allocation model so that the same model is applicable to the complex port-to-port slot distribution networks of Asian portCosts were not fully evaluated and empty container reposition cost was simply apportioned in the network without considering cost logic
Lee et al. [27]Allocation managementProposed control model for allocation distribution and recognized the special characteristics of empty container reposition of YM for container shippingCosts were not fully evaluated and empty container reposition cost was simply apportioned in the network without considering cost logic
Lu and Mu [28]Slot reallocation planningProposed an allocation control model under the circumstances of vessel delay and port operation restriction and recognized the special characteristics of empty container reposition of YM for container shippingAvailable only under specific circumstances, and empty container reposition cost was simply apportioned in the network without considering cost logic
Liu and Yang [29]Allocation management specially for sea-rail intermodal transportationProposed a two-stage slot control optimization mode to maximize expected revenueCosts were not clearly identified and calculated for cargo contribution analysis, and the YM objective was not well reflected in the objective function

Given the above, the existing literature already well reflected the constraints of the objectives, which include limitations on total capacity, vessel deadweight, and the number of plugs for reefers. The existing literature also addresses demand segmentation. The special characteristics of demand segmentation include the container types (e.g., dry or reefer), container sizes (e.g., 20 ft or 40 ft), and freight contracts (i.e., long-term or spot). Most of the current studies achieved consistency in this point. However, the objectives showed great differences in the study of ship capacity control in YM. We found the following limitation in the current research on the practice of container liner shipping. First, the definition of objective function is unreasonable. The objectives were mostly based on the optimization of average revenue or total revenue while the corresponding costs were not reflected. Second, the characteristics of yield management for container shipping which distinguish from other industry are not systematically identified. The ignorance of cost and its apportioned logic may cause deviation. The incomplete evaluation of related factors (such as quantity discount, cargo flow direction, and cargo category) may affect applicability in practice. Third, most of the existing literature focuses on the overall allocation strategy, but few research studies focus on service route segment allocation management (here, we define the path between different nodes in the service network as “service route segment”). This is what this paper intends to contribute to the current literature.

3. Problem Description

The container liner service route is composed of various loading ports and discharging ports on a weekly service frequency. Correspondingly, the service route can be divided into several different segments according to the loading port and discharging port. Taking a service route of AEU3 from COSCO Shipping Lines as an example, as shown in Figure 1, the service route consists of six calling ports in the Far East and four calling ports in Europe.

The service route can be divided into 24 westbound segments and 24 eastbound segments, as shown in Table 2.


Westbound segmentEastbound segment
Loading portDischarging portLoading portDischarging port

TianjinPiraeusPiraeusTianjin
RotterdamDalian
HamburgQingdao
AntwerpShanghai
DalianPiraeusNingbo
RotterdamSingapore
HamburgRotterdamTianjin
AntwerpDalian
QingdaoPiraeusQingdao
RotterdamShanghai
HamburgNingbo
AntwerpSingapore
ShanghaiPiraeusHamburgTianjin
RotterdamDalian
HamburgQingdao
AntwerpShanghai
NingboPiraeusNingbo
RotterdamSingapore
HamburgAntwerpTianjin
AntwerpDalian
SingaporePiraeusQingdao
RotterdamShanghai
HamburgNingbo
AntwerpSingapore

There is a trade imbalance between the westbound and eastbound segments. For example, in 2008, 17.7 million TEUs (twenty feet equivalent units) were transported from Asia to Europe, and only 10 million TEUs were transported from Europe to Asia (UNCTAD 2008) [30]. Therefore, the empty container reposition constitutes a special characteristic of YM for container shipping.

It is common practice to allocate slots to each loading port with relatively fixed numbers, and the local office on container liners is responsible for local slot control. The main advantage of this practice lies in clear responsibility and easy management; however, the weakness is prominent as dynamic allocation management cannot be applied to improve the cargo contribution. The cargo contribution shows substantial difference in each service route segment in terms of five aspects. First, the cargo flow (for example, port pair and destination) has a significant impact on the contribution by calculating the empty container reposition cost and the drop-off cost due to a significant difference in the surplus or shortage areas. Second, the cargo structure (for example, cargo owners or forwarders) has a significant impact on the contribution due to the different customer pricing policies. Third, the freight rate contract types (for example, long term or spot) have a significant influence on the contribution due to the rate difference between a long-term deal and the spot market. Neither long-term deals nor the spot rate is always at a low level, and both change dynamically with market fluctuations. Fourth, the proportion of overweight cargo and light cargo in different segments also has a significant influence on contribution. YM in the container liner shipping is restricted by both total capacity and vessel deadweight; the overweight cargo should be balanced with light cargo to improve utilization. Fifth, container liner’s strategy and product competitiveness (for example, delivery time, on-time performance, and uniqueness) lead to difference of pricing strategies, which have a substantial influence on cargo contribution. In short, the contribution difference in each service route segment allows the container liners to allocate the slot according to the cargo contribution evaluation to carry out YM management in the industry.

In addition, wide fluctuations and short freight rate floating cycles make YM necessary in container liner shipping. Figure 2 shows that since 2009, freight rate fluctuation has increased with shortened cycles. The traditional way to allocate the slot under the first come, first served (FCFS) principle seems to be out of pace as low contribution cargos account for the majority of loaded cargos in practice.

Therefore, we propose a new optimization model through cargo contribution evaluation. We identify all cost items associated with container shipping and formulate an optimization problem of allocating container slots. We present the cargo contribution YM model in Section 4.

4. CCYM Model

4.1. Reconstruction of Cargo Contribution

Figure 3 shows the complete shipping cycle that involves the empty container issue, the extraction of the empty containers from loading ports, the loading of containers at factories, the full containers entering ports, the discharging and delivery at the destination, and the repositioning of empty containers.

In many of these links, calculating the costs for the container liners is a complex process. Some costs are directly associated with shipments. These costs should be directly related to the shipments generating the costs. Some costs, however, must be apportioned in the service route network as these costs are generated as public investments by the container liners to provide network services and products. In addition, some costs must be distributed according to the operated zone (for example, the empty container reposition fee). This is because the imbalances both inbound and outbound are caused by the interaction of several different areas. Therefore, it is only reasonable to combine this area as an operated zone and apportion of the empty container reposition fee to the whole operated zone.

Following this logic, we identified 36 subdivision costs that can be classified into seven categories as shown in Table 3.


Cost categorySubdivision costCost calculating logic

Cargo costLoading and discharging costCalculated to corresponding shipments
Tally cost
Overtime cost
Receiving and delivery cost
Storage cost
On dock rail handling cost
Tonnage assessment fees
Gate in fees
Gate out fees
Reefer power and monitoring fees
Laden container agency fees
Depot costs

Transportation costTransportation cost by feederCalculated to the transportation shipments
Transportation cost by rail
Transportation cost by truck

Port costCanal feesApportioned by all shipments in the port pairs
Berthing cost
Tonnage dues
Tug and towage fees
Pilotage fees
Harbour dues
Escort boat fees
Vessel agency fees

Equipment variable costEmpty container reposition feesCalculated by the operated zone creating the imbalance
Empty container storage fees
Container agency fees

Equipment fixed costContainer rental feesApportioned in the service route network
Container maintenance and repair fees
Hanger container fees
Chassis and reposition fees
Demurrage and detention cost

Vessel costVessel construction costApportioned in the service route network
Vessel rental cost
Vessel maintenance cost

Fuel costFuel costCalculated by vessel and apportioned by all shipments in the vessel

4.2. Indices, Parameters, Sets, and Decision Variables
4.2.1. Indices, Parameters, and Sets

: the freight rate of customer in transport: the transportation cost for customer i: the port cost for customer : the equipment fixed cost occurring in the transport of customer : vessel cost: fuel costCMTX1: contribution ICMTX2: contribution IICMTX3: contribution IIICMTX4: contribution IV: the grade of contribution (taking as a comparison), : ODF (origin destination flow) for clients, : the contribution of customer flow (fare origin destination flow) per unit: the order in which the contribution of the customer flow is arranged (from high to low), : the demand under the different contributions of customers in the segments for allocation: the matrix that contributes to the customer flow: the sequence number of the segment, : the number of slots in section : the vector composed of all : the corresponding weight of the segment: the vector composed of all : the weight of the customer flow: a dimension vector composed of all : the contribution of t customer flow

4.2.2. Decision Variables

: the contribution of the customer flow for customer S: a t dimension vector composed of all

4.3. CCYM Model Formulation

The different contribution levels are introduced to evaluate how cargo revenue compensates for different costs. Figure 4 shows the different contribution levels by calculating the difference between cargo revenue and various costs in the shipment cycle in container transportation:

Constraint (1) calculates the difference between cargo revenue and cargo cost and transportation cost, which implies the revenue should be able to cover the cost paying for cargo directly and its transit cost through feeder, rail, and truck in balancing areas. Therefore, contribution I can be used as the bottom-line price for balancing areas under rational competition environment. Constraint (2) calculates the difference between cargo revenue and cargo cost, transportation cost, and equipment variable cost. The empty container repositioning fees and storage fees are well reflected together with cargo cost and transportation cost, which implies that the revenue should be able to cover the cost paying for cargo directly and its transit cost and empty container reposition cost. Therefore, contribution II can be used as the bottom-line price for unbalancing areas under rational competition environment. Constraint (3) reflects the equipment fixed cost, which can be used as the equilibrium price under rational competition environment. Constraint (4) calculates the difference between cargo revenue and cargo cost, transportation cost, equipment variable cost, equipment fixed cost, vessel cost, fuel cost, and port cost. The empty container reposition fees and storage fees are well reflected according to the cost-apportioned logic in practice. The unique characteristics of yield management in container shipping due to cargo flow direction, cargo category, cargo weight, and service route are well reflected through the evaluation of various costs.

According to the actual statistical analysis, we assume that demand is a positive random variable basically in obedience with the normal distribution. That is, with , is independent of each other. At the same time, the total slot and weight limits of the known vessels remain unchanged after a vessel is deployed into the service route. Without considering the shutout after the booking is released, we study a stochastic programming model for multisection slot control based on contribution reconstruction. For any contribution segment,

Since is a random variable, under the premise of known distribution, we express the expected payoff above as the following:

In the formula, is the probability density function of (expressed as the dummy variable ):

Equation (7) is the objective function of the model. The function objective is to allocate on all contributing segments so that the total contribution of the whole route is the largest. Constraint (8) indicates that the sum of the allocation assigned in each segment cannot be higher than the total allocation. Additionally, constraint condition (9) indicates that the sum of the weight assigned related to the allocation in each segment is not higher than the total weight limit of the route. Constraint condition (10) indicates that the number of the allocation assigned in each segment must be positive and only the integer. Constraint condition (11) shows that the amount of the segment’s weight distribution must be positive.

5. Solution Methodology

Genetic algorithm is a very widely used heuristic algorithm, which has the characteristics of high efficiency and stability when solving large-scale complex optimization problems. It is suitable for solving the mathematical model established in this paper. Therefore, the genetic algorithm is in search for the optimal solution, and the number of booking requirements for each customer is determined to maximize the contribution of the entire route. The main steps of the genetic algorithm are designed as follows:

Step 1. Encoding. Due to the large number of variables, if binary coding is used, overflow may occur. Therefore, the floating point coding method is applied. This model takes the different booking plans of decision-making customers as chromosomes, that is, one booking plan represents a chromosome; each chromosome is composed of two parts, which are the customer number and the number of customer booking requirements. The chromosome coding is shown in Table 4. Among them, for each only takes values between [0, ], in order to narrow the search scope and reduce the running time, therefore, the following constraint is added to the original model:


GENE 1GENE 2GENE 3GENE 4...GENE n

Customer number...
Customer ID...

Step 2. Initialization of the Population. Add relaxation variables to equations (8)–(12) to convert into linear equations, figure out to get the basic solution system. Each point in the feasible set can be represented by a linear combination of basic solution systems, thereby generating multiple initial feasible solutions. Since is an integer, the integer part of the obtained initial feasible solution is taken, thereby establishing an initial population composed of 50 feasible solutions. At the same time, the cross probability set in this paper is 0.6 and the mutation probability is 0.1.

Step 3. Calculation of Fitness. Since the objective function is a nonlinear function, it is difficult to analyze the function qualitatively. Therefore, the objective function is converted into a fitness function. Considering that the chromosome may exceed the feasible region after crossing and mutation, it can be constrained by constructing a fitness function with a penalty term. The fitness function is

Step 4. Seed Selection. Use the roulette method to select the previous generation of individuals who enter the mating pool. Retain the best individuals of each subgroup and enter the mating pool directly. The other n−1 individuals are randomly selected using the roulette wheel algorithm to form a new generation mating pool group.

Step 5. Crossover and Mutation. The crossover operation uses a single-point crossover method, with each gene as a whole. Randomly select a gene on the chromosome, and cross the number of customer booking requirements. The mutation operation adopts the mutation method, that is, randomly select 2 positions of the chromosome and exchange the genes at the 2 positions to generate new chromosomes.

Step 6. Algorithm Termination. The genetic algorithm is an iterative search algorithm, which gradually approaches the optimal solution instead of obtaining the optimal solution through multiple evolutions. Therefore, it is necessary to determine the criteria for stopping operation. The termination condition used here is to specify the maximum number of iterations (the maximum number of iterations is 500). When the algorithm stops executing, the best individual in the history is designated as the result of the genetic algorithm.

6. Case Study

We take the service of AEU3 from COSCO Shipping Lines as an example. The service route rotation is shown in Figure 1 to be as follows: Tianjin-Dalian-Qingdao-Shanghai-Ningbo-Singapore-Piraeus-Rotterdam-Hamburg-Antwerp. The capacity and deadweight limitation is known as 18000TEU and 198000 ton per vessel correspondingly. We calculate the historical statistics in order to obtain the average demand, and cargo contribution of CMTX4 is calculated as it reflects all cost items. Table 5 presents the cargo contribution, average demand, standard deviation, and average weight of each service route segment. We study the allocation distribution so as to maximize the total cargo contribution.


Loading portDischarging portCTW4Average demandStandard deviationAverage weight

TianjinPiraeus$230420 TEU515Ton/TEU
Rotterdam$160630 TEU414Ton/TEU
Hamburg$260520 TEU615Ton/TEU
Antwerp$220350 TEU313Ton/TEU

DalianPiraeus$220120 TEU514Ton/TEU
Rotterdam$145150 TEU413Ton/TEU
Hamburg$198250 TEU715Ton/TEU
Antwerp$176160 TEU414Ton/TEU

QingdaoPiraeus$265460 TEU313Ton/TEU
Rotterdam$154750 TEU612Ton/TEU
Hamburg$1981340 TEU214Ton/TEU
Antwerp$1821650 TEU613Ton/TEU

ShanghaiPiraeus$2751230 TEU310Ton/TEU
Rotterdam$2122450 TEU59Ton/TEU
Hamburg$2641980 TEU411Ton/TEU
Antwerp$2381940 TEU610Ton/TEU

NingboPiraeus$263920 TEU511Ton/TEU
Rotterdam$2071650 TEU48Ton/TEU
Hamburg$2581430 TEU39Ton/TEU
Antwerp$2361120 TEU710Ton/TEU

SingaporePiraeus$164360 TEU29Ton/TEU
Rotterdam$152540 TEU411Ton/TEU
Hamburg$185210 TEU210Ton/TEU
Antwerp$176120 TEU310Ton/TEU

Use the fitness functions and set the population size to 50, the maximum variation of the generation to 500, the probability of crossover to 50%, and the probability of mutation to 10%, and solve by MATLAB. The running time is 748 seconds after generation 501; the solution tends to be stable and reaches an approximate optimal solution as shown in Figure 5.

According to the genetic algorithm, the maximum payoff of the service route is $4,139,400. Under this approximate optimal solution, Table 6 shows the allocation distributed in each segment.


Loading portDischarging portRoute number (CTW4)Average demandStandard deviationAverage weightAllocation proposed

TianjinPiraeus1230.00420515430
Rotterdam2160.0063041415
Hamburg3260.00520615532
Antwerp4220.00350313356

DalianPiraeus5220.00120514130
Rotterdam6145.001504138
Hamburg7198.00250715235
Antwerp8176.0016041488

QingdaoPiraeus9265.00460313466
Rotterdam10154.007506123
Hamburg11198.0013402141319
Antwerp12182.0016506131590

ShanghaiPiraeus13275.0012303101236
Rotterdam14212.002450592418
Hamburg15264.0019804111988
Antwerp16238.0019406101952

NingboPiraeus17263.00920511930
Rotterdam18207.001650481623
Hamburg19258.001430591440
Antwerp20236.0011207101134

SingaporePiraeus21164.00360297
Rotterdam22152.005404116
Hamburg23185.0021021084
Antwerp24176.0012031010

7. Discussion

The above model solution shows that the rate of utilization of the entire service route reaches 100% while the rate of weight utilization reaches 99%. That is, the allocation distribution seems to best meet the requirements between the light and overweight cargo in different segments. The contribution for the whole service route is maximized by giving priority to high-contribution segments and high-contribution cargos. Thus, this seems to be an excellent solution to the container liner’s YM. Thus, how is it possible to make an evaluation of the optimum solution in actual practice?

First, from the model solutions proposed by the genetic algorithm, one of the problems is the ignorance of the potential loss that will result from not satisfying the current customers’ allocation requirements. The above solution might cause unexpected losses due to customer complaints. This could produce significant potential losses and significantly influence (in a negative way) the stability of the service route. Using the model solution, for example, looking at route numbers 2, 6, 8, 10, 21, 22, 23, and 24 under the approximate optimal solution of distribution strategy, only 2%, 5%, 55%, 0.4%, 2%, 1%, 40%, and 8%, respectively, of the average allocation demand have been matched. Such results could lead to severe customer complaints along with the potential loss of both customers and market share. These results, in turn, could cause unexpected losses that are not considered in the models and solution. A further solution in future research would be to add additional constraints (such as a deviation index) to ensure that maintenance and service stability are not affected. Another solution could be to conduct an evaluation of customers and divide them into different groups (such as global key accounts, regional key accounts, trade key accounts, big cargo owners, small and medium-size cargo owners, and spot-forwarding businesses) with further subdivision based on the average allocation demand in each segment. This can be done by calculating the different groups of customer requirements to determine the reasonable section of allocation distributed in each segment and adding the result into the mathematical model constraints.

Second, the model solution is based on the average demand of each segment and the segment’s contribution analysis. This can be the benchmark when shipping carriers make decisions regarding each segment’s allocation. However, the limitation with this strategy is the ignorance of each segment’s allocation demand between the peak and slack seasons. These variations might significantly affect the contribution and the conclusion. For example, even when a certain segment’s contribution is lower compared to others, the majority of the cargos remain in the slack season, and that segment’s contribution cannot be simply evaluated by numbers. One possible solution is to add each segment’s ratio between the average allocation demand to both slack and peak seasons. The ranking from high to low of such ratios should be considered when making decisions on the allocation distribution strategy (together with the contribution evaluation) and added as the mathematical model constraint.

Third, the model solution is based on the reconstruction of the contribution by maximizing the contribution of the service route. This can serve as the optimized strategy to achieve YM management objectives under a specific container liner’s current customer structure and existing service route network. However, in actual YM practice, when container liners make decisions regarding their allocation strategies, all service routes in the network should be considered together with their competitors’ service profile, both in general and in specific segments. This requirement relates to specific marketing strategies in specific areas and is an important factor in establishing competitiveness by virtue of a larger market share, better delivery times in certain markets, and superior service differentiation. This can be further studied through the game theory and by adding a segment competitiveness index in the mathematical model when deciding on a segment strategy.

Finally, the allocation distributed to each segment by the model solutions should be assigned to specific target customers. Because the different orders of some customers are often inseparable, no possibility exists to simply and strictly meet each segment’s allocation. Doing so might cause potential losses due to booking shut outs that, in turn, could result if only a portion of the allocation is satisfied for different customers. How to adjust the allocations distributed in each segment and how to distribute allocations to each customer under contribution reconstruction using customer evaluations and allocation promises for long-term contracts should be studied further.

8. Conclusion

YM refers to the management of allocation and pricing to maximize the payoff in a stochastic environment. However, how to define the objectives is a matter worth discussing. The majority of the current research attributed the objective to maximizing revenue (e.g., total revenue and average revenue) without considering the generated relational cost. Other studies attributed the objective to profit maximization while costs were selected without considering how the costs were generated and calculated, or they were calculated repeatedly. The special characteristics of container liner shipping compared to air transport, hotel arrangements, or retail management must be reflected in the traditional YM models. This study proposes a new solution to evaluate the YM payoff by considering the special characteristics in container liner shipping. The idea is to reflect both cargo revenue and cost and to maximize the cargo contribution. All costs were identified and calculated according to the logic cost generated to allow evaluation of the cargo contribution. Although the number of plugs for reefers was not considered in the constraint, this will not affect the conclusions. It is common practice that container liners give priority to reefer containers and reserve allocation for reefer containers in advance. The reservation can be deducted from the whole capacity and will not lead to a different conclusion.

The emphasis of this study is to maximize the payoff though capacity management in different service route segments. Future proposed research directions would be the slot allocated to different customers in each segment and the pricing strategy and model solution based on the cargo contribution.

Data Availability

The datasets used during the current study are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Authors’ Contributions

Yisong Lin conceived and designed the analytic framework. Xuefeng Wang and Jian Gang Jin analysed the data. Yisong Lin wrote the paper. All the authors read and approved the final manuscript.

Acknowledgments

The author J. G. Jin is sponsored by the Shanghai Rising-Star Program.

References

  1. Q. Meng, H. Zhao, and Y. Wang, “Revenue management for container liner shipping services: critical review and future research directions,” Transportation Research Part E: Logistics and Transportation Review, vol. 128, pp. 280–292, 2019. View at: Publisher Site | Google Scholar
  2. R. Hellermann, Capacity Options for Revenue Management: Theory and Application in the Air Cargo Industry, Springer Science & Business Media, Berlin, Germany, 2006.
  3. S.-C. Ting and G.-H. Tzeng, “An optimal containership slot allocation for liner shipping revenue management,” Maritime Policy & Management, vol. 31, no. 3, pp. 199–211, 2004. View at: Publisher Site | Google Scholar
  4. L. R. Weatherford and S. E. Bodily, “A taxonomy and research overview of perishable-asset revenue management: yield management, overbooking, and pricing,” Operations Research, vol. 40, no. 5, pp. 831–844, 1992. View at: Publisher Site | Google Scholar
  5. A. Gardon, P. Nielsen, and N. GormMalyRytter, Challenges of Measuring Revenue, Margin and Yield Optimization in Container Shipping, IFIP International Federation for Information Processing, Laxenburg, Austria, 2013.
  6. K. Littlewood, “Forecasting and control of passengers,” in Proceedings of the 12th AGIFORS Symposium Proceedings, pp. 103–105, Nathanya, Israel, October 1972. View at: Google Scholar
  7. T. C. Lee and M. Hersh, “A model for dynamic airline seat inventory control with multiple seat bookings,” Transportation Science, vol. 27, no. 3, pp. 252–265, 1993. View at: Publisher Site | Google Scholar
  8. J. I. Mcgill, “Censored regression analysis of multiclass passenger demand data subject to joint capacity constraints,” Annals of Operations Research, vol. 60, no. 1, pp. 209–240, 1995. View at: Publisher Site | Google Scholar
  9. L. W. Robinson, “Optimal and approximate control policies for airline booking with sequential nonmonotonic fare classes,” Operations Research, vol. 43, no. 2, pp. 252–263, 1995. View at: Publisher Site | Google Scholar
  10. P. P. Belobaba and A. Farkas, “Yield management impacts on airline spill estimation,” Transportation Science, vol. 33, no. 2, pp. 217–232, 1999. View at: Publisher Site | Google Scholar
  11. R. E. Chatwin, “Continuous-time airline overbooking with time-dependent fares and refunds,” Transportation Science, vol. 33, no. 2, pp. 182–191, 1999. View at: Publisher Site | Google Scholar
  12. Y. Liang, “Solution to the continuous time dynamic yield management model,” Transportation Science, vol. 33, no. 1, pp. 117–123, 1999. View at: Publisher Site | Google Scholar
  13. Y. Feng and G. Gallego, “Perishable asset revenue management with markovian time dependent demand intensities,” Management Science, vol. 46, no. 7, pp. 941–956, 2000. View at: Publisher Site | Google Scholar
  14. Y. Feng and B. Xiao, “Optimal policies of yield management with multiple predetermined prices,” Operations Research, vol. 48, 2000. View at: Publisher Site | Google Scholar
  15. G. Gallego and G. van Ryzin, “Optimal dynamic pricing of inventories with stochastic demand over finite horizons,” Management Science, vol. 40, no. 8, pp. 999–1020, 1994. View at: Publisher Site | Google Scholar
  16. F. Glover, J. R. Glover, and C. McMillan, “The passenger-mix problem in the scheduled airlines,” Interfaces, vol. 12, no. 3, pp. 73–80, 1982. View at: Publisher Site | Google Scholar
  17. P. P. Belobaba, “Survey paper-airline yield management an overview of seat inventory control,” Transportation Science, vol. 21, no. 2, pp. 63–73, 1987. View at: Publisher Site | Google Scholar
  18. R. E. Curry, “Optimal airline seat allocation with fare classes nested by origins and destinations,” Transportation Science, vol. 24, no. 3, pp. 193–204, 1990. View at: Publisher Site | Google Scholar
  19. S. L. Brumelle and J. I. Mcgill, “Airline seat allocation with multiple nested fare classes,” Operations Research, vol. 41, no. 1, pp. 127–137, 1993. View at: Publisher Site | Google Scholar
  20. M. Brooks and K. J. Button, “Yield management: a phenomenon of the 1980s and 1990s?” International Journal of Transport Economics, vol. 21, no. 2, pp. 177–196, 1994. View at: Google Scholar
  21. D. Ha, “Capacity management in the container shipping industry: the application of yield management techniques,” The University of Tennessee, Knoxville, TN, USA, 1994, Ph.D. thesis. View at: Google Scholar
  22. S. A. Maragos, “Yield management for the maritime industry,” Massachusetts Institute of Technology, Cambridge, MA, USA, 1994, Ph.D. thesis. View at: Google Scholar
  23. S. Zurheide and K. Fischer, “A revenue management slot allocation model for liner shipping networks,” Maritime Economics & Logistics, vol. 14, no. 3, pp. 334–361, 2012. View at: Publisher Site | Google Scholar
  24. S. Zurheide and K. Fischer, “Revenue management methods for the liner shipping industry,” Flexible Services and Manufacturing Journal, vol. 27, no. 2-3, pp. 200–223, 2015. View at: Publisher Site | Google Scholar
  25. Y. Wang, Q. Meng, and Y. Du, “Liner container seasonal shipping revenue management,” Transportation Research Part B: Methodological, vol. 82, pp. 141–161, 2015. View at: Publisher Site | Google Scholar
  26. C. M. Feng and C. H. Chang, “Optimal slot allocation with empty container reposition problem for Asia ocean carriers,” International Journal of Shipping and Transport Logistics, vol. 2, no. 1, pp. 22–43, 2010. View at: Publisher Site | Google Scholar
  27. L. H. Lee, E. P. Chew, and M. S. Sim, “A heuristic to solve a sea cargo revenue management problem,” OR Spectrum, vol. 29, no. 1, pp. 123–136, 2006. View at: Publisher Site | Google Scholar
  28. H.-A. Lu and W.-H. Mu, “A slot reallocation model for containership schedule adjustment,” Maritime Policy & Management, vol. 43, no. 1, pp. 136–157, 2016. View at: Publisher Site | Google Scholar
  29. D. Liu and H.-L. Yang, “Optimal slot control model of container sea-rail intermodal transport based on revenue management,” Procedia-Social and Behavioral Science, vol. 96, pp. 50–59, 2013. View at: Publisher Site | Google Scholar
  30. UNCTAD, Review of Maritime Transport 2008, United Nations Conference in Trade and Development, Geneva, Switzerland, 2008, Tech. Rep.

Copyright © 2020 Yisong Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views296
Downloads161
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.