공컨테이너관리 기법을 활용한 효율적인 컨테이너 공급망

학위논문 (박사) -- 서울대학교 대학원 : 공과대학 산업공학과, 2021. 2. 문일경.Due to a remarkable surge in global trade volumes led by maritime transportation, shipping companies should make a great effort in managing their container flows especially in case of carrier-owned containers. To do so, they comprehensively implement empty container management strategies and accelerate the flows in a cost- and time-efficient manner to minimize total relevant costs while serving the maximal level of customers demands. However, many critical issues in container flows universally exist due to high uncertainty in reality and hinder the establishment of an efficient container supply chain. In this dissertation, we fully discuss such issues and provide mathematical models along with specific solution procedures. Three types of container supply chain are presented in the following: (i) a two-way four-echelon container supply chain; (ii) a laden and empty container supply chain under decentralized and centralized policies; (iii) a reliable container supply chain under disruption. These models explicitly deal with high risks embedded in a container supply chain and their computational experiments offer underlying managerial insights for the management in shipping companies. For (i), we study empty container management strategy in a two-way four-echelon container supply chain for bilateral trade between two countries. The strategy reduces high maritime transportation costs and long delivery times due to transshipment. The impact of direct shipping is investigated to determine the number of empty containers to be repositioned among selected ports, number of leased containers, and route selection to satisfy the demands for empty and laden containers for exporters and importers in two regions. A hybrid solution procedure based on accelerated particle swarm optimization and heuristic is presented, and corresponding results are compared. For (ii), we introduce the laden and empty container supply chain model based on three scenarios that differ with regard to tardiness in the return of empty containers and the decision process for the imposition of fees with the goal of determining optimal devanning times. The effectiveness of each type of policy - centralized versus decentralized - is determined through computational experiments that produce key performance measures including the on-time return ratio. Useful managerial insights on the implementation of these polices are derived from the results of sensitivity analyses and comparative studies. For (iii), we develop a reliability model based on container network flow while also taking into account expected transportation costs, including street-turn and empty container repositioning costs, in case of arc- and node-failures. Sensitivity analyses were conducted to analyze the impact of disruption on container supply chain networks, and a benchmark model was used to determine disruption costs. More importantly, some managerial insights on how to establish and maintain a reliable container network flow are also provided.해상 수송이 주도함으로써 전 세계 무역량이 급증하기 때문에 회사 소유 컨테이너는 컨테이너 흐름을 관리하는 데 많은 노력을 기울여야 한다. 이를 위해 공 컨테이너 관리 전략을 포괄적으로 구현하고 효율적인 수송 비용 및 시간 절감 방식으로 컨테이너 흐름을 원활히 하여 관련 총비용을 최소화하는 동시에 고객의 수요를 최대한 충족하게 된다. 그러나 현실에서는 높은 불확실성 때문에 컨테이너 흐름에 대한 많은 주요한 이슈가 보편적으로 존재하고 효율적인 컨테이너 공급망 구축을 방해한다. 본 논문에서는 이러한 이슈에 대해 전반적으로 논의하고 적절한 해법과 함께 수리 모형을 제공한다. 이를 위해 세 가지 유형의 컨테이너 공급망을 다룬다. 먼저 (i) 양방향 네 단계 컨테이너 공급망, (ii) 분권화 및 중앙 집중화 정책에 따른 적∙공 컨테이너 공급망; 그리고 (iii) disruption 상황 속에서 신뢰성을 고려하는 컨테이너 공급망이다. 본 논문에서 제시한 세 가지 모형은 컨테이너 공급망에 내재 된 높은 위험을 직접 다루며 계산 실험은 해운 회사의 경영진이나 관계자를 위해 주요한 관리 인사이트를 제공한다. (i)의 경우, 두 지역 간 양자 무역을 위한 양방향 네 단계 컨테이너 공급망에서 공 컨테이너 관리 전략을 연구한다. 이 전략은 환적으로 인한 높은 해상 운송 비용과 긴 배송 시간을 줄일 수 있다. 또한, 직항 수송의 영향을 조사하여 선택된 항구 중 재배치 할 공 컨테이너 수, 임대 컨테이너 수, 두 지역의 수출업자와 수입업자의 적∙공 컨테이너 대한 수요를 만족하기 위한 경로 선택을 결정하게 된다. APSO 및 휴리스틱을 기반으로 하는 하이브리드 해법을 제시하며 비교 실험을 하였다. (ii)의 경우 최적 devanning time 결정을 목표로 공 컨테이너의 반환 지연과 해당 수수료 부과 결정 프로세스와 관련하여 서로 다른 세 가지 시나리오를 기반으로 적∙공 컨테이너 공급망 모형을 제시한다. 각 유형의 정책적(분권화 및 중앙 집중화) 효과는 정시 반환율을 포함한 주요 성능 측정을 고려하는 계산 실험을 통해 결정된다. 이러한 정책 실행에 대한 유용한 관리 인사이트는 민감도 분석 및 비교 연구의 결과에서 도출한다. (iii)의 경우, 본 논문은 컨테이너 네트워크 흐름을 기반으로 하는 신뢰성 모형을 개발하는 동시에 아크 및 노드 failure가 있을 때 street-turn 및 공 컨테이너 재배치 비용을 포함한 기대 총 비용을 구한다. 중단이 컨테이너 공급망 네트워크에 미치는 영향을 분석하기 위해 민감도 분석을 수행했으며 disruption 비용을 결정하기 위해 벤치마크 모형을 활용한다. 더불어 신뢰성을 고려한 컨테이너 네트워크 흐름을 구축하고 신뢰성을 유지하는 방법에 대한 관리적 인사이트도 제공한다.Abstract i Contents ii List of Tables vi List of Figures viii 1. Introduction 1 1.1 Empty Container Repositioning Problem 1 1.2 Reliability Problem 3 1.3 Research Motivation and Contributions 4 1.4 Outline of the Dissertation 7 2. Two-Way Four-Echelon Container Supply Chain 8 2.1 Problem Description and Literature Review 8 2.2 Mathematical Model for the TFESC 15 2.2.1 Overview and Assumptions 15 2.2.2 Notation and Formulation 19 2.3 Solution Procedure for the TFESC 25 2.3.1 Pseudo-Function-based Optimization Problem 25 2.3.2 Objective Function Evaluation 28 2.3.3 Heuristics for Reducing the Number of Leased Containers 32 2.3.4 Accelerated Particle Swarm Optimization 34 2.4 Computational Experiments 37 2.4.1 Heuristic Performances 39 2.4.2 Senstivity Analysis of Varying Periods 42 2.4.3 Senstivity Analysis of Varying Number of Echelons 45 2.5 Summary 48 3. Laden and Empty Container Supply Chain under Decentralized and Centralized Policies 50 3.1 Problem Description and Literature Review 50 3.2 Scenario-based Model for the LESC-DC 57 3.3 Model Development for the LESC-DC 61 3.3.1 Centralized Policy 65 3.3.2 Decentralized Policies (Policies I and II) 67 3.4 Computational Experiments 70 3.4.1 Numerical Exmpale 70 3.4.2 Sensitivity Analysis of Varying Degree of Risk in Container Return 72 3.4.3 Sensitivity Analysis of Increasing L_0 74 3.4.4 Sensitivity Analysis of Increasing t_r 76 3.4.5 Sensitivity Analysis of Decreasing es and Increasing e_f 77 3.4.6 Sensitivity Analysis of Discounting 〖pn〗_{f1} and 〖pn〗_{f2} 78 3.4.7 Sensitivity Analysis of Different Container Fleet Sizes 79 3.5 Managerial Insights 81 3.6 Summary 83 4. Reliable Container Supply Chain under Disruption 84 4.1 Problem Description and Literature Review 84 4.2 Mathematical Model for the RCNF 90 4.3 Reliability Model under Disruption 95 4.3.1 Designing the Patterns of q and s 95 4.3.2 Objective Function for the RCNF Model 98 4.4 Computational Experiments 103 4.4.1 Sensitivity Analysis of Expected Failure Costs 106 4.4.2 Sensitivity Analysis of Different Network Structures 109 4.4.3 Sensitivity Analysis of Demand-Supply Variation 112 4.4.4 Managerial Insights 115 4.5 Summary 116 5. Conclusions and Future Research 117 Appendices 120 A Proof of Proposition 3.1 121 B Proof of Proposition 3.2 124 C Proof of Proposition 3.3 126 D Sensitivity Analyses for Results 129 E Data for Sensitivity Analyses 142 Bibliography 146 국문초록 157 감사의 글 160Docto

