• 제목/요약/키워드: approximate optimal solution

검색결과 108건 처리시간 0.029초

Design of Genetic Algorithm-based Parking System for an Autonomous Vehicle

  • Xiong, Xing;Choi, Byung-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제9권4호
    • /
    • pp.275-280
    • /
    • 2009
  • A Genetic Algorithm (GA) is a kind of search techniques used to find exact or approximate solutions to optimization and searching problems. This paper discusses the design of a genetic algorithm-based intelligent parking system. This is a search strategy based on the model of evolution to solve the problem of parking systems. A genetic algorithm for an optimal solution is used to find a series of optimal angles of the moving vehicle at a parking space autonomously. This algorithm makes the planning simpler and the movement more effective. At last we present some simulation results.

인지라디오 네트워크에서 전력과 부반송파 할당을 위한 휴리스틱 (An Heuristic for Joint Assignments of Power and Subcarriers in Cognitive Radio Networks)

  • 백천현
    • 경영과학
    • /
    • 제29권2호
    • /
    • pp.65-77
    • /
    • 2012
  • With the explosivley increasing demand in wireless telecommunication service, the shortage of radio spectrum has been worsen. The traditional approach of the current fixed spectrum allocation leads to spectrum underutilization. Recently, CR (Cognitive Radio) technologies are proposed to enhance the spectrum utilization by allocating dynamically radio resources to CR Networks. In this study, we consider a radio resource(power, subcarrier) allocation problem for OFDMA-based CRN in which a base station supports a variety of CUs (CRN Users) while avoiding the radio interference to PRN (Primary Radio Network). The problem is mathematically formulated as a general 0-1 IP problem. The optimal solution method for the IP problem requires an unrealistic execution time due to its complexity. Therefore, we propose an heuristic that gives an approximate solution within a reasonable execution time.

A NUMERICAL SCHEME TO SOLVE NONLINEAR BSDES WITH LIPSCHITZ AND NON-LIPSCHITZ COEFFICIENTS

  • FARD OMID S.;KAMYAD ALl V.
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.73-93
    • /
    • 2005
  • In this paper, we attempt to present a new numerical approach to solve non-linear backward stochastic differential equations. First, we present some definitions and theorems to obtain the conditions, from which we can approximate the non-linear term of the backward stochastic differential equation (BSDE) and we get a continuous piecewise linear BSDE correspond with the original BSDE. We use the relationship between backward stochastic differential equations and stochastic controls by interpreting BSDEs as some stochastic optimal control problems, to solve the approximated BSDE and we prove that the approximated solution converges to the exact solution of the original non-linear BSDE in two different cases.

데이터베이스 설계에서 SOFM 을 이용한 화일 수직분할 방법 (A Vertical File Partitioning Method Using SOFM in Database Design)

  • 신광호;김재련
    • 대한산업공학회지
    • /
    • 제24권4호
    • /
    • pp.661-671
    • /
    • 1998
  • It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

  • PDF

모듈 선체형 삼동 폰툰 보트의 구조설계 민감도 평가와 근사 최적화 해석 (Sensitivity Evaluation and Approximate Optimization Analysis for Structure Design of Module Hull Type Trimaran Pontoon Boat)

  • 최보엽;손창련;손준식;박민호;송창용
    • 한국산업융합학회 논문집
    • /
    • 제26권6_3호
    • /
    • pp.1279-1288
    • /
    • 2023
  • Recently, domestic leisure boats have been actively researching eco-friendly product development to enter the global market. Since the hulls of existing leisure boats are mainly made of fiber reinforced plastic (FRP) or aluminum, design techniques for securing structural safety by applying related materials have been mainly studied. In this study, an initial structural design safety assessment of a trimaran pontoon leisure boat with a modular hull structure and eco-friendly high-density polyethylene (HDPE) material was conducted, and sensitivity evaluation and optimization analysis for lightweight design were performed. The initial structural design safety assessment was carried out by creating a finite element analysis model and applying the loading conditions specified in the ship classification regulation to check whether the specified allowable stresses are satisfied. For the sensitivity evaluation, the influence of stress and weight of each hull structural member was evaluated using the orthogonal array design of experiments method, and an approximate model based on the response surface method was generated using the results of the design of experiments. The optimization analysis set the thickness of the hull structural members as the design variable and considered the optimal design formulation to minimize the weight while satisfying the allowable stress. The algorithm of the optimization analysis applied the Gradient-population Based Optimizer (GBO) to improve the accuracy of the optimal solution convergence while reducing the numerical cost. Through this study, the optimal design of a newly developed eco-friendly trimaran pontoon leisure boat with a weight reduction of 10% was presented.

