• 제목/요약/키워드: Spatial optimization problem

검색결과 92건 처리시간 0.026초

The Study for the Optimal Location of Fire Stations in Seoul (서울시의 소방서 최적입지에 관한 연구)

  • Kim, Geun-Young;Kang, Sung-Il
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • 제2권1호
    • /
    • pp.153-159
    • /
    • 2002
  • Disasters are the phenomena that we have to prevent the occurrence in order to keep the safety to human lives and properties, and if occurred, we have to minimize the economic, social, and mental costs of the occurred disasters or incidents. This research analyzes the optimal location of fire stations in terms of served population maximization in Seoul. This research introduces "the maximal covering location problem(MCLP)," one of the optimization techniques, as the primary research method. This research also applies a geographic information system into spatial distribution analyses of existing fire stations and observed fire incidents. Results from the analyses show that the existing location of fire stations and branches need to be improved. The dispatch location of fire engines should be reconsidered for rapid services of fire fighting.

Identifying Responsive Functional Modules from Protein-Protein Interaction Network

  • Wu, Zikai;Zhao, Xingming;Chen, Luonan
    • Molecules and Cells
    • /
    • 제27권3호
    • /
    • pp.271-277
    • /
    • 2009
  • Proteins interact with each other within a cell, and those interactions give rise to the biological function and dynamical behavior of cellular systems. Generally, the protein interactions are temporal, spatial, or condition dependent in a specific cell, where only a small part of interactions usually take place under certain conditions. Recently, although a large amount of protein interaction data have been collected by high-throughput technologies, the interactions are recorded or summarized under various or different conditions and therefore cannot be directly used to identify signaling pathways or active networks, which are believed to work in specific cells under specific conditions. However, protein interactions activated under specific conditions may give hints to the biological process underlying corresponding phenotypes. In particular, responsive functional modules consist of protein interactions activated under specific conditions can provide insight into the mechanism underlying biological systems, e.g. protein interaction subnetworks found for certain diseases rather than normal conditions may help to discover potential biomarkers. From computational viewpoint, identifying responsive functional modules can be formulated as an optimization problem. Therefore, efficient computational methods for extracting responsive functional modules are strongly demanded due to the NP-hard nature of such a combinatorial problem. In this review, we first report recent advances in development of computational methods for extracting responsive functional modules or active pathways from protein interaction network and microarray data. Then from computational aspect, we discuss remaining obstacles and perspectives for this attractive and challenging topic in the area of systems biology.

Modeling of Remediation Design in Theoretically Heterogeneous Domain

  • Ko, Nak-Youl;Lee, Kang-Kun
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 한국지하수토양환경학회 2004년도 임시총회 및 추계학술발표회
    • /
    • pp.302-306
    • /
    • 2004
  • Probabilistic approaches are applied to the problem of groundwater remediation design to consider the risk of design and heterogeneity of real condition. Hydraulic conductivity fields are generated by two methods. First, the homogeneous domains which have the hydraulic conductivity with log-normal distribution are constructed by using Latin Hypercube method. Second, random fields with a certain spatial correlation are also generated. The optimal solutions represented by cumulative distribution function (CDF) of relative cost are calculated by three different manners. The one uses the homogeneous domains with the optimal design of base condition. It shows that ver)'wide range of cost and the influences of different penalty values. The other one uses the random field with same design and shows narrow range of cost. These CDF can reflect on the risk of optimal solution in a simple exampie condition and be effective in estimating the cost of groundwater remediation.

  • PDF

OFDM MIMO radar waveform design for targets identification

  • Bai, Ting;Zheng, Nae;Chen, Song
    • ETRI Journal
    • /
    • 제40권5호
    • /
    • pp.592-603
    • /
    • 2018
  • In order to obtain better target identification performance, an efficient waveform design method with high range resolution and low sidelobe level for orthogonal frequency division multiplexing (OFDM) multiple-input multiple-output (MIMO) radar is proposed in this paper. First, the wideband CP-based OFDM signal is transmitted on each antenna to guarantee large bandwidth and high range resolution. Next, a complex orthogonal design (COD) is utilized to achieve code domain orthogonality among antennas, so that the spatial diversity can be obtained in MIMO radar, and only the range sidelobe on the first antenna needs suppressing. Furthermore, sidelobe suppression is expressed as an optimization problem. The integrated sidelobe level (ISL) is adopted to construct the objective function, which is solved using the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. The numerical results demonstrate the superiority in performance (high resolution, strict orthogonality, and low sidelobe level) of the proposed method compared to existing algorithms.