Assessing the eco-efficiency benefits of empty container repositioning strategies via dry ports

Trade imbalances and global disturbances generate mismatches in the supply and demand of empty containers (ECs) that elevate the need for empty container repositioning (ECR). This research investigated dry ports as a potential means to minimize EC movements, and thus reduce costs and emissions. We assessed the environmental and economic effects of two ECR strategies via dry ports—street turns and extended free temporary storage—considering different scenarios of collaboration between shipping lines with different levels of container substitution. A multiparadigm simulation combined agent-based and discrete-event modelling to represent flows and estimate kilometers travelled, CO2 emissions, and costs resulting from combinations of ECR strategies and scenarios. Full ownership container substitution combined with extended free temporary storage at the dry port (FTDP) most improved ECR metrics, despite implementation challenges. Our results may be instrumental in increasing shipping lines’ collaboration while reducing environmental impacts in up to 32 % of the inland ECR emissions

해운물류에서의 접이식 컨테이너 효과 분석

학위논문(박사) -- 서울대학교대학원 : 공과대학 산업공학과, 2022.2. 문일경.컨테이너 화 이후로 해상 물류는 폭발적으로 증가하였고 세계화와 산업 발전을 선도하였다. 하지만 무역량의 증가와 비례하여 수출입 불균형으로 인한 컨테이너의 불균형 문제도 심화되었다. 이러한 문제를 해결하기 위해 다양한 연구자들의 노력이 있었고, 그 중 접이식 컨테이너라는 새로운 개념의 컨테이너가 개발되었다. 하지만 아직 접이식 컨테이너는 상용화 초기 단계이며, 이를 활용한 여러 효과에 대한 연구는 부족한 실정이다. 본 논문에서는 접이식 컨테이너가 도입되었을 때 미칠 수 있는 영향과 그 효과에 대해 다루었다. 먼저 접이식 컨테이너가 크레인 활동에 미치는 영향을 분석하고, 전역적 관점으로 크레인 활동을 줄일 수 있는 방법에 대해 분석하였다. 두 번째로 육상에서의 접이식 컨테이너 적용이 해상과는 다르다는 점에 주목하여 그 효과를 분석하였다. 마지막으로 2008 금융위기와 COVID-19 이후에 증가하고 있는 해운물류의 각종 변동하는 상황 하에서의 접이식 컨테이너 효과에 대해 새로운 통찰을 제공하였다. 1장에서는 간단하게 컨테이너화와 접이식 컨테이너에 대해 설명하고 문제를 주목하게 된 이유와 그 성과를 서술하였다. 2장에서는 접이식 컨테이너가 도입됨에 따라 생길 수 있는 ‘상단 적재 규칙’이 적용되었을 때의 크레인 활동의 변화를 살펴보고 전역적 최적화가 지역적 최적화보다 효과적임을 보였다. 더불어 전역적 최적화를 도입하였을 때 직면할 수 있는 비용 분배 문제에 대해서도 조망하여 그 해결책을 제시하였다. 3장에서는 육상에서 접이식 컨테이너가 수송공간을 줄여주는 장점 외에 경로를 바꾸는 효과가 존재함을 보이고, 다양한 시나리오와 정책에 따라 그 효과가 어떻게 변화하는지에 대해 분석하였다. 4장에서는 증가하는 다양한 변동상황 각각에 대해 접이식 컨테이너의 효과에 대해 분석하였다. 이를 토대로 각 상황에 맞는 최적 접이식 컨테이너 개수를 도출하고 임대 정책을 통해 대응할 수 있다는 통찰을 도출하였다. 5장에서는 본 논문의 결론과 향후 연구 방안에 대해 서술하였다. 본 논문에서 제안하는 문제와 그 해결 방법은 학술적 및 산업적으로 의미가 있다. 학계에는 실제 존재하는 현장의 문제들을 제시하고 문제를 효과적으로 해결할 수 있는 방법들을 제안한다. 산업계에는 신기술인 접이식 컨테이너의 도입에 따라 발생할 수 있는 문제에 대해 정량화 및 모형화를 통한 해결방법을 제시한다. 본 논문을 통해 산업의 발전과 학문의 발전이 함께 이루어질 수 있을 것으로 기대한다.After containerization, maritime logistics experienced the substantial growth of trade volumes and led to globalization and industrial development. However, in proportion to the increase in the volume, the degree of container imbalance also intensified due to the disparity between importing and exporting sizes at ports in different continents. A group of researchers is digging into resolving this ongoing challenge, and a new concept of a container, called a foldable container, has been proposed. Nevertheless, foldable containers are still in the early stage of commercialization, and research on the various effects of using foldable containers seems insufficient yet. This dissertation considers the possible effects of the introduction of foldable containers. First, we analyze the effect of foldable containers on crane operation and reduce shifts from a global perspective. Second, the effect of using foldable containers in hinterland areas was analyzed by noting that the application of foldable containers on land was different from that of the sea. Finally, we provided new insights into the foldable container under plausible dynamic situations in the shipping industry during the COVID-19 and logistics that have increased since the 2008 financial crisis. A brief explanation of containerization and foldable containers is introduced in Chapter 1, along with the dissertation's motivations, contributions, and outlines. Chapter 2 examines changes in crane operation when the 'top stowing rule' that can be treated with foldable containers is applied and shows that global optimization is more effective than local optimization. In addition, we suggested the cost-sharing method to deal with fairness issues for additional costs between ports when the global optimization method is fully introduced. Chapter 3 shows that foldable containers in the hinterland have the effect of changing routes in addition to reducing transportation space and analyzes how the results change according to various scenarios and policies. Chapter 4 analyzes the effectiveness of foldable containers for different dynamic situations. Moreover, the managerial insight was derived that the optimal number of foldable containers suitable for each situation can be obtained and responded to leasing policies. Chapter 5 describes the conclusions of this dissertation and discusses future research. The problem definition and solution methods proposed in this dissertation can be seen as meaningful in both academic and industrial aspects. For academia, we presented real-world problems in the field and suggested ways to solve problems effectively. For industry, we offered solutions through quantification and modeling for real problems related to foldable containers. We expect that industrial development and academic achievement can be achieved together through this dissertation.Chapter 1 Introduction 1 1.1 Containerization and foldable container 1 1.2 Research motivations and contributions 3 1.3 Outline of the dissertation 6 Chapter 2 Efficient stowage plan with loading and unloading operations for shipping liners using foldable containers and shift cost-sharing 7 2.1 Introduction 7 2.2 Literature review 10 2.3 Problem definition 15 2.4 Mathematical model 19 2.4.1 Mixed-integer programming model 19 2.4.2 Cost-sharing 24 2.5 Computational experiment and analysis 26 2.6 Conclusions 34 Chapter 3 Effects of using foldable containers in hinterland areas 36 3.1 Introduction 36 3.2 Single depot repositioning problem 39 3.2.1 Problem description 40 3.2.2 Mathematical formulation of the single depot repositioning problem 42 3.2.3 Effects of foldable containers 45 3.3 Multi-depot repositioning problem 51 3.4 Computational experiments 56 3.4.1 Experimental design for the SDRP 57 3.4.2 Experimental results for the SDRP 58 3.4.3 Major and minor effects with the single depot repositioning problem 60 3.5 Conclusions 65 Chapter 4 Effect of foldable containers in dynamic situation 66 4.1 Introduction 66 4.2 Problem description 70 4.3 Mathematical model 73 4.4 Computational experiments 77 4.4.1 Overview 77 4.4.2 Experiment results 79 4.5 Conclusions 88 Chapter 5 Conclusion and future research 90 Bibliography 94 국문초록 99박

