• Title/Summary/Keyword: Loading Balance Problem

Search Result 23, Processing Time 0.024 seconds

Development of a Micro-Computer based Program for the Three Dimensional Packing Problem (3차원 물품 적재에 관한 마이크로 컴퓨터용 프로그램 개발)

  • Hwang, Hark;Lee, Kwan-Jae;Sun, Ji-Ung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.55-76
    • /
    • 1997
  • This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

  • PDF

Maximum Profit Priority Goods First Loading Algorithm for Barge Loading Problem (바지선 적재 문제의 최대이득 물품 우선 적재 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.10
    • /
    • pp.169-173
    • /
    • 2014
  • Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.

NSGA-II Technique for Multi-objective Generation Dispatch of Thermal Generators with Nonsmooth Fuel Cost Functions

  • Rajkumar, M.;Mahadevan, K.;Kannan, S.;Baskar, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.423-432
    • /
    • 2014
  • Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

A Circular Load Stowing Scheme for Maintaining Weight Balance in Drones (드론 무게균형을 위한 원형의 부하 적재 방식)

  • Eun, Seongbae;Han, Sangsuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.2
    • /
    • pp.314-319
    • /
    • 2021
  • Problems that satisfy various constraints while maintaining weight balance in ships or aircraft were studied. In addition, a study was conducted to solve the problem with a mathematical method under the condition that the shape and weight of the load are the same and the m×n (m and n are all odd) mesh structures. The problem is that the existing mathematical weight balancing method is not suitable for circular structures. In this paper, we studied the load stowing problem in a circular space where objects are loaded at the vertices of N equilateral polygons. Assuming that all N conformal polygons have an even number of angles, it was proved that a loading method that always maintains weight balance regardless of the variety of number of loads. By providing the structure and loading method of the drone loading ship, we showed that our method was appropriate.

A multi-objective Loading/Routeing and Sequencing decision in a Flexible Manufacturing System (유연 생산시스템에서의 작업할당/경로선정/부품투입순서의 결정)

  • Lee, Young-Kwang;Chung, Byung-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.4
    • /
    • pp.41-48
    • /
    • 1993
  • Prime advantage of flexible manufacturing systems(FMS) is a flexibility. Flexibility is expected to prolong the service life of a manufacturing facility and enable it to respond quickly and economically to dynamic market change. The FMS loading decision is concerned with the allocation of operations and tools to machines subject to technological and capacity constraints of the system. Modern FMS loading problem has the multiple objectives such as processing cost, time and work load balance. We propose multi-objectives which could be used to formulate the loading/routeing problem and sequencing decision which should be adopted for each part type in order to maximize the machine flexibility by Hamming distance matrix based on Incidance matrix. Finally, a numerical example is provided to illustrate the proposed model.

  • PDF

Three-Dimensional Container Packing Problem (컨테이너 3차원 적재문제)

  • 배민주;최세경;김환성
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2003.05a
    • /
    • pp.242-248
    • /
    • 2003
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable size and the variable kind of freights. First we consider the total cost of container charges, i.e., loading, transportation and handling charges, where the priority of each frights are dealt. By minimizing the total cost of container charges, the kinds of container and its number can be decided automatically. From these factors, we con determine the position in the container and the loading sequence into the container. Finally, by equivalence of freight's weight in container, we can prevent the freight's damage on the handling.

  • PDF

An Optimal Algorithm for Weight Balancing in a 3D Mesh Architecture (3D 메쉬 구조에서 무게 균형을 위한 최적 알고리즘)

  • So, Sun Sup;Son, Kyung A;Eun, Seongbae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.8
    • /
    • pp.1095-1101
    • /
    • 2020
  • Vessels or aircraft should be loaded with containers or cargo to maintain weight balance in order to be stable when navigating the route. The container loading algorithm is known as the NP problem and several heuristic methods have been studied. Containers can be characterized by the uniform volume and weight, which makes it easier to find an optimal loading method. In this paper, we propose an algorithm for weight balance when the volume and weight of an object are uniform. It is assumed that the loading space has a special structure of m * n mesh (where m and n are both odd). In this case, we designed a greedy algorithm and proved that the algorithm is optimal in that it can always find a loading position that maintains a weight balance regardless of the number of objects. Our algorithm can be used in many engineering problems, such as loading algorithms and load balancing problems.

Analysis of Nutrient Dynamics and Development of Model for Estimating Nutrient Loading from Paddy Field

  • Jeon, Ji-Hong;Yoon, Chun-G.;Hwang, Ha-Sun;Jung, Kwang-Wook
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.45 no.7
    • /
    • pp.57-69
    • /
    • 2003
  • To evaluate nutrient dynamics with different fertilization in paddy field and develop water quality model, mass balance analysis was performed during growing season of 2001-2002 in field experimental plots irrigated with groundwater. As a result of water balance analysis, most of outflow was surface drainage as about half of total outflow and about 500mm was lost by evapotranspiration. The water budget was well balanced. The runoff from paddy field was influenced by rainfall and forced drain. Especially runoff during early cultural periods more depends on the forced drain. As a result of mass balance analysis, most of nutrient was input by fertilization and lost by plant uptake. Significant amount of nitrogen were supplied by precipitation and input from upper paddy field, comprising 12%∼28% of total inflow. Nutrient loading by surface drainage was occurred showing about 15%∼29% for T-N and 6%∼13% for T-P. The response of rice yield with different fertilization was not significant in this study. Water quality model for paddy field developed using Dirac delta function and continuous source was calibrated and validated to surface water quality monitoring data. It demonstrates good agreement between observed and simulated. The nutrient concentration of surface water at paddy field was significantly influenced by fertilization. During early cultural periods when significant amount of fertilizer was applied, surface drainage from paddy field can cause serious water quality problem. Therefore, reducing surface drainage during fertilization period can reduce nutrient loading from paddy fields. Shallow irrigation, raising the weir height in diked rice fields, and minimizing forced surface drainage are suggested to reduce surface drainage outflow.

Three-Dimensional Container Packing Problem with Freight Priority (우선순위를 고려한 컨테이너 3차원 적재문제)

  • Bae, Min-Ju;Choi, Se-Kyoung;Kim, Hwan-Seong
    • Journal of Navigation and Port Research
    • /
    • v.28 no.6
    • /
    • pp.531-539
    • /
    • 2004
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight. Frist of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified The types of containers and its number to be loaded am be selected automatically by minimizing the total cost of container charge. Maximization of loading space am be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be packing into the container. In container packing simulation, we can verify that the proposed heuristic algorithm indicates more efficiency space utilization and shows the possibility of using on commercial business.

Calibration of 6-component External Balance (외장형 6분력 풍동저울 교정)

  • Jo, Tae-Hwan;Jeong, Jin-Deok;Kim, Yang-Won;Jang, Byeong-Hui
    • Aerospace Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.47-52
    • /
    • 2006
  • The external balance of KARl LSWT is installed by Aerotech at 1998. It has been used for more than 70 tests until 2004. The upgrade and re-calibration program are planed to solve the problem that revealed in 7-years operation and to increase the accuracy of the system. In this paper, 3 calibration results are presented. The first one is the results done by Aerotech at 1998, the second one is the results by using quick-loading system at 2004, and the last one is the results done at 2005.

  • PDF