A Design of Binary Phase Holograms using Genetic Algorithms (유전자 알고리즘을 사용한 이진 위상 홀로그램 설계)

  • Lee, Chang-Yong;Song, Yun-Seon;Seo, Ho-Hyeong
    • Journal of KIISE:Software and Applications
    • /
    • 제26권2호
    • /
    • pp.297-305
    • /
    • 1999
  • 본 논문에서는 컴퓨터를 사용한 이진 위상 홀로그램의 설계시 요구되는 조합 최적화 문제(combinatorial optimization problem)를 유전자 알고리즘을 사용하여 해결하고자한다. 이진 위상 홀로그램의 설게는 출력 면에서 원하는 이미지를 생성하기 위하여 홀로그램의 각 셀에 이진 위상을 결정하는 것으로 최적화 문제로 귀착된다. 유전자 알고리즘을 이진 위상 홀로그램 설계에 효율적으로 적용하기 위하여 이차원 염색체 부호화 및 주기성을 고려한 교차 연산자등을 사용하면, 그 결과 홀로그램 설계시 요구되는 이차원 퓨리에 변환(Fourier transform)을 자연스럽고 효율적인 방법으로 수행할수 있다. 유전자 알고리즘을 사용하여 구한 최적의 이진 위상 배열로 공간 빛 변조기(spatial light modulator, SLM)를 이용하여 광학적으로 이미지를 재생하고, 재생된 광학 이미지는 원하는 이미지와 거의 일치함을 보인다.

Pilot Sequence Assignment for Spatially Correlated Massive MIMO Circumstances

  • Li, Pengxiang;Gao, Yuehong;Li, Zhidu;Yang, Dacheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권1호
    • /
    • pp.237-253
    • /
    • 2019
  • For massive multiple-input multiple-output (MIMO) circumstances with time division duplex (TDD) protocol, pilot contamination becomes one of main system performance bottlenecks. This paper proposes an uplink pilot sequence assignment to alleviate this problem for spatially correlated massive MIMO circumstances. Firstly, a single-cell TDD massive MIMO model with multiple terminals in the cell is established. Then a spatial correlation between two channel response vectors is established by the large-scale fading variables and the angle of arrival (AOA) span with an infinite number of base station (BS) antennas. With this spatially correlated channel model, the expression for the achievable system capacity is derived. To optimize the achievable system capacity, a problem regarding uplink pilot assignment is proposed. In view of the exponential complexity of the exhaustive search approach, a pilot assignment algorithm corresponding to the distinct channel AOA intervals is proposed to approach the optimization solution. In addition, simulation results prove that the main pilot assignment algorithm in this paper can obtain a noticeable performance gain with limited BS antennas.

Optimal Berth and Crane Scheduling Using Constraint Satisfaction Search and Heuristic Repair (제약만족 탐색과 휴리스틱 교정기법을 이용한 최적 선석 및 크레인 일정계획)

  • 류광렬;김갑환;백영수;황준하;박영만
    • Journal of Intelligence and Information Systems
    • /
    • 제6권2호
    • /
    • pp.1-14
    • /
    • 2000
  • The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

  • PDF