Optimization in container liner shipping

We will give an overview of several decision problem encountered in liner shipping. We will cover problems on the strategic, tactical and operational planning levels as well as problems that can be considered at two planning levels simultaneously. Furthermore, we will shortly discuss some related problems in terminals, geographical bottlenecks for container ships and provide an overview of operations research methods used in liner shipping problems. Thereafter, the decision problems will be illustrated using a case study for six Indonesian ports

Optimization of empty container movements using street-turn: Application to Valencia hinterland

Empty maritime container logistics is one of the most relevant costs for shipping companies. In this paper two mathematical models (based on two different container movement patterns, i.e. with and without street-turns) were defined to optimize land empty container movements among shippers, consignees, terminals and depots, along with minimizing storage costs. One of the proposed optimization models was embedded in a simple Decision Support System (DSS) and then tested with real data, based on the operations in Valencia s (Spain) hinterland. The results obtained confirm the benefits of implementing these kinds of models for the company, and additional experiments assess and quantify the advantage of using the more complex approach that is able to implement street-turn patterns.This research has been funded by the Spanish Ministry of Science and Innovation through Grant DPI2010-16201 and FEDER.Furió, S.; Andrés Romano, C.; Adenso Díaz, B.; Lozano Segura, S. (2013). Optimization of empty container movements using street-turn: Application to Valencia hinterland. Computers and Industrial Engineering. 66(4):909-917. https://doi.org/10.1016/j.cie.2013.09.003S90991766

