• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4999-5008
• /
• 2015

The application of efficient constraint handling technique is fundamental method to find better solutions in engineering optimization problems with constraints. In this research four of constraint handling techniques are used with a meta-heuristic optimization method, harmony search algorithm, and the efficiency of algorithm is evaluated. The sample problem for evaluation of effectiveness is one of the typical discrete problems, optimal pipe size design problem of water distribution system. The result shows the suggested constraint handling technique derives better solutions than classical constraint handling technique with penalty function. Especially, the case of ${\varepsilon}$-constrained method derives solutions with efficiency and stability. This technique is meaningful method for improvement of harmony search algorithm without the need for development of new algorithm. In addition, the applicability of suggested method for large scale engineering optimization problems is verified with application of constraint handling technique to big size problem has over 400 of decision variables.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1021-1030
• /
• 2004

When any data-centric XML documents are stored and managed in RDBMS, schema extracting from XML Schema is an imminent problem. Furthermore, when they are stored in partitioned way on created table, lots of null values will be produced and/or be increased cost for join, so we need a solution to solve these problems. This paper proposes a Schema Hybrid Inlining technique to generate relational schema of XML documents. The suggested technique creates a relational schema based on the XML Schema graph. Also, the technique expands the legacy Inlining method by manual and heuristic processing table generation method of cardinality and in-degree. Then, an ancestor node, terminal node, and creating a new table on the derived relation in this technique. DTD-dependent storage method uses partitioned storing and relation path element information reformed structured-searching method to reduce joining operation cost that is a weak point of it.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.281-286
• /
• 2003

A large number of features are collected for problem solving in real life, but to utilize ail the features collected would be difficult. It is not so easy to collect of correct data about all features. In case it takes advantage of all collected data to learn, complicated learning model is created and good performance result can't get. Also exist interrelationships or hierarchical relations among the features. We can reduce feature's number analyzing relation among the features using heuristic knowledge or statistical method. Heuristic technique refers to learning through repetitive trial and errors and experience. Experts can approach to relevant problem domain through opinion collection process by experience. These properties can be utilized to reduce the number of feature used in learning. Experts generate a new feature (highly abstract) using raw data. This paper describes machine learning model that reduce the number of features used in learning using heuristic function and use abstracted feature by neural network's input value. We have applied this model to the win/lose prediction in pro-baseball games. The result shows the model mixing two techniques not only reduces the complexity of the neural network model but also significantly improves the classification accuracy than when neural network and heuristic model are used separately.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.412-420
• /
• 2008

A new scan partition architecture to reduce both the average and peak power dissipation during scan testing is proposed for low-power embedded systems. In scan-based testing, due to the extremely high switching activity during the scan shift operation, the power consumption increases considerably. In addition, the reduced correlation between consecutive test patterns may increase the power consumed during the capture cycle. In the proposed architecture, only a subset of scan cells is loaded with test stimulus and captured with test responses by freezing the remaining scan cells according to the spectrum of unspecified bits in the test cubes. To optimize the proposed process, a novel graph-based heuristic to partition the scan chain into several segments and a technique to increase the number of don't cares in the given test set have been developed. Experimental results on large ISCAS89 benchmark circuits show that the proposed technique, compared to the traditional full scan scheme, can reduce both the average switching activities and the average peak switching activities by 92.37% and 41.21%, respectively.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.43-51
• /
• 2004

As the slenderness ratio of a high-rise building increases, the lateral load resisting system for the building is more often determined by serviceability design criteria. In serviceability design, the maximum drift and the level of vibration are controlled not to exceed the design criteria. Even though many drift method have been developed in various forms, no practical design method for wind induced vibration has been developed so far. Structural engineers rely upon heuristic or experience in designing wind induced vibration. Development of practical design method for wind induced vibration is required. Generally, wind induced acceleration responses are depending on several variables such as the weight density of a building, damping ratio, the natural period, and etc.. All parameters except the natural period or frequency are usually out of reach for structural engineers, then the wind acceleration response may be proportioned to the natural period. Therefore, in this paper, a wind induced vibration design method based on frequency control technique for high-rise is proposed. The method is applied to vibration design of a 25-story office building for performance evaluation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.135-141
• /
• 2004

This paper proposes a new heuristic search technique for obstacle avoidance of autonomous underwater vehicles equipped with a looking ahead obstacle avoidance sonar. We suggest the fuzzy relation between the sonar sections and the properties of real world environment. Bandler and Kohout's fuzzy relational method are used as the mathematical implementation for the analysis and synthesis of relations between the partitioned sections of sonar over the real-world environmental properties. The direction of the section with optimal characteristics would be selected as the successive heading of AUVs for obstacle avoidance. For the technique using in this paper, sonar range must be partitioned into multi equal sections; membership functions of the properties and the corresponding fuzzy rule bases are estimated heuristically. With the two properties Safety, Remoteness and sonar range partitioned in seven sections, this study gives the good result that enables AUVs to navigate through obstacles in the optimal way to goal.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.425-432
• /
• 1995

In this paper we propose a design and implementation technique of a universal automatic test pattern generator(UATPG) which is well suited for VLSI digital circuits. UATPG is designed to extend the capabilities of the existing APTG and to provide a convenient environment to computer-aided design(CAD) users. We employ heuristic techniques in line justification and fault propagation for functional gates during test pattern generation for a target fault. In addition, the flip-flops associated with design for testability (DFT) are exploited for pseudo PIs and pseudo POs to enhance the testabilities of VLSI circuits. As a result, UATPG shows a good enhancement in convenient usage and performance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.235-245
• /
• 1998

This paper presents the fuzzy optimization model based scheduling methodology for the efficient production control of a FFS(FIexible Flow Shop) under the uncertain production environment. To develop the methodology, a fuzzy optimization technique is introduced in which the uncertain production capacity caused by the random events like the machine breakdowns or the absence of workers is modeled by fuzzy number. Since the problem is NP hard, the goal of this study is to obtain the near optimal but practical schedule in an efficient way. Thus, Lagrangian relaxation method is used to decompose the problem into a set of subproblems which are easier to solve than the original one. Also, to construct the feasible schedule, a heuristic algorithm was proposed. To evaluate the performance of the proposed method, computational experiments, based on the real factory data, are performed. Then, the results are compared with those of the other methods, the deterministic one and the existing one used in the factory, in the various performance indices. The comparison results demonstrate that the proposed method is more effective than the other methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.177-182
• /
• 2021

Generally, the linear programming (LP) with O(n⁴) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.