• 제목/요약/키워드: Combined optimization strategy

검색결과 68건 처리시간 0.021초

전략적 제휴를 고려한 택배 서비스 네트워크 재설계를 위한 최적화/시뮬레이션 반복기법의 적용 (A Combined Optimization/Simulation Approach to the Reconfiguration of Express Delivery Service Network for Strategic Alliance)

  • 고창성;김홍배;고현정
    • 한국항해항만학회지
    • /
    • 제37권3호
    • /
    • pp.321-327
    • /
    • 2013
  • As the market of express delivery services expands rapidly, delivery service companies are exposed to severe competition. As a result of the surplus of delivery companies, they are struggling with remaining competitive at a reasonable price with appropriate level of customer satisfaction. To cope with competition pressures, a strategic alliance is suggested as an effective solution to the challenges faced by small and medium enterprises (SMEs) in express delivery services. Therefore, this study suggests a combined optimization and simulation approach to the reconfiguration of an express delivery service network for strategic alliance with respect to strategy partnership of closing/keeping service centers among companies involved and adjustments of their cutoff times. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the approach.

A Numerical Approach for Station Keeping of Geostationary Satellite Using Hybrid Propagator and Optimization Technique

  • Jung, Ok-Chul;No, Tae-Soo;Kim, Hae-Dong;Kim, Eun-Kyou
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제8권1호
    • /
    • pp.122-128
    • /
    • 2007
  • In this paper, a method of station keeping strategy using relative orbital motion and numerical optimization technique is presented for geostationary satellite. Relative position vector with respect to an ideal geostationary orbit is generated using high precision orbit propagation, and compressed in terms of polynomial and trigonometric function. Then, this relative orbit model is combined with optimization scheme to propose a very efficient and flexible method of station keeping planning. Proper selection of objective and constraint functions for optimization can yield a variety of station keeping methods improved over the classical ones. Nonlinear simulation results have been shown to support such concept.

와이어로 구동하는 적층형 다관절 구조를 지닌 수술 로봇의 구동 속도를 고려한 기구학적 제어기의 게인 최적화 (Gain Optimization of Kinematic Control for Wire-driven Surgical Robot with Layered Joint Structure Considering Actuation Velocity Bound)

  • 진상록;한석영
    • 로봇학회논문지
    • /
    • 제15권3호
    • /
    • pp.212-220
    • /
    • 2020
  • This paper deals with a strategy of gain optimization for the kinematic control algorithm of a wire-driven surgical robot. The proposed controller consists of the closed-loop inverse kinematics with the back-calculation method. The closed-loop inverse kinematics has 18 PID control gains, and the back-calculation method has 6 gains. An efficient strategy is designed to optimize 18 values first and then the remaining 6 values. The optimal gain sets are searched under the step input with performance indices. In this gain optimization, the objective function is defined as the minimum value of signal-to-noise ratio of the performance indices for 6 DoF (Degree-of-Freedom) motion that is based on the Taguchi method, and the constraints are applied to obtain stable responses for each motion evenly. The gain sets obtained are verified by simulations using the test trajectories. In comparative results, the optimal gain value based on the performance index combined with ISE (integral of square error) and settling time showed the best control performance.

대규모 최적화 문제의 일반화된 교차 분할 알고리듬과 응용 (Generalized Cross Decomposition Algorithm for Large Scale Optimization Problems with Applications)

  • 최경현;곽호만
    • 대한산업공학회지
    • /
    • 제26권2호
    • /
    • pp.117-127
    • /
    • 2000
  • In this paper, we propose a new convex combination weight rule for the cross decomposition method which is known to be one of the most reliable and promising strategies for the large scale optimization problems. It is called generalized cross decomposition, a modification of linear mean value cross decomposition for specially structured linear programming problems. This scheme puts more weights on the recent subproblem solutions other than the average. With this strategy, we are having more room for selecting convex combination weights depending on the problem structure and the convergence behavior, and then, we may choose a rule for either faster convergence for getting quick bounds or more accurate solution. Also, we can improve the slow end-tail behavior by using some combined rules. Also, we provide some computational test results that show the superiority of this strategy to the mean value cross decomposition in computational time and the quality of bounds.

  • PDF

Microstrip Directional Coupler Design with High Performance Using Optimization based on Evolution Strategy

  • Joung, Myoung-Sub;Park, Jun-Seok;Kim, Hyeong-Seok;Lim, Jae-Bong;Cho, Hong-Goo
    • KIEE International Transactions on Electrophysics and Applications
    • /
    • 제4C권6호
    • /
    • pp.276-281
    • /
    • 2004
  • In this paper, the optimal design of a novel microstrip directional coupler with a grooved housing for high directivity characteristic is presented. It will be shown that the high directivity of the microstrip coupler can be achieved simply by attaching an optimized housing structure. over the microstrip, which is much easier to fabricate than other conventional types. The dimensions of the proposed structure are maximized by using (1+1) evolution strategy (ES) combined with the deterministic algorithm. To improve the effectiveness of the results, efficient optimization procedures suitable for the model are proposed. From these results, it is determined that the proposed structure indicates an improved directivity. The optimized results are verified by full wave analysis at the center frequency of 850MHz.

물성치의 불확실성을 고려한 자유단이 있는 복합재료 적층평판의 최적화 (Layup Optimization of Composite Laminates with Free Edge Considering Bounded Uncertainty)

  • 조맹효;이승윤
    • 한국복합재료학회:학술대회논문집
    • /
    • 한국복합재료학회 2001년도 춘계학술발표대회 논문집
    • /
    • pp.155-158
    • /
    • 2001
  • The layup optimization by genetic algorithm (GA) for the strength of laminated composites with free-edge is presented. For the calculation of interlaminar stresses of composite laminates with free edges, extended Kantorovich method is applied. In the formulation of GA, repair strategy is adopted for the satisfaction of given constraints. In order to consider the bounded uncertainty of material properties, convex modeling is used. Results of GA optimization with scattered properties are compared with those of optimization with nominal properties. The GA combined with convex modeling can work as a practical tool for light weight design of laminated composite structures since uncertainties are always encountered in composite materials.

  • PDF