Models and algorithms for the empty container repositioning and its integration with routing problems

The introduction of containers has fostered intermodal freight transportation. A definition of intermodality was provided by the European Commission as “a characteristic of a transport system whereby at least two different modes are used in an integrated manner in order to complete a door-to-door transport sequence”. The intermodal container transportation leads to several benefits, such as higher productivity during handling phases and advantages in terms of security, losses and damages. However, the distribution of containers comes with a drawback: due to directional imbalances in freight flows, some areas tend to accumulate unnecessary empty containers, while others face container shortages. Several planning models were developed for carriers in order to manage both loaded and empty containers profitably. However, they were built to operate under normal circumstances, neglecting the fact that networks are increasingly affected by both uncertainty and vulnerability, which may result in disruptions. The thesis aims to survey whether the impact of uncertainty can be mitigated by a stochastic programming approach, in which disruptions and normal operations are both foreseen as possible futures or scenarios. This approach is carried out by a multi-scenario optimization model in which scenarios are linked by non-anticipativity conditions. The empty container repositioning becomes even more challenging and difficult when integrated with routing problems. In fact, carriers often face problems in which they must determine simultaneously how many empty containers are carried by a fleet of vehicles and which routes must be followed by these vehicles. These problems typically arise in inland networks, in which one must plan the distribution by trucks of loaded and empty containers to customers. The thesis addresses this type of vehicle routing problems, which are motivated by a real case study occurred during the collaboration with a carrier that operates in the Mediterranean Sea in door-to-door modality. The carrier manages a fleet of trucks based at the port. Trucks and containers are used to service two types of transportation requests, the delivery of container loads from the port to import customers, and the shipment of container loads from export customers to the port. The thesis addresses two problems which differ in the composition of the fleet of trucks. The first problem involves a heterogeneous fleet of trucks that can carry one or two containers. We present a Vehicle Routing Problem with backhauls, load splits into multiple visits, and the impossibility to separate trucks and containers during customer service. Then, we formalize the problem by an Integer Linear Programming formulation and propose an efficient meta-heuristic algorithm able to solve it. The meta-heuristic determines the initial solution by a variant of the Clarkeand-Wright algorithm, and improves it by several local search phases, in which both node movements and truck swaps are implemented. The second problem involves a homogeneous fleet of trucks that can carry more than a container. As a consequence, the identification of routes can be more difficult. We present and formalize the associated Vehicle Routing Problem by an Integer Linear Programming formulation. Then we propose an efficient adaptive guidance meta-heuristic algorithm able to solve it. The meta-heuristic determines an initial feasible solution by a Tabu Search step, and next improves this solution by appropriate adaptive guidance mechanisms

