Liner hub-and-spoke shipping network design

This paper proposes a liner hub-and-spoke shipping network design problem by introducing the concept of a main port, as well as some container shipping constraints such as multi-type container shipment and transit time constraints, which are seldom considered in the previous studies. It develops a mixed-integer programming model with nonconvex multi-linear terms for the proposed problem. An efficient genetic algorithm embedded with a multi-stage decomposition approach is developed to solve the model. Numerical experiments are carried out to assess the effectiveness of the proposed model and the efficiency of the proposed algorithm.     

A novel modeling approach for the fleet deployment problem within a short-term planning horizon

This paper is concerned with model development for a short-term fleet deployment problem of liner shipping operations. We first present a mixed integer nonlinear programming model in which the optimal vessel speeds for different vessel types on different routes are interpreted as their realistic optimal travel times. We then linearize the proposed nonlinear model and obtain a mixed integer linear programming (MILP) model that can be efficiently solved by a standard mixed integer programming solver such as CPLEX. The MILP model determines the optimal route service frequency pattern and take into account the time window constraints of shipping services. Finally, we report our numerical results and performance of CPLEX on randomly generated instances.     

Combined fleet deployment and inventory management in roll-on/roll-off shipping

In maritime transportation of automobiles, roll-on/roll-off (ro–ro) shipping companies operate liner shipping services across major trade routes. Large ro–ro shipping companies are well placed to offer end-to-end integrated logistics services to auto manufacturers engaged in international trade of vehicles. Therefore, we present a new mixed integer programming model for fleet deployment including inventory management at the ports along each trade route. Due to the complexity of the problem, a rolling horizon heuristic (RHH) is proposed. The RHH solves the problem by iteratively solving sub-problems with shorter planning horizon. Computational results based on real instances are presented.     

Global intermodal liner shipping network design

This paper presents a holistic analysis for the network design problem of the intermodal liner shipping system. Existing methods for liner shipping network design mainly deal with port-to-port demand. However, most of the demand has inland origins and/or destinations. Thus, it is necessary to cope with inland origin–destination (OD) pairs involving a change in transport mode from inland transportation to maritime shipping. A method is first proposed to convert inland OD demand to port-to-port demand. Then, a framework for global intermodal liner shipping network design is proposed. Finally, the proposed methodology is applied to and numerically verified by a large-scale network example.     

The time constrained multi-commodity network flow problem and its application to liner shipping network design

The multi-commodity network flow problem is an important sub-problem in several heuristics and exact methods for designing route networks for container ships. The sub-problem decides how cargoes should be transported through the network provided by shipping routes. This paper studies the multi-commodity network flow problem with transit time constraints which puts limits on the duration of the transit of the commodities through the network. It is shown that for the particular application it does not increase the solution time to include the transit time constraints and that including the transit time is essential to offer customers a competitive product.     

Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning

This paper aims to measure the perceived container leasing prices at different ports by presenting a two-stage optimization method. In stage I, we propose a practical liner shipping network design problem with empty container repositioning. The proposed problem further considers the use of foldable containers and allows the mutual substitution between empty containers to decrease the number of empty containers to be repositioned. In stage II, the inverse optimization technique is used to determine the perceived container leasing prices at different ports, based on the solution obtained in stage I. Based on a set of candidate liner shipping service routes, a mixed-integer nonlinear programming model is built for the proposed problem in stage I. The nonlinear terms are linearized by introducing the auxiliary variables. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of our two-stage optimization method.     

Robust hub network design problem

This paper presents a robust formulation for the uncapacitated single and multiple allocation hub location problem where demand is uncertain and its distribution is not fully specified. The proposed robust model is formulated as a mixed integer nonlinear program and then transformed into a mixed integer conic quadratic program. An efficient linear relaxation strategy is proposed which is found to deliver the optimal solutions for all the cases considered in this paper. Numerical experiments suggest location of more number of hubs when accounting for demand uncertainty using robust optimization compared to the deterministic setting.     

Dynamics of liner shipping network and port connectivity in supply chain systems: analysis on East Asia

The study of ports in supply chain systems is an emerging area of importance which has drawn more attention from researchers in recent years. This paper presents a new perspective in this research area by examining the calling patterns of container shipping services in order to understand the dynamics of port connectivity and inter-port relationships in the supply chains. Empirical evidence is drawn from four major ports in East Asia, namely Shanghai, Busan, Kaohsiung and Ningbo. The study identifies the shipping capacity, trade routes and geographical regions connected to the ports, shipping lines involved, and the extensity and intensity of inter-port relationships among the four container ports from liner shipping network’s perspective. The findings show that most of the shipping capacity employed on the major east–west trade routes became non-exclusive and involved calls at two or more of the four ports. Port planners, terminal operators and carriers could capitalise on opportunities through exploitation of complementary relationships that exist among the selected ports, such as offering a package for shipping lines to call at a portfolio of terminals owned by the same terminal operator. Policy and research implications as well as recommendations are discussed for various stakeholders concerned with port planning and regional development.     

Modeling and optimizing the integrated problem of closed-loop supply chain network design and disassembly line balancing

This paper describes an integrated model that jointly optimizes the strategic and tactical decisions of a closed-loop supply chain (CLSC). The strategic level decisions relate to the amounts of goods flowing on the forward and reverse chains. The tactical level decisions concern balancing disassembly lines in the reverse chain. The objective is to minimize costs of transportation, purchasing, refurbishing, and operating the disassembly workstations. A nonlinear mixed integer programming formulation is described for the problem. Numerical examples are presented using the proposed model.     

An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain

This paper proposes a multi-objective possibilistic programming model to design a sustainable medical supply chain network under uncertainty considering conflicting economic, environmental and social objectives. Effective social and environmental life cycle assessment-based methods are incorporated in the model to estimate the relevant environmental and social impacts. An accelerated Benders decomposition algorithm utilizing three efficient acceleration mechanisms is devised to cope with computational complexity of solving the proposed model. Computational analysis is also provided by using a medical industrial case study to present the significance of the proposed model as well as the efficiency of the accelerated Benders decomposition algorithm.