Semi-liner Shipping Service Design

2020 ◽  
Vol 54 (5) ◽  
pp. 1288-1306 ◽  
Author(s):  
Yadong Wang ◽  
Qiang Meng
Keyword(s):  
Decomposition Method ◽  
Demand Uncertainty ◽  
Programming Model ◽  
Service Design ◽  
Decomposition Methods ◽  
Liner Shipping ◽  
Branch And Cut ◽  
Mixed Integer ◽  
Acceleration Techniques ◽  
Stochastic Mixed Integer Programming

Semi-liner shipping transports various types of cargo, such as containers, break-bulk cargo, and heavy-lift project cargo, between different ports. Similar to liner shipping, semi-liner shipping publishes shipping routes for customers’ reference. However, it does not strictly follow the published route and usually makes some adjustments for each ship voyage by adding some port calls to transport more cargo considering the excess ship capacity. This study first proposes the semi-liner shipping service design (SLSSD) problem that aims to maximize the shipping profit by determining a shipping route subject to the potential adjustments. The proposed SLSSD problem is subsequently formulated as a two-stage stochastic mixed integer programming model with integer recourse variables. The first stage determines the visit sequence of a set of compulsory ports under shipping demand uncertainty. The second stage decides whether to add or remove some ports in the route in view of the realized shipping demand for each ship voyage. To effectively solve the model, two decomposition methods are developed, namely, the stage decomposition method and the scenario decomposition method, that decompose the problem by stage and demand scenario, respectively. In addition, two novel acceleration techniques are also provided to expedite the scenario decomposition method. Numerical experiments reveal satisfactory efficiency of these two methods to solve the semi-liner shipping service design problem, especially the scenario decomposition method, which is generally better than the stage decomposition method and can be thousands of times faster than the classic branch-and-cut algorithm.

scholarly journals Designing a Resilient and Sustainable Logistics Network under Epidemic Disruptions and Demand Uncertainty

2021 ◽  
Vol 13 (24) ◽  
pp. 14053
Author(s):  
Aymen Aloui ◽  
Nadia Hamani ◽  
Laurent Delahoche
Keyword(s):  
Demand Uncertainty ◽  
Programming Model ◽  
Mixed Integer ◽  
Design Strategies ◽  
Logistics Network ◽  
Location Allocation ◽  
Logistics Networks ◽  
Sustainable Logistics ◽  
Stochastic Mixed Integer Programming ◽  
Demand Fluctuations

To face the new challenges caused by modern industry, logistics operations managers need to focus more on integrating sustainability goals, adapt to unexpected disruptions and find new strategies and models for logistics management. The COVID-19 pandemic has proven that unforeseen fragilities, negatively affecting the supply chain performance, can arise rapidly, and logistics systems may confront unprecedented vulnerabilities regarding network structure disruption and high demand fluctuations. The existing studies on a resilient logistics network design did not sufficiently consider sustainability aspects. In fact, they mainly addressed the independent planning of decision-making problems with economic objectives. To fill this research gap, this paper concentrates on the design of resilient and sustainable logistics networks under epidemic disruption and demand uncertainty. A two-stage stochastic mixed integer programming model is proposed to integrate key decisions of location–allocation, inventory and routing planning. Moreover, epidemic disruptions and demand uncertainty are incorporated through plausible scenarios using a Monte Carlo simulation. In addition, two resiliency strategies, namely, capacity augmentation and logistics collaboration, are included into the basic model in order to improve the resilience and the sustainability of a logistics chain network. Finally, numerical examples are presented to validate the proposed approach, evaluate the performance of the different design models and provide managerial insights. The obtained results show that the integration of two design strategies improves resilience and sustainability.

scholarly journals Location of regional and international hub ports in liner shipping

2017 ◽  
Vol 2 (2) ◽  
pp. 114-125 ◽  
Author(s):  
Jianfeng Zheng ◽  
Cong Fu ◽  
Haibo Kuang
Keyword(s):  
Design Methodology ◽  
Location Problem ◽  
Programming Model ◽  
Liner Shipping ◽  
Mixed Integer ◽  
Eastern Asia ◽  
Hub Location ◽  
Hub Location Problem ◽  
Content Type ◽  
Western Asia

Purpose This paper aims to investigate the location of regional and international hub ports in liner shipping by proposing a hierarchical hub location problem. Design/methodology/approach This paper develops a mixed-integer linear programming model for the authors’ proposed problem. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of this model. Findings The results show that one international hub port (i.e. Rotterdam) and one regional hub port (i.e. Zeebrugge) are opened in Europe. Two international hub ports (i.e. Sokhna and Salalah) are located in Western Asia, where no regional hub port is established. One international hub port (i.e. Colombo) and one regional hub port (i.e. Cochin) are opened in Southern Asia. One international hub port (i.e. Singapore) and one regional hub port (i.e. Jakarta) are opened in Southeastern Asia and Australia. Three international hub ports (i.e. Hong Kong, Shanghai and Yokohama) and two regional hub ports (i.e. Qingdao and Kwangyang) are opened in Eastern Asia. Originality/value This paper proposes a hierarchical hub location problem, in which the authors distinguish between regional and international hub ports in liner shipping. Moreover, scale economies in ship size are considered. Furthermore, the proposed problem introduces the main ports.

