• 전기학회논문지
• /
• 제58권6호
• /
• pp.1093-1099
• /
• 2009

Alternative energy sources such as renewable energy like solar power systems, wind power systems, or fuel cell power systems has been the rising issue in the electrical power system. This paper discusses an economic study analysis of fuel cells in the korean electricity market. It includes the basic concept of a fuel cell and the korean electricity market. It also describes the need of renewable energy and how the fuel cell is connected with the local grid. This paper shows the impact of production and recovering thermal energy of a grid-connected fuel cell power system. The profit maximization approach has been structured including electrical power trade with the local grid and heat trade within the micro-grid. The strategies are evaluated using a local load that uses electric and thermal power which has different patterns between summer and winter periods. The solution algorithm is not newly developed one, but is solved by an application called GAMS. Results indicate the need and usefulness of a fuel cell power system.

• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.114-122
• /
• 2010

The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

• Steel and Composite Structures
• /
• 제48권6호
• /
• pp.611-623
• /
• 2023

This work considered an optimal control formulation in the sense of Caputo derivatives. The optimality of the fractional optimal control problem. The tumor immune interaction in fractional form provides an excellent tool for the description of memory and hereditary properties of inter and intra cells. So the interaction between effector-cells, tumor cells and are modeled by using the definition of Caputo fractional order derivative that provides the system with long-time memory and gives extra degree of freedom. In addiltion, existence and local stability of fixed points are investigated for discrete model. Moreover, in order to achieve more efficient computational results of fractional-order system, a discretization process is performed to obtain its discrete counterpart. Our technique likewise allows the advancement of results, such as return time to baseline that are unrealistic with current model solvers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2038-2057
• /
• 2017

Gaussian learning is a new technology in the computational intelligence area. However, this technology weakens the learning ability of a particle swarm and achieves a lack of diversity. Thus, this paper proposes a vector Gaussian learning strategy and presents an effective approach, named particle swarm optimization based on vector Gaussian learning. The experiments show that the algorithm is more close to the optimal solution and the better search efficiency after we use vector Gaussian learning strategy. The strategy adopts vector Gaussian learning to generate the Gaussian solution of a swarm's optimal location, increases the learning ability of the swarm's optimal location, and maintains the diversity of the swarm. The method divides the states into normal and premature states by analyzing the state threshold of the swarm. If the swarm is in the premature category, the algorithm adopts an inertia weight strategy that decreases linearly in addition to vector Gaussian learning; otherwise, it uses a fixed inertia weight strategy. Experiments are conducted on eight well-known benchmark functions to verify the performance of the new approach. The results demonstrate promising performance of the new method in terms of convergence velocity and precision, with an improved ability to escape from a local optimum.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• pp.327-329
• /
• 2001

This paper presents the application of Parallel genetic algorithm and parallel tabu search to search an optimal solution of a unit commitment problem. The proposed method previously searches the solution globally using the parallel genetic algorithm, and then searches the solution locally using tabu search which has the good local search characteristic to reduce the computation time. This method combines the benefit of both method, and thus improves the performance. To show the usefulness of the proposed method, we simulated for 10 units system. Numerical results show the improvements of cost and computation time compared to previous obtained results.

• 정보처리학회논문지B
• /
• 제16B권4호
• /
• pp.319-326
• /
• 2009

PSO(Particle Swarm Optimization)는 군집(swarm)을 구성하는 단순한 개체들인 입자(particle)들이 각자의 경험을 공유하여 문제의 해답을 찾는 최적화 알고리즘으로 다양한 분야에서 응용되고 있다. PSO에 대한 연구는 최적화를 위해 군집이 적합한 영역으로 빠르게 수렴하도록 하는 파라미터 값의 선정, 토폴로지, 입자의 이동에서 주로 이루어지고 있다. 표준 PSO 알고리즘은 입자 자신과 최고의 이웃이 제공하는 정보만을 이용해서 이동하므로 다양한 영역을 탐색하지 못하고 지역적 최적점에 조기 수렴하는 경향이 있다. 본 논문에서는 군집이 다양한 영역을 탐색하기 위해, 각 입자는 더 나은 경험을 가진 이웃입자들의 정보를 상대적인 중요도에 따라서 참조하여 이동하도록 하였다. 다양한 영역의 탐색은 표준 PSO 알고리즘보다 지역적 최적화의 확률을 줄이고 탐색 속도를 가속화하며 탐색의 성공률을 높일 수 있다. 또한 군집이 지역적 미니멈으로부터 벗어나기 위한 검사 전략을 제안하여 탐색의 성공률을 높였다. 제안한 PSO 알고리즘을 평가하기 위하여, 벤치마크 함수들에 적용한 결과 최적화의 진행 속도 개선과 탐색 성공률의 향상이 있었다.

• 한국지능시스템학회논문지
• /
• 제10권5호
• /
• pp.432-441
• /
• 2000

본 논문은 기존의 수학적인 모델링으로는 만족스러운 결과를 얻기 어려운 복잡하고 불확실한 비선형 시스템에 대한 퍼지 모델링 기법을 다룬다. 유전 알고리듬은 어느 정도 최적해를 전역적으로 찾을 수 있기 때문에 퍼지 모델링시에 파라미커와 구조를 동정하기 위하여 사용되었다. 하지만, 유전 알고리듬은 개체군이 유전적 다양성을 잃었을 경우 조기 수렴한다는 문제점이 있으며 바이러스-진화 유전 알고리듬은 이러한 지역수렴에 대한 방아닝 될 수 있다. 따라서, 본 논문에서는 바이러스 이론이 적용된 VEGA를 퍼지 모델링 할 때 이용할 수 있는 방법을 제안한다. 이 방법에서는 지역정보가 개체군 내에서 교환됨으로써 유전적 다양성을 유지하게 된다. 마지막으로, 본 논문에서 제안한 방법의 우수성과 일반성을 평가하기 위해 몇 가지의 수치적 예제를 제공한다.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• 한국소음진동공학회논문집
• /
• 제12권5호
• /
• pp.380-388
• /
• 2002

This paper describes the optimum design for low-pressure steam turbine rotor of 1,000 MW nuclear power plant by using a combined genetic algorithm, which uses both a genetic algorithm and a local concentrate search algorithm (e.g. simplex method). This algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The objective is to minimize the resonance response (Q factor) and total weight of the shaft, and to separate the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables. The results show that the proposed algorithm can improve the Q factor and reduce the weight of the shaft and the 1st critical speed.

• 디지털콘텐츠학회 논문지
• /
• 제18권5호
• /
• pp.969-976
• /
• 2017

본 논문에서는 최적화 알고리즘으로 개발된 WFSO(Water Flowing and Shaking Optimization) 알고리즘을 사용한 인공신경망 과합성공 신경망의 학습 방법을 제안한다. 최적화 알고리즘은 다수의 후보 해를 기반으로 탐색해 나가기 때문에 일반적으로 속도가 느린 단점이 있으나 지역 최소값에 거의 빠지지 않고 병렬화가 용이하며 미분 불가능한 활성화함수를 갖는 인공신경망 학습도 가능하고 구조와 가중치를 동시에 최적화 할 수 있는 장점이 있다. 본 논문에서는 WFSO 알고리즘을 인공신경망 학습에 적용하는 방법을 설명하고 다층 인공신경망과 합성곱 신경망에서 오류역전파 알고리즘과 성능을 비교한다.