• 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.

• 한국시뮬레이션학회논문지
• /
• 제17권4호
• /
• pp.133-142
• /
• 2008

생산시스템의 유연성과 효율성을 동시에 만족시키기 위한 자재취급 시스템으로써 AGV 시스템을 사용한다. AGV 시스템은 전체 생산시스템의 성능을 결정하는 중요 요인으로써 최적 설계안의 도출이 필수적이다. 일반적으로 상용 시뮬레이션 소프트웨어를 이용하여 AGV 시스템 설계 검증이 이루어지고 있지만, 이러한 검증 과정을 신속히 처리하기 위한 일련의 절차에 대한 개발이 필요하다. 본 연구에서는 근사최적화된 일방향 흐름 경로와 다양한 운영 파라미터를 고려할 수 있는 일방향 AGV 시스템 시뮬레이터의 아키텍처를 제시 및 개발 하였다. 개발된 AGV 시스템 시뮬레이터는 Java를 기반으로 개발되었으며, 타부탐색을 이용한 근사최적 일방향 네트워크 설계를 지원하고, 사용자가 쉽게AGV 시스템의 설계 검증 및 대안분석에 사용할 수 있도록 개발되었다. 사용자의 시스템 설계 운영 정보는 입력창을 통해 입력되며 이 정보는 레이아웃 생성기, AGV 운영계획 생성기, 통합 AGVS 생성기로 구성된 시뮬레이션 엔진에서 자동으로 AGV 시스템을 모델링 및 시뮬레이션을 하여 빠른 시간 안에 시뮬레이터 사용자에게 피드백을 제공한다.

• 대한기계학회논문집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.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• 한국컴퓨터정보학회논문지
• /
• 제20권5호
• /
• pp.31-39
• /
• 2015

방향 가중 그래프의 차수제약 최소신장트리 (degree-constrained minimum spanning tree, d-MST) 문제는 정확한 해를 구하는 다항시간 알고리즘이 존재하지 않아 NP-완전 문제로 알려져 왔다. 따라서 휴리스틱한 근사 알고리즘을 적용하여 최적 해를 구하고 있다. 본 논문은 차수와 사이클을 검증하는 Kruskal 알고리즘으로 d-MST의 초기 해를 구하고, d-MST의 초기 해에 대해 k-opt를 수행하여 최적 해를 구하는 다항시간 알고리즘을 제안하였다. 제안된 알고리즘을 4개의 그래프에 적용한 결과 2-MST까지 최적 해를 구할 수 있었다.

• 한국경영과학회지
• /
• 제38권4호
• /
• pp.65-78
• /
• 2013

Circular shareholding is established when at least three member firms in a business group hold stock in other member firms and form a series of ownership in a circular way. Although there have been many studies which investigated a negative effect of circular shareholding on firm's value, few studies have discussed how to resolve the problem given complicated ownership structures of large business groups. This paper is based on a mixed integer programming model, which was proposed in the author's previous research and can identify the ownership share divested in order to resolve circular shareholding. Since the optimization model becomes too complicated for large business groups and requires a sophisticated software to solve it, we propose a simple heuristic method that can find a good approximate solution to the model. Its applications to twelve Korean large business groups show that the heuristic method is not just computationally attractive but also provides near-optimal solutions in most cases.

• 대한교통학회지
• /
• 제5권1호
• /
• pp.3-23
• /
• 1987

Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권3호
• /
• pp.169-180
• /
• 2009

A discontinuous Galerkin method with interior penalty terms is presented for linear Sobolev equation. On appropriate finite element spaces, we apply a symmetric interior penalty Galerkin method to formulate semidiscrete approximate solutions. To deal with a damping term $\nabla{\cdot}({\nabla}u_t)$ included in Sobolev equations, which is the distinct character compared to parabolic differential equations, we choose special test functions. A priori error estimate for the semidiscrete time scheme is analyzed and an optimal $L^\infty(L^2)$ error estimation is derived.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1638-1641
• /
• 2002

A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. In this paper, we will focus on an important subclass of distributed partial CSP called the distributed maximal CSP that can be applied to more practical kinds of problems. Specifically, we propose a method of solving distributed mammal CSPs using a combination of approximate and exact algorithms that yields faster optimal solutions than otherwise possible using conventional methods. Experimental results are presented that demonstrate the effectiveness of the proposed new approach.

• 한국조명전기설비학회:학술대회논문집
• /
• 한국조명전기설비학회 2004년도 춘계학술대회 논문집
• /
• pp.490-491
• /
• 2004

Recently, sectionalizing switches have been coming to be operated by remote control through the distribution SCADA system. However, the problem of determining the optimal switching sequence is a combinatorial optimization problem, and is quite difficult to solve. Hence, it is imperative to develop practically applicable solution algorithms for this problem. Several efficient algorithms have been developed for finding approximate solutions to such problems. these algorithms create a new arbitral distribution system configuration from an initial configuration, and some of these algorithms do not show a load transfer sequence to reach the objective system.