Research Article  Open Access
Shuaian Wang, Xiaobo Qu, Tingsong Wang, Wen Yi, "Optimal Container Routing in Liner Shipping Networks Considering Repacking 20 ft Containers into 40 ft Containers", Journal of Advanced Transportation, vol. 2017, Article ID 8608032, 9 pages, 2017. https://doi.org/10.1155/2017/8608032
Optimal Container Routing in Liner Shipping Networks Considering Repacking 20 ft Containers into 40 ft Containers
Abstract
The volume of a 40 ft container is twice as large as that of a 20 ft container. However, the handling cost (loading, unloading, and transshipment) of a 40 ft container is much lower than twice the corresponding handling cost of two 20 ft containers. Enlightened by this observation, we propose a novel container routing with repacking problem in liner shipping, where two 20 ft containers can be repacked to a 40 ft container in order to reduce the handling cost. We develop a mixedinteger linear programming model that formulates the routing decisions and the repacking decisions in a holistic manner. An illustrative example is reported to demonstrate the applicability of the model. Results show that the benefit of repacking is the most significant when containers are transshipped several times.
1. Introduction
Maritime transportation is the backbone of international trade. Around 80 per cent of global trade by volume and over 70 per cent by value are carried by sea. Among all the sea cargos, about half in monetary terms are containerized [1]. Containers are transported by shipping lines on regularly serviced ship routes. At the port of origin, containers are loaded onto ships by quay cranes; and at the port of destination, containers are discharged from ships by quay cranes. Containers may also be transshipped between their origin ports and destination ports. In fact, transshipment is a common operation in container shipping. As reported by [1], the total container trade volumes amounted to 160 million twentyfoot equivalent units (TEUs) in 2013, whereas world container port throughput was estimated at 651 million TEUs. These numbers mean that on average a container was transshipped times (the throughput data for ports also include empty containers.).
Container routing determines how to transport containers from their origins to their destinations in a liner shipping network. Take Figure 1 as an example, which shows a liner shipping network consisting of three ship routes. Containers from Singapore to Hong Kong can be transported on either ship route 1 or ship route 2. If there are many containers to be transported from Singapore to Jakarta, then containers from Singapore to Hong Kong should be transported on ship route 2 to reserve the capacity on ship route 1 for containers from Singapore to Jakarta. In addition to different ship routes on which containers can be transported from origin to destination, another complicating factor is transshipment. For instance, containers from Hong Kong to Colombo can be transported on ship route 2, or they can be transported on ship route 1 to Singapore and transshipped to ship route 2 and then transported to Colombo. The choice of direct shipment on ship route 2 is preferable because otherwise it would involve a high transshipment cost at Singapore. However, if there are many containers to be transported from Hong Kong to Xiamen or from Xiamen to Singapore, then the choice of transshipment at Singapore from ship route 1 to ship route 2 has to be adopted. Consequently, it is not an easy task to determine the optimal container routing.
Container routing determines the container handling cost. Table 1 shows the handling costs for two types of laden containers at three ports: D20 means dry 20 ft container, and D40 is dry 40 ft container. In terms of cargo capacity, a D40 is equivalent to two D20s. However, Table 1 clearly indicates in the three rows “Ratio” that the ratio of the cost of handling a D40 and that of handling a D20 is strictly less than 2. In fact, all the ratios in Table 1 are less than 1.5, and some ratios are even 1 or very close to 1. This is because both the handling of a D20 and the handling of a D40 involve one quay crane move (we note that nowadays some quay cranes can handle one D40 or two D20s in each move.). Therefore, to reduce container handling costs, a shipping line should try to transport more D40s instead of D20s as a D40 can hold as much cargos as two D20s.

