Stochastic Programming for Liner Ship Routing and Scheduling under Uncertain Sea Ice Conditions

Author(s):  
Jiaxuan Ding ◽  
Chi Xie

It is anticipated that in the foreseeable future the Northern Sea Route (NSR) will be able to serve commercial shipping as an alternative transportation shortcut between East Asia and Europe, especially in the summer season. The sailing time, however, is heavily subject to the variation of sea ice conditions along this route. Any participating shipping company must consider how to mitigate the ill effects on itinerary planning caused by sailing time and cost uncertainty. Finding a good trade-off between the benefit from a tight schedule and the risk caused by an unexpected delay is a key element in relevant routing and scheduling decisions, and may be beyond the reach of traditional deterministic planning models. With the aim of maximizing profit over all possible shipping environment scenarios, this article proposes a two-stage stochastic nonlinear integer programming model for liner ship routing and scheduling with uncertain shipping time and cost, the nonlinearity of which arises from the coexistence of schedule-sensitive shipping demand and uncertain arrival time variables in the objective function. The model is converted into an equivalent linear integer programming counterpart by introducing a set of nominal delay variables, and Benders decomposition is applied to solve the linearized problem. Numerical experiments and sensitivity analyses are conducted to validate the efficacy and effectiveness of the model, the results of which suggest several managerial insights that can be used to guide liner ship route and schedule planning under uncertain shipping conditions.

2014 ◽  
Vol 3 (2) ◽  
pp. 143-175 ◽  
Author(s):  
Charlotte Vilhelmsen ◽  
Richard Lusby ◽  
Jesper Larsen

2019 ◽  
Vol 1 (1) ◽  
pp. 30-44 ◽  
Author(s):  
Yuqiang Wang ◽  
Yuguang Wei ◽  
Hua Shi ◽  
Xinyu Liu ◽  
Liyuan Feng ◽  
...  

Purpose The purpose of this paper is to study the unit train make-up scheme for loaded direction in the heavy haul railway. Design/methodology/approach A 0-1 nonlinear integer programming model with the aim of minimizing the idling period between actual train arrival time and expected train arrival time for all loaded unit trains are proposed. Findings The proposed model is applied into a case study based on Daqin heavy haul railway. Results show that the proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway. Originality/value The proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Kerui Weng ◽  
Zi-hao Xu

This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers’ transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route could be acquired after paying fixed charges. The problem arises in the application of logistics, postal services, airline transportation, and so forth. We formulate the problem as a mixed-integer programming model, and provide two heuristic approaches, respectively, based on Lagrangian relaxation and Benders decomposition. Computational experiments show that the algorithms work well.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Hao Guo ◽  
Congdong Li ◽  
Ying Zhang ◽  
Chunnan Zhang ◽  
Yu Wang

Facility location, inventory management, and vehicle routing are three important decisions in supply chain management, and location-inventory-routing problems consider them jointly to improve the performance and efficiency of today’s supply chain networks. In this paper, we study a location-inventory-routing problem to minimize the total cost in a closed-loop supply chain that has forward and reverse logistics flows. First, we formulate this problem as a nonlinear integer programming model to optimize facility location, inventory control, and vehicle routing decisions simultaneously in such a system. Second, we develop a novel heuristic approach that incorporates simulated annealing into adaptive genetic algorithm to solve the model efficiently. Last, numerical analysis is presented to validate our solution approach, and it also provides meaningful managerial insight into how to improve the closed-loop supply chain under study.


2013 ◽  
Vol 441 ◽  
pp. 602-606
Author(s):  
Wei Jun Pan ◽  
Wen Bin Qiu ◽  
Rui Kang

A nonlinear integer programming model (NIPM) with constraints is proposed to solve the allocation of approach flight flow where ends with terminal airspace, an example of an airport terminal airspace is given, where the flow is accurately forecasted.Analysising flight delays, theres a conclusion: the results solved by NIPM is far better than the average allocation method, for the second-level airspace, NIPM can reduce two flight delays, and the allocation in each flight route tends to be equilibrium, NIPM can also provide air traffic controllers with accurate and reasonable allocation schedule.


2014 ◽  
Vol 52 (1) ◽  
pp. 28-38 ◽  
Author(s):  
Ahmad Hemmati ◽  
Lars Magnus Hvattum ◽  
Kjetil Fagerholt ◽  
Inge Norstad

Sign in / Sign up

Export Citation Format

Share Document