Design of hydrogen supply chains under demand uncertainty – a case study of passenger transport in Germany

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Anton Ochoa Bique ◽  
Leonardo K. K. Maia ◽  
Ignacio E. Grossmann ◽  
Edwin Zondervan
Keyword(s):  
Stochastic Optimization ◽  
Demand Uncertainty ◽  
Programming Model ◽  
Cost Minimization ◽  
Water Electrolysis ◽  
Scenario Tree ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Strong Impact ◽  
Hydrogen Supply

Abstract A strategy for the design of a hydrogen supply chain (HSC) network in Germany incorporating the uncertainty in the hydrogen demand is proposed. Based on univariate sensitivity analysis, uncertainty in hydrogen demand has a very strong impact on the overall system costs. Therefore we consider a scenario tree for a stochastic mixed integer linear programming model that incorporates the uncertainty in the hydrogen demand. The model consists of two configurations, which are analyzed and compared to each other according to production types: water electrolysis versus steam methane reforming. Each configuration has a cost minimization target. The concept of value of stochastic solution (VSS) is used to evaluate the stochastic optimization results and compare them to their deterministic counterpart. The VSS of each configuration shows significant benefits of a stochastic optimization approach for the model presented in this study, corresponding up to 26% of infrastructure investments savings.

Network Design for Shipping Service of Large-Scale Intermodal Liners

2012 ◽  
Vol 2269 (1) ◽  
pp. 42-50 ◽  
Author(s):  
Qiang Meng ◽  
Shuaian Wang ◽  
Zhiyuan Liu
Keyword(s):  
Network Design ◽  
Large Scale ◽  
Programming Model ◽  
Transportation Network ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Hub And Spoke ◽  
Shipping Company ◽  
Proposed Model

A model was developed for network design of a shipping service for large-scale intermodal liners that captured essential practical issues, including consistency with current services, slot purchasing, inland and maritime transportation, multiple-type containers, and origin-to-destination transit time. The model used a liner shipping hub-and-spoke network to facilitate laden container routing from one port to another. Laden container routing in the inland transportation network was combined with the maritime network by defining a set of candidate export and import ports. Empty container flow is described on the basis of path flow and leg flow in the inland and maritime networks, respectively. The problem of network design for shipping service of an intermodal liner was formulated as a mixed-integer linear programming model. The proposed model was used to design the shipping services for a global liner shipping company.

scholarly journals Simultaneous Optimization of the Liner Shipping Route and Ship Schedule Designs with Time Windows

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Xi Jiang ◽  
Haijun Mao ◽  
Hao Zhang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Time Windows ◽  
Operating Cost ◽  
Optimal Solution ◽  
Liner Shipping ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Time Window Constraints ◽  
Call Sequence

This paper proposes to address the problem of the simultaneous optimization of the liner shipping route and ship schedule designs by incorporating port time windows. A mathematical programming model was developed to minimize the carrier’s total operating cost by simultaneously optimizing the port call sequence, ship arrival time per port of call, and sailing speed per shipping leg under port time window constraints. In view of its structure, the nonlinear nonconvex optimization model is further transformed into a mixed-integer linear programming model that can be efficiently solved by extant solvers to provide a global optimal solution. The results of the numerical experiments performed using a real-world case study indicated that the proposed model performs significantly better than the models that handle the design problems separately. The results also showed that different time windows will affect the optimal port call sequence. Moreover, port time windows, bunker price, and port efficiency all affect the total operating cost of the designed shipping route.

scholarly journals Optimal Container Routing in Liner Shipping Networks Considering Repacking 20 ft Containers into 40 ft Containers

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Shuaian Wang ◽  
Xiaobo Qu ◽  
Tingsong Wang ◽  
Wen Yi
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Liner Shipping ◽  
Mixed Integer ◽  
Integer Linear Programming Model ◽  
Handling Cost ◽  
Shipping Networks ◽  
Holistic Manner

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 mixed-integer 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.

scholarly journals A Stochastic Surgery Sequencing Model Considering the Moral and Human Virtues

2016 ◽  
Vol 10 (9) ◽  
pp. 68 ◽  
Author(s):  
Gerami Farzad ◽  
Saidi Mehrabad Mohammad
Keyword(s):  
Operating Room ◽  
Programming Model ◽  
Human Dimensions ◽  
Mixed Integer ◽  
Surgical Time ◽  
Operating Room Personnel ◽  
Sequencing Problem ◽  
Stochastic Mixed Integer Programming ◽  
Constraint Problem ◽  
The Cost

In this research, we will work sequencing problem of patients demanding surgery under uncertainty in times (including the surgical time, time to prepare the operating room, patient awake time before transferring to the recovery room …). For this problem, a stochastic mixed integer programming model as Stochastic Surgery Sequencing Model (S3M) has been developed.Since this model is achance-constraint problem, which makes it very complex. This problem aims to minimize the cost of operating room personnel overtime and to reduce patient’s waiting time. In mathematical schedule models, we consider three level of patient’s priority ( ). Based on these moral and human dimensions, decision maker can prioritize patients. Restrictions on the balance the operating roomsand priorities for patients are all from the real-world constraints, are included in this issue. A branch-reduce-cut algorithm is used to solve the model.

Sign in / Sign up

Export Citation Format

Share Document