1.1. Container Repacking
As the handling cost of a D40 is much lower than that of two D20s, it might be advantageous to unpack two D20s and repack them to one D40. In the sequel, we use “TEU” and “D20” interchangeably and use “fortyfoot equivalent unit (FEU)” and “D40” interchangeably. The load, transshipment, and discharge cost (USD/container) of a TEU at a port is denoted by , , and , respectively. The load, transshipment, and discharge cost (USD/container) of an FEU at port is denoted by , , and , respectively. We further let be the cost of repacking two TEUs into one FEU and be the cost of unpacking one FEU to two TEUs (Since multiple rehandling of containers would increase the risk for damage and therefore may increase insurance costs, we can include in and the extra insurance costs. Moreover, repacking requires consent from shippers and we can include in the rehandling cost the component of discount for shippers who agree for their cargos to be repacked.).
Figure 2 shows an example of transporting two TEUs from port to port . The two TEUs need to be transshipped twice. If they are transported as two TEUs, as shown in Figure 2(a), then, at the port of origin, that is, , two TEUs are loaded; at , two TEUs are transshipped; at , two TEUs are transshipped; and, at the destination port , two TEUs are discharged. Therefore, the total container handling cost is
(a) Two TEUs from to without repacking
(b) Two TEUs from to with repacking at and unpacking at
If these two TEUs are repacked into an FEU at the origin port and unpacked at the destination port, as shown in Figure 2(b), then, at the port of origin, that is, , one FEU is loaded; at , one FEU is transshipped; at , one FEU is transshipped; and, at the destination port , one FEU is discharged. Moreover, container repacking and unpacking costs are incurred at and , respectively (The FEU is unpacked at into two TEUs because the two TEUs from port to port actually have different inland destinations.). Therefore, the total container handling and packing cost iswhich may be considerably smaller than (1).
Not only can TEUs with the same origin and destination ports be repacked into FEUs, as shown in Figure 2, TEUs with different origins and destinations can also be repacked into FEUs. For example, in Figure 3, one TEU is from to and the other TEU is from to . If they are transported as TEUs throughout their trips, as shown in Figure 3(a), the total handling cost isThey may be repacked into an FEU at the transshipment port and unpacked as two TEUs at transshipment port , as shown in Figure 3(b). At , since two TEUs are unloaded and one FEU is loaded in the transshipment process, the total transshipment cost is calculated as half of the sum of the transshipment cost of two TEUs and the transshipment cost of one FEU, that is, . Similarly, the transshipment cost at is calculated as . Therefore, the total container handling and packing cost iswhich may be smaller than (3) if the container packing cost is small. Of course, the benefit of repacking TEUs into FEUs in Figure 3(b) is not as significant as Figure 2.
(a) One TEU from to and one TEU from to without repacking
(b) One TEU from to and one TEU from to with repacking at and unpacking at
(c) One TEU from to and one TEU from to with repacking at and unpacking at
Container packing may also affect how the containers are transported. For example, in Figure 3(c), the container shipment demand (the number of containers to be transported from one port to another in a week) is the same as Figures 3(a) and 3(b). Containers are transported as follows in Figure 3(c): one TEU is transported from to ; at , the TEU is unloaded and repacked with another TEU whose origin is into an FEU; the FEU is loaded/transshipped at and transported to ; at , the FEU is unpacked to two TEUs, one of which has arrived at its destination and the other should be transported to its destination . To compute the handling cost of the two TEUs at , we assume that there are two TEUs with origin and another two TEUs with origin that are repacked into two FEUs at (hence, the handling cost is doubled). The two TEUs with origin are actually transshipped at , and therefore the handling cost is . The two TEUs with origin are actually loaded at , and therefore the handling cost is . Consequently, the total handling cost at in the example of Figure 3(c) isSimilar arguments apply to the handling cost at . Therefore, the total container handling and packing cost in Figure 3(c) isIn some cases, it is still possible that (6) is smaller than (3).
1.2. Literature Review, Objectives, and Organization
Quantitative research on container liner shipping can be classified into three categories: strategic, tactical, and operational problems [2, 3]. Strategic problems include ship fleet planning [4] and alliance formation [5]. Strategic problems involve decisions that have effects for many years, and hence it is very difficult to predict the container demand. As a result, the demand is usually simplified; for instance, containers are formulated as either TEUs, where a D40 is considered as two TEUs, or FEUs, where a D20 is considered as half an FEU. Tacticallevel decisions include network design [6, 7], fleet deployment [8], speed optimization [9], and schedule design [10]. Tacticallevel decisions are usually made taking into account how containers are transported in shipping networks. Nevertheless, in almost all of these studies on tacticallevel problems, similar to the ones on strategic level problems, containers are formulated as either just TEUs or just FEUs. Wang [11] examined containership fleet deployment with both TEUs and FEUs; however, the TEUs are not allowed to be repacked to FEUs.
Quantitative research on container terminal operations can be divided into studies on seaside operations and studies on landside operations. Seaside decisions are mainly on berth allocation and quay crane assignment [12–19]. Landside problems are mainly yard storage area planning and allocation [20–24]. There are also studies considering both container terminal operations planning and vessel scheduling [25–27]. None of the above studies related to container terminal operations has investigated the problem of repacking TEUs into FEUs.
The objective of our study is to investigate how a container shipping line can transport containers in an efficient manner while accounting for the possibility of repacking two TEUs into one FEU to reducing the handling costs. We systematically examine this problem and develop a holistic model that incorporates both container routing and container repacking. Hence, we address a practical problem that is significant for container shipping industry.
The remainder of the paper is organized as follows: Section 2 describes the problem. Section 3 proposes a mixedinteger linear programming model that captures both container routing and container repacking. Section 4 reports a case study. Section 5 concludes.
2. Problem Description
Consider a set of ship routes, regularly serving a group of ports denoted by set . Ship route can be expressed as where is the number of ports of call and is the th port of call, . Define . The voyage from port of call to port of call is called leg and leg is the voyage from port of call to the first port of call. In Figure 1, three ship routes are shown: ship route 1 has three legs, ship route 2 has five legs, and ship route 3 has three legs. Each ship route has a weekly service frequency, which means that each port of call is visited on the same day every week. A string of homogeneous ships with a capacity of (TEUs) is deployed on ship route to maintain the weekly frequency. The liner services are similar to bus services [28].
Represent by the set of origintodestination (OD) port pairs, which is a subset of . There are two types of containers to ship: TEUs () and FEUs (). The demand for OD pair is denoted by and (containers/week) for TEUs and FEUs, respectively. Containers can be transshipped at any port from their origins to their destinations. The loading, unloading, and transshipment costs should be included in making container routing and repacking decisions.
As aforementioned, two TEUs may be repacked into an FEU to reduce handling cost. From the practical point of view, we assume that a TEU can be repacked and unpacked at most once. The repacking and unpacking costs should also be included in making container routing and repacking decisions.
It should be noted that two TEUs can only be repacked into an FEU at container yards. In other words, the repacking activity could not be carried out on ships. For example, in Figure 3(c), the TEU with origin must be unloaded from ships at so as to be repacked with the TEU from into an FEU (and hence handling cost of the TEU with origin at is incurred).
The container routing with repacking problem aims to determine where to repack TEUs into FEUs and where to unpack the FEUs, and how to transport both TEUs and FEUs in order to minimize the total handling and packing cost, while allowing containers to be transshipped at any port in a liner shipping network.
3. MixedInteger Linear Programming Model
3.1. Demand Reformulation for Container Repacking
For each OD pair , we define as the number of TEUs that are repacked at port and unpacked at port . Let be the set of nonnegative integers. We have
Therefore, the number of TEUs that are transported for OD pair without repacking, denoted by , isNote that (8) and (9) imply that is an integer. The total loading and unloading cost of the TEUs for all OD pairs isThe transshipment cost of these TEUs is not a constant as it depends on container routing.
The number of TEUs with origin port and repacked into FEUs at port , denoted by , isIn (12), means that the TEU is repacked at its origin port. Hence, for this TEU, the loading cost is equal to half the loading cost of an FEU at port . If , the loading cost of a TEU at port , half the transshipment cost of a TEU, and a quarter of the transshipment cost of an FEU at port should be considered. In either case, the repacking cost at port should be considered. Therefore, the sum of the total handling cost excluding the transshipment cost between port and port (these TEUs may be transshipped when they are transported from port to port ) and the repacking cost for these TEUs is
The number of TEUs that are unpacked from FEUs at port and transported from port to their destination port , denoted by , isIf , the TEU is unpacked at its destination port. Hence, the discharge cost of half an FEU at port should be considered. Otherwise, the discharge cost of a TEU at port , half the transshipment cost of a TEU, and a quarter of the transshipment cost of an FEU at port should be included. In either case, the unpacking cost at port should be incorporated. Therefore, the sum of the total handling cost excluding the transshipment cost between port and port (these TEUs may be transshipped when they are transported from port to port ) and the unpacking cost for these TEUs is
The last reformulated demand is the transportation of the repacked containers, which are FEUs. The number of FEUs to be transported from port where they are repacked to port where they are unpacked, denoted by , isNote that, for the FEUs, the handling costs at port and port are already included in the calculation in (13) and (15). The transshipment cost between port and port (if any) depends on container routing.
FEUs in the original demand do not need further processing for modeling. The total loading and unloading cost of FEUs isThe transshipment cost of these containers is not a constant as it also depends on container routing.
We use and (containers/week) to represent the reformulated demand of TEUs and FEUs for OD pair , respectively. The total reformulated demand is
We define vector of decision variables for formulating container repacking:The domain of , represented by set , is all vectors in (19) that satisfy (8), (9), (10), (12), (14), (16), and (18).
3.2. Mathematical Model for Container Routing with Repacking
We have already characterized container repacking decisions using vector . To formulate container routing, we simply consider the new container shipment demand shown in (18). The decision variables for formulating container routing are as follows. and are the number of TEUs per week from loaded and discharged at port of call on ship route , respectively (note that when calculating and , a transshipped TEU is considered as being discharged once and being loaded once); is the number of TEUs per week from flowing on leg on ship route (we define ); is the total number of TEUs from all OD pairs transshipped at port per week. , , , and are defined correspondingly for FEUs. We define the vector of container routing decision variables:The container routing with repacking problem, with decisions in (19)(20), can be formulated as an integer linear optimization model [29, 30]:subject toThe objective function (21) minimizes the total handling and repacking and unpacking cost. Constraint (22) is the TEU flow conservation equation. Constraint (23) defines the total number of transshipped TEUs at each port. Constraint (24) requires that the reformulated TEU demand is fulfilled. Equations (25)–(27) define the corresponding constraints for FEUs. Constraint (28) imposes ship capacity constraint on each leg of each ship route. Constraints (29)(30) enforce the integrality of the number of containers.
Note that as packing and unpacking containers take time, we can further incorporate constraints into the model related to the maximum number of containers that can be packed or unpacked. For instance, if ship A arrives at a port on Monday, ship B arrives at the port on Wednesday, and ship C arrives at the port on Friday, then there are two days’ time to pack ships A and B’s 20 ft containers into 40 ft containers to be loaded onto ship C. Taking into account the packing efficiency of the port, the maximum number of containers that can be packed can be calculated.
4. An Illustrative Example
We use the shipping network in Figure 4 to demonstrate the applicability of the proposed model. There are three ship routes, and all ship routes are deployed with ships of a capacity of 5000 TEUs. There are three OD pairs, where all containers are TEUs. The container handling costs are assumed to be the same at all ports: , , , and . We consider four groups of repacking and unpacking costs: group 1 with , group 2 with , group 3 with , and group 4 with . We also consider four possible packing decisions: in decision 1, no container is repacked and unpacked; in decision 2, only containers from Shanghai to Colombo are repacked and unpacked; in decision 3, containers from Shanghai to Colombo and containers from Xiamen to Singapore are repacked and unpacked; and, in decision 4, all containers are repacked and unpacked.
The results are shown in Table 2, and the minimum total cost in each repacking and unpacking cost group is highlighted in bold. We can see that when the repacking and unpacking costs are low (i.e., 50 USD), all TEUs should be repacked and unpacked. When the repacking and unpacking costs are higher, for example, when they are 200 USD, only TEUs from Shanghai to Colombo should be repacked and unpacked because they are transshipped twice and can take the largest advantage of handling FEUs instead of TEUs. When the repacking and unpacking costs are extremely high (i.e., 250 USD), it is no longer viable to repack TEUs into FEUs. Interestingly, those TEUs that are transshipped many times usually originate from a remote small port and are destined for another remote small port, and there are not many shipping services available. As a result, the shippers may have no choice but to agree to allow their cargos to be repacked during the trip from origin to destination. Another implication is that the packing costs may affect the routing of containers. If a port has very low packing costs, shipping companies may transship containers at this port for the sake of unpacking and repacking containers, and this will bring business to the port.