물성치의 불확실성을 고려한 층간강도의 최적화 (Optimization of interlaminar strength with uncertainty of material properties)

  • 조맹효;이승윤
    • 한국복합재료학회:학술대회논문집
    • /
    • 한국복합재료학회 2001년도 추계학술발표대회 논문집
    • /
    • pp.70-73
    • /
    • 2001
  • The layup optimization by genetic algorithm (GA) for the interlaminar strength of laminated composites with free edge is presented. For the calculation of interlaminar stresses of composite laminates with free edges, extended Kantorovich method is applied. In the formulation of GA, repair strategy is adopted for the satisfaction of given constraints. In order to consider the bounded uncertainty of material properties, convex modeling is used. Results of GA optimization with scattered properties are compared with those of optimization with nominal properties. The GA combined with convex modeling can work as a practical tool for maximum interlaminar strength design of laminated composite structures, since uncertainties are always encountered in composite materials and the optimal results can be changed.

  • PDF

A Hybrid Estimation of Distribution Algorithm with Differential Evolution based on Self-adaptive Strategy

  • Fan, Debin;Lee, Jaewan
    • 인터넷정보학회논문지
    • /
    • 제22권1호
    • /
    • pp.1-11
    • /
    • 2021
  • Estimation of distribution algorithm (EDA) is a popular stochastic metaheuristic algorithm. EDA has been widely utilized in various optimization problems. However, it has been shown that the diversity of the population gradually decreases during the iterations, which makes EDA easily lead to premature convergence. This article introduces a hybrid estimation of distribution algorithm (EDA) with differential evolution (DE) based on self-adaptive strategy, namely HEDADE-SA. Firstly, an alternative probability model is used in sampling to improve population diversity. Secondly, the proposed algorithm is combined with DE, and a self-adaptive strategy is adopted to improve the convergence speed of the algorithm. Finally, twenty-five benchmark problems are conducted to verify the performance of HEDADE-SA. Experimental results indicate that HEDADE-SA is a feasible and effective algorithm.

복합 유전자 알고리즘에서의 국부 탐색을 위한 셀룰러 학습 전략 (A Cellular Learning Strategy for Local Search in Hybrid Genetic Algorithms)

  • 고명숙;길준민
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제28권9호
    • /
    • pp.669-680
    • /
    • 2001
  • 유전자 알고리즘(GA:Genetic Algorithm)은 최적화 문제를 풀기 위해 생물학적 진화(evolution) 과정을 모방한 최적화 알고리즘이다. 유전자 알고리즘은 복잡한 상태 공간에서 최적 해를 찾기 위해 전통적인 최적화 기법과는 달리 유향적 임의 탐색을 행한다. 학습에 해당하는 국부 탐색(local search)을 유전적 알고리즘은 exploration 탐색과 exploitation 탐색의 균형을 유지시켜 줄 수 있는 한 방법이다. 모집단 내의 각 개체가 진화 과정 중에 학습한 유전적 특질들은 그 다음 세대에서 되물림 되며 이러한 학습(learning) 과정을 유전자 알고리즘과 결합시킴으로써 탐색 속도의 향상을 기대할 수 있다. 이 논문에서는 함수 최적화를 위해 속도를 개선한 셀룰러 학습을 기반으로 하는 유전자 알고리즘을 제안한다. 제안하는 셀룰러 학습 전략은 셀룰러 오토마타의 주기성과 수렴성을 기반으로 하며, 유기체가 그 개체의 생명 주기의 한 세대에서 얻게되는 지식과 경험들을 자손에게 전달한다는 이론을 바탕으로 한다. 제안한 셀룰러 학습 전략의 효율을 기존의 복합 유전자 알고리즘에서의 라마키안 진화 및 볼드윈 효과와 비교하였다. 다양한 테스트 베드 함수에 대한 실험을 통하여 셀룰러 학습에 의한 개체의 국부적 향상이 전체적인 성능 향상에 기여함을 알 수 있었고 제안한 학습 전략이 기존의 방법보다 더 빨리 전역 최적 해를 찾을 수 있음을 증명하였다.

  • PDF

유전자알고리즘에 의한 골조구조물의 부재설계 (Member Design of Frame Structure Using Genetic Algorithm)

  • 이홍우
    • 한국공간구조학회논문집
    • /
    • 제4권4호
    • /
    • pp.91-98
    • /
    • 2004
  • 유전자 알고리즘은 가장 훌륭한 이산최적화 기법 중 하나이다. 그러나, 유전자 알고리즘은 무제약 최적화 기법이기 때문에 제약조건은 간접적으로 표현된다. 가장 일반적인 방법은 벌칙함수를 사용하여 제약 문제를 무제약 문제로 변환하는 것이다. 본 연구에서는 적합도에 벌점함수를 적용하여 거부전략, 벌점전략, 복합전략 등에 따른 3가지 함수를 구성하였다. 그리고, 이 적합도 함수들을 사용한 설계프로그램을 구현하고, 산형골조와 2층 3경간 골조의 설계문제에 적용시켜 설계결과를 비교하였다. 이를 통하여 유전자 알고리즘을 이용한 유용한 골조 설계프로그램의 구현이 가능할 것으로 판단된다.

  • PDF