• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.1
• /
• pp.108-116
• /
• 2022

Supply in military operations has a significant impact on overall combat capability and efficiency. Therefore, modernization of military logistics is underway to ensure rapid and accurate distribution. And, effective warehouse management is paramount. This paper proposes a new product allocation model that uses a genetic algorithm. The model considers order frequency and mass of products because the military equipment is usually heavier than available products. A computer simulation shows that products are assigned to optimal locations and reduce the consumed energy for forklifts by more than 25 % with similar travel time. Also, we show the superiority of genetic algorithm by comparing them with other algorithms.

• 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.

• IE interfaces
• /
• v.19 no.1
• /
• pp.78-85
• /
• 2006

A centralized inventory system provides a number of stores with cost reduction, information sharing. In this paper, transportation costs are included in the inventory model. To build centralized warehouses, two things should be considered: how many warehouses are required and where these are located. The objective of this paper is to develop efficient heuristics to determine the location and the number of central warehouses by minimizing total costs. Throughout some computational experiments, the results of the heuristics are compared with an optimal solution.

• IE interfaces
• /
• v.14 no.1
• /
• pp.30-38
• /
• 2001

Logistics network management has become one of the most important sources of competitive advantage regarding logistics cost and customer service in numerous business segments. Logistics network simulation is a powerful analysis method for designing and planning the logistics network optimally in an integrated way. This paper introduces a logistics network simulator, LONSIM, developed by author. LONSIM deploys a mix of simulation and optimization functions to model and analysis logistics network issues such as facility location, inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment, order processing priority rule, and vehicle routes. LONSIM is built with AweSim 2.1 and Visual Basic 6.0, and executed in windows environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.59-67
• /
• 2010

Rice varietal information exchange is vital for agricultural experiments and trials. With the growing size of rice data gathered around the world, and numerous research and development achievements, the effective collection and convenient ways of data dissemination is an important aspect to be dealt with. The collection of this data is continuously worked out through various international cooperation and network programs. The problem in acquiring this information anytime anywhere is the new challenge faced by rice breeders, scientist and crop information specialists, in order to perform rapid analysis and obtain significant results in rice research, thus alleviating rice production. To address these constraints, we propose an Online Analytical Query System, a web query application to provide breeders and rice scientist around the world a fast web search engine for rice varieties, giving the users the freedom to choose from which trial it has been used, trait observation parameters as well as geographical or weather conditions, and location specifications. The application uses data warehouse techniques and OLAP for summarization of agricultural trials conducted, and statistical analysis in deriving outstanding varieties used in these trials, consolidated in an Model-View-Controller Web framework.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.73-80
• /
• 1986

This paper deals with the problem of the optimal location of warehouses in the two stage distribution system, i.e., the distribution system where the product is transported from plants to customer areas via warehouses. The Problem is formulated with a zero-one mixed integer programming and an efficient branch and bound algorithm is then used to solve the problem. In order to obtain the solution of this problem, this paper shows the procedure of conversion of two stage distribution system into one stage distribution system. An improved method of solving the linear programming at the nodes and branching decision rule is also showed by this study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.150-153
• /
• 2001

The selection of the optimal partners in supply chain management is one of the most critical success factors. In the past, partners for outsourcing production were selected repeatedly within a closed group of candidates due to the limited information and location of partners. But, the wide use of internet and the development of electronic commerce make it possible that the partners capable of providing the optimal services are selected regardless of their location or nationality. And the concept of partners was limited to the provider of production resources. In the supply chain management, the concept should be extended to the provider of transportation and warehouse due to the high portion of transportation cost among the total production cost Therefore, In this study, we propose an analytical approach to the selection of Production and transportation partners in supply chain management. For this purpose a mathematical model is developed, and then a heuristic algorithm based on tabu search is presented since the model belongs to the NP hard problem.

• Journal of the Korea Safety Management & Science
• /
• v.16 no.3
• /
• pp.363-368
• /
• 2014

During the fierce competition among the companies, improvement of logistics center managing efficiency is importantly recognized. Among them, studies on improvement of picking work process on about 55% of logistics center managing costs are continuously conducted. And, most of studies focus on analysis on strengths and weaknesses of picking method performable on the stage of logistics center design, etc, so the purposes of this research are to define load location rule by product releasing frequency in logistics managing environment based on conveyer and suggest expected effects by simulation analyzing method to improve picking managing efficiency.

• Journal of architectural history
• /
• v.30 no.5
• /
• pp.17-28
• /
• 2021

The Sijeon (Licensed Markets) legally permitted by the government along the Jongno and the Namdaemunro Avenues played a central commercial role in Hanyang. However, after the opening of the port in the late Joseon era, the Licensed Markets suffered a blow and declined due to the introduction of a new product of civilization and the appearance of foreign merchants. Although the Licensed Markets, which have been maintained without major changes for a long time, have played a major role in the urban spatial structure, the exact location has not been still determined, and researches until now has remained limited for such that. In this study, based on the 1912 land survey records, the location of the Licensed Markets pre-and post- 1910 is identified, and the spatial change of the dismantling process is investigated.