5. Conclusions
This paper has proposed a novel container routing with repacking problem in liner shipping. When routing containers, TEUs can be repacked into FEUs to reduce the handling cost as the handling cost of an FEU is much lower than twice the handling cost of a TEU. To the best of our knowledge, this is a new research topic that has not been dealt with in the literature. We developed a mixedinteger linear programming model that formulates the routing decisions and the repacking decisions in a holistic manner. The model could help container shipping lines to transport containers more efficiently. An illustrative example was reported to demonstrate the applicability of the model. Results show that the benefit of repacking two TEUs into an FEU is the most significant when containers are transshipped several times.
Container routing not only is significant to liner shipping companies as an independent problem but also serves as a subproblem in a number of tacticallevel decision problems such as network alteration and fleet deployment. How to address tacticallevel decision problems while considering container repacking is an interesting future research direction.
Competing Interests
The authors declare that they have no competing interests.
References
 UNCTAD, Review of Maritime Transportation, Paper presented at the United Nations Conference on Trade and Development, New York and Geneva, 2014, http://unctad.org/en/PublicationsLibrary/rmt2014_en.pdf.
 M. Christiansen, K. Fagerholt, B. Nygreen, and D. Ronen, “Ship routing and scheduling in the new millennium,” European Journal of Operational Research, vol. 228, no. 3, pp. 467–483, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 Q. Meng, S. Wang, H. Andersson, and K. Thun, “Containership routing and scheduling in liner shipping: overview and future research directions,” Transportation Science, vol. 48, no. 2, pp. 265–280, 2014. View at: Publisher Site  Google Scholar
 Q. Meng and T. Wang, “A scenariobased dynamic programming model for multiperiod liner ship fleet planning,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 4, pp. 401–413, 2011. View at: Publisher Site  Google Scholar
 J. Zheng, Z. Gao, D. Yang, and Z. Sun, “Network design and capacity exchange for liner alliances with fixed and variable container demands,” Transportation Science, vol. 49, no. 4, pp. 886–899, 2015. View at: Publisher Site  Google Scholar
 K. Fagerholt, “Optimal fleet design in a ship routing problem,” International Transactions in Operational Research, vol. 6, no. 5, pp. 453–464, 1999. View at: Publisher Site  Google Scholar
 K. Fagerholt, “Designing optimal routes in a liner shipping problem,” Maritime Policy and Management, vol. 31, no. 4, pp. 259–268, 2004. View at: Publisher Site  Google Scholar
 T. Wang, Q. Meng, S. Wang, and Z. Tan, “Risk management in liner ship fleet deployment: a joint chance constrained programming model,” Transportation Research Part E: Logistics and Transportation Review, vol. 60, pp. 1–12, 2013. View at: Publisher Site  Google Scholar
 T. E. Notteboom and B. Vernimmen, “The effect of high fuel costs on liner service configuration in container shipping,” Journal of Transport Geography, vol. 17, no. 5, pp. 325–337, 2009. View at: Publisher Site  Google Scholar
 X. Qi and D.P. Song, “Minimizing fuel emissions by optimizing vessel schedules in liner shipping with uncertain port times,” Transportation Research Part E: Logistics and Transportation Review, vol. 48, no. 4, pp. 863–880, 2012. View at: Publisher Site  Google Scholar
 S. Wang, “Essential elements in tactical planning models for container liner shipping,” Transportation Research Part B: Methodological, vol. 54, pp. 84–99, 2013. View at: Publisher Site  Google Scholar
 M. M. Golias, M. Boilé, and S. Theofanis, “Discrete berthscheduling problem: toward a unified mathematical formulation,” Transportation Research Record, vol. 2168, pp. 1–8, 2010. View at: Publisher Site  Google Scholar
 M. M. Golias, M. Boile, and S. Theofanis, “A lamdaoptimal based heuristic for the berth scheduling problem,” Transportation Research Part C: Emerging Technologies, vol. 18, no. 5, pp. 794–806, 2010. View at: Publisher Site  Google Scholar
 M. M. Golias, M. Boile, S. Theofanis, and C. Efstathiou, “The berthscheduling problem: maximizing berth productivity and minimizing fuel consumption and emissions production,” Transportation Research Record, vol. 2166, pp. 20–27, 2010. View at: Publisher Site  Google Scholar
 G. K. D. Saharidis, M. M. Golias, M. Boile, S. Theofanis, and M. G. Ierapetritou, “The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 1–4, pp. 377–393, 2010. View at: Publisher Site  Google Scholar
 M. M. Golias, “A biobjective berth allocation formulation to account for vessel handling time uncertainty,” Maritime Economics & Logistics, vol. 13, no. 4, pp. 419–441, 2011. View at: Publisher Site  Google Scholar
 J. Karafa, M. M. Golias, S. Ivey, G. K. D. Saharidis, and N. Leonardos, “The berth allocation problem with stochastic vessel handling times,” International Journal of Advanced Manufacturing Technology, vol. 65, no. 1–4, pp. 473–484, 2013. View at: Publisher Site  Google Scholar
 L. Zhen, “Tactical berth allocation under uncertainty,” European Journal of Operational Research, vol. 247, no. 3, pp. 928–944, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 L. Zhen, S. Wang, and K. Wang, “Terminal allocation problem in a transshipment hub considering bunker consumption,” Naval Research Logistics, vol. 63, no. 7, pp. 529–548, 2016. View at: Publisher Site  Google Scholar
 J. G. Jin, D.H. Lee, and J. X. Cao, “Storage yard management in maritime container terminals,” Transportation Science, vol. 50, no. 4, pp. 1300–1313, 2014. View at: Publisher Site  Google Scholar
 L. Zhen, “Container yard template planning under uncertain maritime market,” Transportation Research Part E: Logistics and Transportation Review, vol. 69, pp. 199–217, 2014. View at: Publisher Site  Google Scholar
 L. Zhen, “Modeling of yard congestion and optimization of yard template in container ports,” Transportation Research Part B: Methodological, vol. 90, pp. 83–104, 2016. View at: Publisher Site  Google Scholar
 J. G. Jin, D.H. Lee, and H. Hu, “Tactical berth and yard template design at container transshipment terminals: a column generation based approach,” Transportation Research Part E: Logistics and Transportation Review, vol. 73, pp. 168–184, 2015. View at: Publisher Site  Google Scholar
 L. Zhen, Z. Xu, K. Wang, and Y. Ding, “Multiperiod yard template planning in container terminals,” Transportation Research Part B: Methodological, vol. 93, pp. 700–719, 2016. View at: Publisher Site  Google Scholar
 Y. Du, Q. Chen, X. Quan, L. Long, and R. Y. K. Fung, “Berth allocation considering fuel consumption and vessel emissions,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 6, pp. 1021–1037, 2011. View at: Publisher Site  Google Scholar
 M. Golias, I. Portal, D. Konur, E. Kaisar, and G. Kolomvos, “Robust berth scheduling at marine container terminals via hierarchical optimization,” Computers and Operations Research, vol. 41, pp. 412–422, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 L. Zhen, T. Shen, S. Wang, and S. Yu, “Models on ship scheduling in transshipment hubs with considering bunker cost,” International Journal of Production Economics, vol. 173, pp. 111–121, 2016. View at: Publisher Site  Google Scholar
 Z. Liu, S. Wang, W. Chen, and Y. Zheng, “Willingness to board: a novel concept for modeling queuing up passengers,” Transportation Research Part B: Methodological, vol. 90, pp. 70–82, 2016. View at: Publisher Site  Google Scholar
 D. Z. W. Wang and B. Du, “Reliabilitybased modeling of parkandride service on linear travel corridor,” Transportation Research Record, vol. 2333, pp. 16–26, 2013. View at: Publisher Site  Google Scholar
 B. Du and D. Z. W. Wang, “Continuum modeling of parkandride services considering travel time reliability and heterogeneous commuters—a linear complementarity system approach,” Transportation Research Part E: Logistics and Transportation Review, vol. 71, pp. 58–81, 2014. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2017 Shuaian Wang 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.