Optimization of Cooperative Sensing in Interference-Aware Cognitive Radio Networks over Imperfect Reporting Channel

  • Kan, Changju;Wu, Qihui;Song, Fei;Ding, Guoru
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1208-1222
    • /
    • 2014
  • Due to the low utilization and scarcity of frequency spectrum in current spectrum allocation methodology, cognitive radio networks (CRNs) have been proposed as a promising method to solve the problem, of which spectrum sensing is an important technology to utilize the precious spectrum resources. In order to protect the primary user from being interfered, most of the related works focus only on the restriction of the missed detection probability, which may causes over-protection of the primary user. Thus the interference probability is defined and the interference-aware sensing model is introduced in this paper. The interference-aware sensing model takes the spatial conditions into consideration, and can further improve the network performance with good spectrum reuse opportunity. Meanwhile, as so many fading factors affect the spectrum channel, errors are inevitably exist in the reporting channel in cooperative sensing, which is improper to be ignored. Motivated by the above, in this paper, we study the throughput tradeoff for interference-aware cognitive radio networks over imperfect reporting channel. For the cooperative spectrum sensing, the K-out-of-N fusion rule is used. By jointly optimizing the sensing time and the parameter K value, the maximum throughput can be achieved. Theoretical analysis is given to prove the feasibility of the optimization and computer simulations also shows that the maximum throughput can be achieved when the sensing time and the parameter of K value are both optimized.

A Study on the Optimization of Suwon City Bus Route using GWR Model (GWR모델 이용한 수원시 일반버스노선 최적화에 관한 연구)

  • Park, Cheol Gyu;Cho, Seong Kil
    • Journal of Korean Society for Geospatial Information Science
    • /
    • 제22권1호
    • /
    • pp.41-46
    • /
    • 2014
  • Bus service is easily adjusted to accommodate the changed demand. Despite the flexibility of that, its relocation should overcome the following problems: first, Bus line rearrangement should consider the balance between the demand and the supply to enhance the transit equity among the users scattered around the area that supply against demand imbalances. Second, the existing demand analysed is to crude since the demand was analysed based on TAZ. mainly based on the Dong unit. Utilization of the GWR and GIS-T data can resolve the problem. In this paper, the limitation of the conventional transit demand analysis model is overcome by deploying the GWR model which identifies the transit demand based on the geographic relation between the service location and those of the users. GWR model considers the spatial effect of the bus demand in accordance with the distance to the each bus stops using SCD(Smart Card Data) and BIS(Bus Information System). This demand map was then superimposes with the existing bus route which identified the areas where the balance between demand and supply is severly skewed. since the analysis was computed with SCD and BIS at every bus stops. the shortage and surplus of bus service of entire study area could computed. Further. based on this computational result and considering the entire bus service capacity data. Bus routes optimization from the oversupplied areas to the undersupplied area was illustrated thus this study clearly compared the benefits the GIS.

Prediction of Ground Condition and Evaluation of its Uncertainty by Simulated Annealing (모의 담금질 기법을 이용한 지반 조건 추정 및 불확실성 평가에 관한 연구)

  • Ryu Dong-Woo
    • Tunnel and Underground Space
    • /
    • 제15권4호
    • /
    • pp.275-287
    • /
    • 2005
  • At the planning and design stages of a development of underground space or tunneling project, the information regarding ground conditions is very important to enhance economical efficiency and overall safety In general, the information can be expressed using RMR or Q-system and with the geophysical exploration image. RMR or Q-system can provide direct information of rock mass in a local scale for the design scheme. Oppositely, the image of geophysical exploration can provide an exthaustive but indirect information. These two types of the information have inherent uncertainties from various sources and are given in different scales and with their own physical meanings. Recently, RMR has been estimated in unsampled areas based on given data using geostatistical methods like Kriging and conditional simulation. In this study, simulated annealing(SA) is applied to overcome the shortcomings of Kriging methods or conditional simulations just using a primary variable. Using this technique, RMR and the image of geophysical exploration can be integrated to construct the spatial distribution of RM and to evaluate its uncertainty. The SA method was applied to solve an optimization problem with constraints. We have suggested the practical procedure of the SA technique for the uncertainty evaluation of RMR and also demonstrated this technique through an application, where it was used to identify the spatial distribution of RMR and quantify the uncertainty. For a geotechnical application, the objective functions of SA are defined using statistical models of RMR and the correlations between RMR and the reference image. The applicability and validity of this application are examined and then the result of uncertainty evaluation can be used to optimize the tunnel layout.