3 research outputs found
Model and heuristic solutions for the multiple double-load crane scheduling problem in slab yards
This article studies a multiple double-load crane scheduling problem in steel slab yards. Consideration of multiple cranes and their double-load capability makes the scheduling problem more complex. This problem has not been studied previously. We first formulate the problem as a mixed-integer linear programming (MILP) model. A two-phase model-based heuristic is then proposed. To solve large problems, a pointer-based discrete differential evolution (PDDE) algorithm was developed with a dynamic programming (DP) algorithm embedded to solve the one-crane subproblem for a fixed sequence of tasks. Instances of real problems are collected from a steel company to test the performance of the solution methods. The experiment results show that the model can solve small problems optimally, and the solution greatly improves the schedule currently used in practice. The two-phase heuristic generates near-optimal solutions, but it can still only solve comparatively modest problems within reasonable (4 h) computational timeframes. The PDDE algorithm can solve large practical problems relatively quickly and provides better results than the two-phase heuristic solution, demonstrating its effectiveness and efficiency and therefore its suitability for practical use
Menyelesaikan Container Stowage Problem (CSP) Menggunakan Algorithm Particel Swarm Optimization (PSO)
Container Stowage Problem (CSP) adalah permasalahan penataan kontainer kedalam kapal dengan memperhatikan beberapa aturan penataan kontainer pada kapal seperti: total berat kontainer, berat satu tumpukan kontainer, tujuan kontainer, keseimbangan kapal, dan peletakan kontainer pada kapal, sehingga masalah penataan kontainer termasuk Combinatorial Problems yang susah dipecahkan dengan teknik Enumerasi dan termasuk NP-Hard Problem sehingga penyelesaian terbaik dengan metoda heuristic. Tujuan dari penelitian ini untuk meminimasi jumlah shifting sehingga diperoleh waktu unloading yang minimum. Dalam penelitian ini algoritma diusulkan adalah Modifikasi Particle Swarm Optimization (PSO) dengan menambahkan aturan perubahan posisi tumpukan, perubahan tumpukan berdasarkan tujuan, dan perubahan tumpukan berdasarkan jenis berat tumpukan (Light, Medium, dan Heavy). Algoritma usulan diaplikasikan pada lima macam kasus dan dibandingkan dengan algoritma Modifikasi Bee Swarm Optimization. Hasilnya algoritma PSO modifikasi lebih baik dari Bee Swarm Optimization (BSO) Modifikasi dengan nilai %Gap dan Gap bernilai negative yang artinya solusi dari PSO Modifikasi lebih kecil dari solusi BSO Modifikasi, perbandingan PSO Modifikasi terhadap solusi optimal dari Heuristik nilai rata-rata %Gap 0,87 persen dan Gap 60 detik, nilai ini lebih baik dari perbandingan BSO Modifikasi terhadap solusi optimal dari Heuristik dengan nilai rata-rata %Gap 2,98 persen dan Gap 459,6 detik
==================================================================================================================
Container Stowage Problem (CSP) is the structuring of containers onto the ship with respect to some rules of the arrangement of containers on ships such as: total weight of the container, the weight of the pile of container, goal container, the balance of the ship, and the laying of containers on the ship, so the problem of structuring the container including Combinatorial Problems the trouble solving techniques Enumeration and included NP-Hard problem so the best solution with heuristic methods. The purpose of this study to minimize the amount of shifting in order to obtain the minimum unloading time. In this study, the proposed algorithm is Modified Particle Swarm Optimization (PSO) by adding a pile of position changes, changes in piles according to destination, and changes based on the type of heavy piles of piles (Light, Medium, and Heavy). The proposed algorithm was applied to the five kinds of cases and compared with the modification Bee Swarm Optimization algorithm. The result is a modified PSO algorithm is better than BSO Modifications to the value % Gap and Gap worth negative which means that the solution of Modified PSO smaller than Bee Swarm Optimization (BSO) solutions Modified, Modified PSO comparison to the optimal solution of a heuristic average % Gap and Gap value of 0.87 percent and 60 seconds, this value is better than the comparison BSO Modifications to the optimal solution of heuristics with an average % Gap and Gap value of 2.98 percent and 459.6 seconds
ν΄μ΄λ¬Όλ₯μμμ μ μ΄μ 컨ν μ΄λ ν¨κ³Ό λΆμ
νμλ
Όλ¬Έ(λ°μ¬) -- μμΈλνκ΅λνμ : 곡과λν μ°μ
곡νκ³Ό, 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λ°