A two-stage stochastic nonlinear integer-programming model for slot allocation of a liner container shipping service

2021 ◽  
Vol 150 ◽  
pp. 143-160
Author(s):  
Tingsong Wang ◽  
Qiang Meng ◽  
Shuaian Wang ◽  
Xiaobo Qu
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.


Author(s):  
Matthew G. Karlaftis ◽  
Konstantinos L. Kepaptsoglou ◽  
Antony Stathopoulos

Paratransit services can be useful for special events, especially when private vehicles are discouraged from approaching the event locations. During the Athens 2004 Olympics, such a shuttle service was planned to connect major Athens spots with athletic complexes. A mixed nonlinear integer programming model is developed for jointly obtaining optimal headways and vehicle types for such a paratransit service, given demand, resource, and travel time constraints. The model is incorporated into a user-friendly Microsoft Excel–based interface. An application of the model to the Athens 2004 Olympics and its results are presented and discussed.


Information ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 188
Author(s):  
ZhiJian Ye ◽  
YanWei Li ◽  
JingTing Bai ◽  
XinXin Zheng

The purpose of this study is to ascertain whether implementation difficulty can be used in a slot allocation model as a new mechanism for slightly weakening grandfather rights; according to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within the slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.


Sign in / Sign up

Export Citation Format

Share Document