Models and algorithms for the empty container repositioning and its integration with routing problems

The introduction of containers has fostered intermodal freight transportation. A definition of intermodality was provided by the European Commission as “a characteristic of a transport system whereby at least two different modes are used in an integrated manner in order to complete a door-to-door transport sequence”. The intermodal container transportation leads to several benefits, such as higher productivity during handling phases and advantages in terms of security, losses and damages. However, the distribution of containers comes with a drawback: due to directional imbalances in freight flows, some areas tend to accumulate unnecessary empty containers, while others face container shortages. Several planning models were developed for carriers in order to manage both loaded and empty containers profitably. However, they were built to operate under normal circumstances, neglecting the fact that networks are increasingly affected by both uncertainty and vulnerability, which may result in disruptions. The thesis aims to survey whether the impact of uncertainty can be mitigated by a stochastic programming approach, in which disruptions and normal operations are both foreseen as possible futures or scenarios. This approach is carried out by a multi-scenario optimization model in which scenarios are linked by non-anticipativity conditions. The empty container repositioning becomes even more challenging and difficult when integrated with routing problems. In fact, carriers often face problems in which they must determine simultaneously how many empty containers are carried by a fleet of vehicles and which routes must be followed by these vehicles. These problems typically arise in inland networks, in which one must plan the distribution by trucks of loaded and empty containers to customers. The thesis addresses this type of vehicle routing problems, which are motivated by a real case study occurred during the collaboration with a carrier that operates in the Mediterranean Sea in door-to-door modality. The carrier manages a fleet of trucks based at the port. Trucks and containers are used to service two types of transportation requests, the delivery of container loads from the port to import customers, and the shipment of container loads from export customers to the port. The thesis addresses two problems which differ in the composition of the fleet of trucks. The first problem involves a heterogeneous fleet of trucks that can carry one or two containers. We present a Vehicle Routing Problem with backhauls, load splits into multiple visits, and the impossibility to separate trucks and containers during customer service. Then, we formalize the problem by an Integer Linear Programming formulation and propose an efficient meta-heuristic algorithm able to solve it. The meta-heuristic determines the initial solution by a variant of the Clarkeand-Wright algorithm, and improves it by several local search phases, in which both node movements and truck swaps are implemented. The second problem involves a homogeneous fleet of trucks that can carry more than a container. As a consequence, the identification of routes can be more difficult. We present and formalize the associated Vehicle Routing Problem by an Integer Linear Programming formulation. Then we propose an efficient adaptive guidance meta-heuristic algorithm able to solve it. The meta-heuristic determines an initial feasible solution by a Tabu Search step, and next improves this solution by appropriate adaptive guidance mechanisms