• 산업경영시스템학회지
• /
• 제29권2호
• /
• pp.58-66
• /
• 2006

This paper addresses the analysis of the travel distance and the number of storage location for storage location allocation methods in a warehouse system. The dedicated, randomized, combined and limited storage methods are considered. The combined and the limited storage methods are suggested here, which the combined storage method is to divide the storage locations into the dedicated storage area and the randomized storage area, and the limited storage method is to restrict the storage area of each product. Through a numerical example, the average travel distance between input/output point and the storage locations, and the number of storage location needed in the warehouse are compared between storage location allocation methods. The nearest randomized storage method is shown as the reasonable one in the travel distance and the number of storage location.

• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.316-322
• /
• 2002

본 논문에서는 파일 데이터의 실시간 재생 서비스를 제공하기 위한 UNIX파일 시스템의 연속 블록 할당에 대하여 다루고 있다. 설계된 블록 할당 방식은 사용자가 저장 데이터와 함께 지정한 소비 전송율을 지원할 수 있도록 적절한 디스크 위치에 데이터를 배치하여 실시간 재생 서비스를 지원할 수 있도록 하고 있다. 이를 위하여 데이터 전송율에 영향을 미치는 요소 중에서 가변적인 특성인 연속 블록 수와 저장 데이터들의 실린더 간격과의 관계를 분석하여 특정 실린더 간격 별로 연속 블록을 저장하는 방식을 채택하였다. UNIX시스템의 블록 할당 방식은 임의의 실린더 위치에서 연속 블록을 찾는 것이 비효율적 이기 때문에 새로운 형태의 비트맵 방식의 유휴 블록 기법을 사용하였다. 비트맵 방식의 블록 관리 기법은 파일 시스템 블록들을 비트 단위로 사용/비사용 여부를 표시하여 임의의 실린더 위치에 존재하는 블록이 사용 가능한지를 효율적으로 검색할 수 있도록 하였다.

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.65-86
• /
• 2008

In this paper, we have considered the multicriteria quadratic plant location problem. In addition to the allocation costs, the maintenance costs of the plants are also considered. The objective functions considered in this paper are quadratic in nature. The given problem is reduced to the problem with linear objective function. The method of Fernandez and Puerto (2003) is applied to solve the reduced problem. It is illustrated with help of examples. The effect of the change in the allocation and maintenance costs on allocation of plants to the clients has also been discussed.

• 농촌지도와개발
• /
• 제5권1호
• /
• pp.93-102
• /
• 1998

The objectives of the study were 1) to make the reasonable standard, 2) to select the objective and scientific method and process for the location-allocation of a new provincial capital city. The Main standard of location-allocation were suggested as follows ; 1) Integration of province 2) Convenience of Administration service 3) Accomodations of new provincial capital city 4) Balanced development by region. The validity of location-allocation were reviewed the population potentials and nodal accessibilities. The population potential was examined to find the maximum point of administrative demand, and the locationallocation model was examined to find the minimum point of the aggregated travel-cost to a proposed provincial government office. The nodal accessibilities measured in travel-time distance and actual values. Two major concerns in locating public facilities are efficiency and equity.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.61-64
• /
• 2005

The purpose of this paper is to take a closer look at an area having shorted emergence facilities and to determine optional candidate sites instead of vulnerable area by using GIS spatial analysis. Newly determined new candidate is performed by concerning spatial efficiency and spatial equity for a public service. It was determined through using the analyzing of the physical accessibility measure, the Location-Allocation, sort of classic model in spatial statistics and general network analysis. The area of this research has been used in administrative boundary of Young-Dong in Gangneung including 13 emergency, medical hospitals, 46 fire-stations and sub-fire stations. In general terms, what all this show is that the way we are approached for geographical view from using GIS spatial analyzing technique of determined location and allocation problem by the social, economical, political factor and simple administrative discrimination at the meantime. At the same time, with problem occurred in the space it is possible to make an Effective proposal or means, policy, decision for new candidate location-allocation suggesting optimum model.

• 한국국방경영분석학회지
• /
• 제25권2호
• /
• pp.117-129
• /
• 1999

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Currently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research show that GA has efficiency for finding good solution. Our main motive of this research is developing of a GA in LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We propose fourth alternative genetic algorithm. Computational experiments are carried out to find a best algorithm.

• 산업공학
• /
• 제13권3호
• /
• pp.479-485
• /
• 2000

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Recently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research shows that GA has efficiency for finding good solution. Our main motive of this research is developing of a package for LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We built a database constructed by zipcode, latitude, longitude, administrative address and posted land price. This database enables any real field problem to be coded into a mathematical location problem. We developed a package for a class of multi-location problem at PC. The package allows for an interactive interface between user and computer so that user can generate various solutions easily.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.8-14
• /
• 2007

This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

• 산업공학
• /
• 제21권3호
• /
• pp.262-273
• /
• 2008

In Korean peninsular, Air Defense with SAM(Surface-to-Air Missile) is very important, because of threatening by North Korea's theater ballistic missiles installed with nuclear or biochemistry. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Multi-heuristic algorithm which can handle both factors simultaneously for solving allocation problem of the batteries and missile assignment problem in each battery. To solve allocation problem, genetic algorithm is used to decide location of the batteries. To solve missile assignment problem, a heuristic algorithm is applied to determine the number of SAM for each target. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of missile defense operations.

• 한국국방경영분석학회지
• /
• 제17권2호
• /
• pp.54-71
• /
• 1991

It is very important to increase defence capability rapidly against any surprise attack. This can be done by fast deployment of mobilization reserved resources. This paper is forcused on optimal allocation of special reserved resources. First of all, the location of special reserved resources is identified and then the location of combat and mobilization units and amount of requirement resources of each unit are identified. Finally, optimal allocation of the special reserved resources is obtained by Out of Kilter method.