금형 내부 압력 최소화를 위한 자동차 인스트루먼트 패널의 게이트 위치 최적화 (Gate Locations Optimization of an Automotive Instrument Panel for Minimizing Cavity Pressure)

  • 조성빈;박창현;표병기;최동훈
    • 한국정밀공학회지
    • /
    • 제29권6호
    • /
    • pp.648-653
    • /
    • 2012
  • Cavity pressure, an important factor in injection molding process, should be minimized to enhance injection molding quality. In this study, we decided the locations of valve gates to minimize the maximum cavity pressure. To solve this problem, we integrated MAPS-3D (Mold Analysis and Plastic Solution-3Dimension), a commercial injection molding analysis CAE tool, using the file parsing method of PIAnO (Process Integration, Automation and Optimization) as a commercial process integration and design optimization tool. In order to reduce the computational time for obtaining the optimal design solution, we performed an approximate optimization using a meta-model that replaced expensive computer simulations. To generate the meta-model, computer simulations were performed at the design points selected using the optimal Latin hypercube design as an experimental design. Then, we used micro genetic algorithm equipped in PIAnO to obtain the optimal design solution. Using the proposed design approach, the maximum cavity pressure was reduced by 17.3% compared to the initial one, which clearly showed the validity of the proposed design approach.

볼록최적화에 의거한 구조계와 제어계의 동시최적화 - 근사적 어프로치 - (Simultaneous Optimization of Structure and Control Systems Based on Convex Optimization - An approximate Approach -)

  • 손회수
    • 대한기계학회논문집A
    • /
    • 제27권8호
    • /
    • pp.1353-1362
    • /
    • 2003
  • This paper considers a simultaneous optimization problem of structure and control systems. The problem is generally formulated as a non-convex optimization problem for the design parameters of mechanical structure and controller. Therefore, it is not easy to obtain the global solutions for practical problems. In this paper, we parameterize all design parameters of the mechanical structure such that the parameters work in the control system as decentralized static output feedback gains. Using this parameterization, we have formulated a simultaneous optimization problem in which the design specification is defined by the Η$_2$and Η$\_$$\infty$/ norms of the closed loop transfer function. So as to lead to a convex problem we approximate the nonlinear terms of design parameters to the linear terms. Then, we propose a convex optimization method that is based on linear matrix inequality (LMI). Using this method, we can surely obtain suboptimal solution for the design specification. A numerical example is given to illustrate the effectiveness of the proposed method.

