• Journal of the Korean Statistical Society
• /
• 제5권1호
• /
• pp.49-59
• /
• 1976

This paper is to present an iterative method for determining an optimum geographic location pattern for the warehouses (sources) that are employed to serve or supply, known quantities of its finished product to a set of custormer areas (destinations) that have fixed and known locations, where the number of sources is permitted to vary. What must be determined, in this paper, is the number and location of the sources or warehouses that will minimize the combined costs of transferring and storing the total quantity of products demanded in the destinations or customer areas.

• 산업경영시스템학회지
• /
• 제14권23호
• /
• pp.1-6
• /
• 1991

The physical distribution service(PDS) is essential to evaluate the business logistics system. The PDS combines the inventory service with the lead time to deliver. This paper is presented to model Mixed Zero-One integer programming which is to determine distribution center location and to allocation products, considering delivery lead time, from given candidate locations to given customer markets. A numerical example is given to demonstrate the applicability of Mixed Zero-One integer programming for Distribution-Location problem.

• 한국시뮬레이션학회논문지
• /
• 제23권4호
• /
• pp.197-202
• /
• 2014

다수의 임무를 다중의 무인기로 효과적으로 수행하기 위해서는 전체 임무를 수행하는데 필요한 총 이동거리를 최소화로 하는 알고리즘이 필요하다. 본 논문에서는 다수의 무인기 운용에 적합하게 적용할 수 있는 수정된 합의 기반 경매 알고리즘(Modified Consensus Based Auction Algorithm)을 제안한다. 제안하는 알고리즘의 핵심 아이디어는 기존의 합의 기반 경매 알고리즘을 기초로 하여 에이전트들의 위치와 임무까지의 거리의 합을 최소화하는 것이다. 3개의 UAV 에이전트로 다수의 임무를 수행하는 시뮬레이션을 진행하였고 전체 임무 완수 시간과 전체 이동 거리 측면에서 효율적임을 보였다.

• Spatial Information Research
• /
• 제12권2호
• /
• pp.211-228
• /
• 2004

본 연구는 대전시를 사례로 하여 주유소의 입지적 특성과 판매권역을 분석하기 위해 설문과 면접 조사, 그리고 GIS의 그리드 분석을 활용하였다. 주유소의 입지적 특성을 분석해 본 결과 고수익 입지유형은 인구밀도와 1일 통행량이 일정수준 이상으로 배후 상주인구와 통행인구가 많아 고수익이 예상되었고, 반면에 저수익 입지유형은 토지이용상 녹지와 개발제한구역 등으로 통행량도 낮아서 높은 수익을 기대하기 어려웠다. 대전시 인구수에 기반하여 판매권역의 공간분포 패턴을 살펴본 결과, 주유소 판매권역의 크기는 인구밀도가 조밀한 중심지역에서 인구밀도가 낮은 외곽지역으로 갈수록 확대되었다. 또한 인구수에 대비하여 주유소가 과다한 주유소 과밀지역과 과소 지역이 분포하는 불균형적 주유소 분포패턴을 보여주었다. 입지-배분모델을 적용한 결과 주유소 과밀 지역에서는 주유소의 수가 줄어들었고, 과소한 지역에서는 신규로 주유소가 입지하여 보다 균형적인 분포패턴을 보여주었다. 이와 같은 연구결과는 석유제품 유통기관별로 최소 배후지 규모를 만족시키면서 균형적 공간 분포패턴을 가질 수 있도록 배치하는데 필요한 기초적인 자료로 활용될 수 있을 것으로 예상된다.

• 환경위생공학
• /
• 제18권3호통권49호
• /
• pp.11-20
• /
• 2003

There are two ways of reducing air pollution. One is the approach of the pollutant source control and the other one is the traffic demand decreasing approach. This study is focusing on the approach of land use planning and optimal location of urban facilities because those are the basic cause to generate transportation demands. So, the purpose of this study would be to analyze the changes of NOx and CO distribution on environmental air by functional hierarchy of urban roads and to make evaluation model of 'Transportation-Land Use -Air Pollution'. It will contribute to improve the air pollution level at same actual traffic generation according to different location.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.1-14
• /
• 2011

In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

• 한국농공학회지
• /
• 제43권2호
• /
• pp.112-121
• /
• 2001

In this study, a spatial location-allocation model of center villages (SLAMCV) was developed for selecting spatial center villages and allocating their rear villages. In SLAMCV, rural space was considered as a network with villages for nodes and roads for connecting lines. For quantification of residents’ accessibilities in the network, a disutility index (DUI) was developed and used, which is dependent upon travelling distance between the center and its hinter villages, design vehicle speed in connecting road and population of hinter villages. SLAMCV was verified to Christaller’s hexagonal hierachical settlement system to test the theoretical reasonability and computing algorithm of the model.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• 전자공학회논문지S
• /
• 제35S권3호
• /
• pp.65-75
• /
• 1998

We consider connection-oriented wireless cellular networks such as the second generation wireless cellular networks and wirelss ATM networks. In these networks, a separate forward signaling channel is provided for the transmission of paging and channel allocation packets. When a call destined to a user is requested, all the base stations in the user's current location area broadcast the corresponding paging packet across forward signaling channels. By slot mode operation and paging group allocation for fusers in a location area, we can reduce relative power consumption level at battery-operated terminals. However, a sthe number of paging groups is increased for lowering relative power consumption level, a paging packet experiences higher delay to access the forward signaling channel. For the pre-negotiated quality-of-service level, paging packet delay level must be limited. In this paper, we consider static and dynamic multiplexing schemes for paging packets, and develop an analytical method for calculating paging packet delay and relative power consumption levels. Using this analytial method, we investigate the effect of network parameters on the paging packet delay and relative power consumption levels.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.250-256
• /
• 2011

A two-way relaying (TWR) system is analyzed, where two source terminals with unequal numbers of antennas exchange data via an amplify-and-forward relay terminal with a single antenna. In the system considered herein, the link quality between the sources and relay can generally be asymmetric due to the nonidentical antenna configuration, power allocation, and relay location. In such a general setup, accurate bounds on the average sum rate (ASR) are derived when beamforming or orthogonal space time block coding is employed at the sources. We show that the proposed bounds are almost indistinguishable from the exact ASR under various system configurations. It is also observed that the ASR performance of the TWR system with unequal numbers of source antennas is more sensitive to the relay location than to the power allocation.