• Journal of the Korean Society of Marine Environment & Safety
• /
• v.19 no.3
• /
• pp.277-284
• /
• 2013

To ensure that the production system of a factory is efficient, the factory layout design should consider the location and material flow plans of facilities, workshops, and storage areas. Highly productive factories need to have an optimized layout planning process, and a customized design methodology of the production system is a necessity for feasible layout planning. This paper presents a method for designing a layout module's size and shape and provides a heuristic location-allocation algorithm for the modules. The method is implemented and validated using a rich internet application-based platform. The layout design method is based on the leisure ship production process; this method can be used for designing the layout of a new factory or remodeling an existing factory and its production system. In contrast to existing layout methods, the inputs required for the proposed method, such as target products, production processes, and human-resource plans, are simple. This layout design method provides a useful solution for the initial stage of factory design.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.190-197
• /
• 2013

People are living longer than ever before. As a result, life expectancy is going up and the demand of long-term care facilities is increasing in most countries. The facilities provide rehabilitative, restorative, and skilled nursing care to patients or residents in need of assistance with activities of daily living. This study deals with the capacitated location and allocation problem of long-term care facilities in a city that consists of a finite number of regions. Assuming that in each region candidate locations for three types of facilities are already given, two integer programming models are developed under the closest assignment rule reflecting the demand characteristics of the facilities. Both the location and type of the facilities to be built become decision variables. To show the validity of the models, numerical problems are solved with commercial software, CPLEX. Also, sensitivity studies were conducted to identify relationships between the system parameters.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.48-69
• /
• 2004

An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.45-50
• /
• 1984

This paper is concerned with the facility location-allocation problem (FLAP) with multiple objectives. A branch-and-bound procedure is presented to solve the mixed zero-one integer goal programming problem which is to determine facility locations from given candidate locations and to allocate facility capacity to given customer markets simultaneously. A numercial example is given to illustrate this procedure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.1-14
• /
• 1998

This paper describes a study which was undertaken in Ulsan City. The modified SLP procedures consider the quantitative flow aspect of the facilities layout problem as well as the qualitative closeness rating aspect. Conclusions are drawn as to the effectiveness of the proposed model in providing Ulsan City with better means of making the facilities location allocation decision for Industrial Technology Research Park.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.22-28
• /
• 2013

This study aims to propose the location selection method of car-sharing services in Daejeon Metropolitan city. In order to select locations for car-sharing, Daejoen area was divided in $500m{\times}500m$ cell size using GIS Arc/Info 10, and input factors which may affect car-sharing service were determined, and then each input factor was standardized for analysis. The weight for each input factor was determined through experts' survey and index of goodness of fit was estimated in each cell ($500m{\times}500m$ size) using AHP method. Also, This study proposed the method to select 30 service facility location using Location-allocation Model in Network Analysis module. The proposed method for the location selection of car-sharing service in this study can be used for preliminary data for initial car-sharing introduction. Henceforward, appropriate demand forecasting and economic evaluation for the location selection of car-sharing service are needed for the further study.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.351-363
• /
• 2008

This paper is concerned with tasking and guidance of networked airborne sensors to achieve fault-tolerant sensing. The sensors are coordinated to locate hostile transmitters by intercepting and processing their signals. Faults occur when some sensor-carrying vehicles engaged in target location missions are lost. Faults effectively change the network architecture and therefore degrade the network performance. The first objective of the paper is to optimally allocate a finite number of sensors to targets to maximize the network life and availability. To that end allocation policies are solved from relevant Markov decision problems. The sensors allocated to a target must continue to adjust their trajectories until the estimate of the target location reaches a prescribed accuracy. The second objective of the paper is to establish a criterion for vehicle guidance for which fault-tolerant sensing is achieved by incorporating the knowledge of vehicle loss probability, and by allowing network reconfiguration in the event of loss of vehicles. Superior sensing performance in terms of location accuracy is demonstrated under the established criterion.

• Korean Management Science Review
• /
• v.27 no.1
• /
• pp.75-90
• /
• 2010

In this paper, we proposed new solution procedure of the air defense missile allocation problem. In order to find the optimal location of missile, we formulated a simple mathematical model maximizing the kill probability of enemy air threat including aircraft and missile. To find the Kill probability, we developed a new procedure using actual experimental data in the mathematical model. Actual experimental data mean real characteristic factor, which was acquired when the missile had been developed through missile fire experiment. The result of this study can offer practical solution for missile allocation and the methodology in this study can be used to the decision making for the optimal military facility allocation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.201-204
• /
• 1997

This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.