협력 통신을 이용한 LTE-Advanced 릴레이 시스템을 위한 하향링크 통합 자원할당 및 경로선택 기법 (A Joint Allocation and Path Selection Scheme for Downlink Transmission in LTE-Advanced Relay System with Cooperative Relays)

  • 이혁준;엄태현
    • 한국ITS학회 논문지
    • /
    • 제17권6호
    • /
    • pp.211-223
    • /
    • 2018
  • 릴레이 시스템은 커버리지 확장과 셀 경계(Cell-Edge)의 시스템 처리량 향상을 목적으로 4세대 이동통신 시스템에 적용되어 왔다. 릴레이 시스템은 커버리지 확장과 시스템 처리량 증대에 효과적이지만 기존 단일 홉 시스템과 달리 추가 자원을 사용하기 때문에 릴레이 시스템에 특화된 경로선택 및 무선자원 할당 알고리즘의 적용을 요구한다. 본 논문에서는 협력 통신을 이용하는 LTE-Advanced 릴레이 시스템을 위한 통합 경로선택 및 자원할당 기법을 제안한다. 제안하는 기법은 라그랑지 승수 기반의 휴리스틱 알고리즘으로, 다중차원 다중선택 배낭 문제(Multi-dimensional Multi-choice Knapsack Problem)의 형태로 정의된 협력 통신 기반의 LTE-Advanced 릴레이 시스템 하향링크 처리율 최대화 문제의 근사 해를 구한다. 제안된 기법에 의해 도출된 근사 해의 성능이 최적 해의 성능에 충분히 근접할 수 있음을 시뮬레이션을 통해 보인다.

IEEE 802.16j 멀티홉 릴레이 네트워크를 위한 통합 자원 할당-라우팅 기법 (A Joint Resource Allocation and Routing Scheme for the IEEE 802.16j Multi-hop Relay Networks)

  • 이경주;이혁준
    • 한국ITS학회 논문지
    • /
    • 제8권1호
    • /
    • pp.82-91
    • /
    • 2009
  • 기지국과 이동 단말 간의 경로 설정, 즉 라우팅은 멀티홉 셀룰러 시스템의 핵심 기술 중 하나이다. 또한, 멀티홉 셀룰러 시스템에서 기지국과 중계기들이 각 셀의 자원을 공유하므로, 전체 시스템의 가용 무선 자원을 최대한 이용할 수 있는 자원 할당 기법이 필요하다. 본 논문에서는 OFDMA 기반 멀티홉 셀룰러 시스템을 위한 통합 자원할당-라우팅 기법을 제안한다. 제안하는 기법은 전체 시스템의 하향 링크 처리율을 최대화하기 위한 통합 자원 할당-라우팅 문제를 MMKP 기반 휴리스틱 알고리즘을 이용하여 근사 해를 구한다. 실험 결과는 제안하는 기법이 시스템의 하향 링크 처리율 측면에서 링크 품질 기반 라우팅 기법보다 높은 성능을 나타내며, 최적 해를 도출하는 기법에 근접한 성능을 나타냄을 보인다.

  • PDF

대형 유클리드 최소신장트리 문제해결을 위한 다항시간 근사 법 (A Polynomial Time Approximation Scheme for Enormous Euclidean Minimum Spanning Tree Problem)

  • 김인범
    • 전자공학회논문지CI
    • /
    • 제48권5호
    • /
    • pp.64-73
    • /
    • 2011
  • 유클리드 최소 신장 트리(EMST) 문제는 2차원 평면상에 존재하는 입력노드들을 최소 비용으로 연결하는 것이다. EMST와 같은 다항 시간문제에 대하여 연구된 알고리즘들은 수많은 입력들에 대하여 최적의 해를 얻기 위해 매우 많은 시간을 필요로 한다. 본 논문에서는 이 문제에 대한 해를 구하기 위해 분할과 병렬기법을 활용한 다항 시간 근사법(PTAS)을 제안하는데, 이 기법은 비교적 짧은 시간 내에 매우 큰 근사 EMST를 생성할 수 있다. 순수 PTAS는 비-다항 시간문제를 위해 개발되었지만, 다이내믹 프로그래밍을 활용하여 이것을 대형 EMST에 적용하였다. 제안된 방법에 의해 생성된 15,000개의 입력 단말노드와 16개의 분할 영역으로 구성된 근사 EMST의 생성 실험에서, 직렬 방식은 89%, 병렬 방식은 99%의 실행시간의 감축을 보였다. 따라서 본 논문에서 제안하는 방법은 평면상의 매우 많은 수의 입력 단말 노드에 대하여 근사 EMST를 신속히 구축해야 하는 응용에 잘 적용될 수 있다.