• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.745-754
• /
• 2016

In a graph G = (V, E), a non-empty set $S{\subseteq}V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ${\rho}^{\circ}$. In this paper, we examine the effect of ${\rho}^{\circ}$ when G is modified by deleting a vertex.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• Journal of Environmental Science International
• /
• v.6 no.4
• /
• pp.391-397
• /
• 1997

The study was carried out to demonstrate the superiority of used packing in view of energy saving and efficiency of mass transfer, comparing with conventional packing. The results are as follows : 1. Owing to low Pressure drop under high load. 25mm NSW-ring, pp. can cause energy saving 2. The unique magnitudes of used packing are as follows $C_G$=5.78, m=0.67, n=0.46 3. Used packing can make high efficiency including energy saving because of low pres sure drop per the number of transfer unit. To rate the characteristic of packing, It should be carried out that the measurement of pressure drop per packing height and per the number of transfer unfit. This study demonstrated the superiority of used packing by carring out above experiment and could be used as basic reference for design and predicting efficiency of packing tower which is tilled with same packing.

• Journal of the Korean Ceramic Society
• /
• v.34 no.9
• /
• pp.979-985
• /
• 1997

The three-dimensional particle packing process is simulated using Lahey FORTRAN 90 as a programming language running on a personal computer. Particle clusters constructed with rearrangement which occurs during packing have higher average coordination number and packing density than particle clusters rearranged after packing. Rearranging particles can not completely block other particles from entering pore volume in 3-dimensional packing unlike in 2-dimensional packing. It is found that there is a region of instability where lower packing density results from the destruction of the ordered packing.

• Journal of the Korean Society of Safety
• /
• v.8 no.4
• /
• pp.120-126
• /
• 1993

This work was carried out to investigate the effects of solid mass flow rate, mean particle diameter and mesh number of screen packing material on minimum carrying velocity, which defined as the superficial gas velocity of the upper limit of chocking phenomenon. Vertical pneumatic conveying was studied on a 4.6cm 1. D. pipe, 180cm in length. Experiments were performed in both the empty and the screen-packed pipe. It was also examined the effect of superficial gas velocity, solid mass flow, mean particle diameter, and mesh number of packing material on pressure drop. Minimum carrying velocity in screen packed-pipe was lower than that in an empty pipe. besides minimum carrying velocity was decreased with increase in mesh number of screen packing material. The pressure drop In vortical packed-pipe was Increased with superficial gas velocity, mean particle diameter, and mesh number of screen packing material.

• Management Science and Financial Engineering
• /
• v.18 no.2
• /
• pp.19-22
• /
• 2012

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.470-480
• /
• 2008

Loading steel coil products on a specialized packing case called pallet can be represented as a bin-packing problem with the special constraint where objects should be loaded on designated positions of bins. In this paper, under assuming that there exist only two types of objects, we focus on finding the optimum number of positions in a bin which minimizes the number of bins needed for packing a collection of objects. Firstly, we propose a method to decide the number of positions and prove that the method is optimum. Finally, for the packing problem using bins designed by the method, we show that the well-known algorithm, First-Fit Decreasing(FFD), is the optimum algorithm.

• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3242-3249
• /
• 2022

As Kori unit 1 is undergoing the decommissioning process, estimating the disposal amount of waste from the decommissioned nuclear reactor has become one of the challenging issues. Since the waste disposal amount estimation depends on the packing of the waste, it is highly desirable to optimize the waste packing plan. In this study, we developed an efficient scheme for packing waste component segments. The scheme consists of 1) preparing three-dimensional models of segments, 2) orienting each segment in such a way to minimize the bounding box volume, and 3) applying hybrid genetic algorithm to pack the segments in the disposal containers. When the packing solution converges in the algorithm, it comes up with the number of containers used and the placement of segments in each container. The scheme was applied to Kori-1 reactor pressure vessel. The required number of containers calculated by the developed scheme was 24 compared to 42 that was the estimation of the prior packing plan, resulting in disposal volume savings by more than 40%. The developed method is flexible for applications to various packing problems with waste segments from different cutting options and different sizes of containers.

• Korean Management Science Review
• /
• v.22 no.1
• /
• pp.167-178
• /
• 2005

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• Journal of Environmental Science International
• /
• v.9 no.5
• /
• pp.389-392
• /
• 2000

In this study a packed tower was selected for the treatment apparatus of $NH_3$ gas produced in industry. Formerly latticework packing has been used in preventive facility of treatment of $NH_3$ gas. However recently metallic Ralu-Pack 250YC. structured packing is usually being used in petrochemical production plant. This study is for the application the packing to the $NH_3$ gas treatment in wet scrubbing process. In Air/water system hydraulic pressure drop dependent of specific liquid load and gas capacity factor was continuous and parallel from graph. The tower height can be determuined by the number of transfer unit and the height of transfer unit influenced on liquid distribution.