• Title/Summary/Keyword: resource optimization

검색결과 540건 처리시간 0.203초

Evolutionary Network Optimization: Hybrid Genetic Algorithms Approach

  • Gen, Mitsuo
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.195-204
    • /
    • 2003
  • Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

  • PDF

GAME MODEL AND ITS SOLVING METHOD FOR OPTIMAL SCALE OF POWER PLANTS ENTERING GENERATION POWER MARKET

  • Tan, Zhongfu;Chen, Guangjuan;Li, Xiaojun
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.337-347
    • /
    • 2008
  • Based on social welfare maximum theory, the optimal scale of power plants entering generation power market being is researched. A static non-cooperative game model for short-term optimization of power plants with different cost is presented. And the equilibrium solutions and the total social welfare are obtained. According to principle of maximum social welfare selection, the optimization model is solved, optimal number of power plants entering the market is determined. The optimization results can not only increase the customer surplus and improve power production efficiency, but also sustain normal profits of power plants and scale economy of power production, and the waste of resource can also be avoided. At last, case results show that the proposed model is efficient.

  • PDF

마이크로 그리드 운영비용 최소화를 위한 Harmony Search 알고리즘 응용 (An Application of Harmony Search Algorithm for Operational Cost Minimization of MicroGrid System)

  • 이상봉;김규호;김철환
    • 전기학회논문지
    • /
    • 제58권7호
    • /
    • pp.1287-1293
    • /
    • 2009
  • This paper presents an application of Harmony Search (HM) meta-heuristic optimization algorithm for optimal operation of microgrid system. The microgrid system considered in this paper consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile which divided 20 minute data and wind resource for wind turbine generator were used for the study. In optimization, the HS algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch and having its nature of fast convergency time as compared to other optimization method.

Comparison of Three Evolutionary Algorithms: GA, PSO, and DE

  • Kachitvichyanukul, Voratas
    • Industrial Engineering and Management Systems
    • /
    • 제11권3호
    • /
    • pp.215-223
    • /
    • 2012
  • This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The general observations on the similarities and differences among the three algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource constrained project scheduling problems.

DS 알고리즘을 이용한 마이크로 그리드 최적운영기법 (Optimal Operation Method of Microgrid System Using DS Algorithm)

  • 박시나;이상봉
    • 조명전기설비학회논문지
    • /
    • 제29권5호
    • /
    • pp.34-40
    • /
    • 2015
  • This paper presents an application of Differential Search (DS) meta-heuristic optimization algorithm for optimal operation of micro grid system. DS algorithm has the benefit of high convergence rate and precision compared to other optimization methods. The micro grid system consists of a wind turbine, a diesel generator, and a fuel cell. The simulation is applied to micro grid system only. The wind turbine generator is modeled by considering the characteristics of variable output. One day load data which is divided every 20 minute and wind resource for wind turbine generator are used for the study. The method using the proposed DS algorithm is easy to implement, and the results of the convergence performance are better than other optimization algorithms.

Energy-efficient Power Allocation based on worst-case performance optimization under channel uncertainties

  • Song, Xin;Dong, Li;Huang, Xue;Qin, Lei;Han, Xiuwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권11호
    • /
    • pp.4595-4610
    • /
    • 2020
  • In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

Optimal Resource Planning with Interference Coordination for Relay-Based Cellular Networks

  • Kim, Taejoon;An, Kwanghoon;Yu, Heejung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5264-5281
    • /
    • 2017
  • Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.

Virtual Resource Allocation in Virtualized Small Cell Networks with Physical-Layer Network Coding Aided Self-Backhauls

  • Cheng, Yulun;Yang, Longxiang;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권8호
    • /
    • pp.3841-3861
    • /
    • 2017
  • Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

Enhancing Astaxanthin Accumulation in Haematococcus pluvialis by Coupled Light Intensity and Nitrogen Starvation in Column Photobioreactors

  • Zhang, Wen-wen;Zhou, Xue-fei;Zhang, Ya-lei;Cheng, Peng-fei;Ma, Rui;Cheng, Wen-long;Chu, Hua-qiang
    • Journal of Microbiology and Biotechnology
    • /
    • 제28권12호
    • /
    • pp.2019-2028
    • /
    • 2018
  • Natural astaxanthin mainly derives from a microalgae producer, Haematococcus pluvialis. The induction of nitrogen starvation and high light intensity is particularly significant for boosting astaxanthin production. However, the different responses to light intensity and nitrogen starvation needed to be analyzed for biomass growth and astaxanthin accumulation. The results showed that the highest level of astaxanthin production was achieved in nitrogen starvation, and was 1.64 times higher than the control group at 11 days. With regard to the optimization of light intensity utilization, it was at $200{\mu}mo/m^2/s$ under nitrogen starvation that the highest astaxanthin productivity per light intensity was achieved. In addition, both high light intensity and a nitrogen source had significant effects on multiple indicators. For example, high light intensity had a greater significant effect than a nitrogen source on biomass dry weight, astaxanthin yield and astaxanthin productivity; in contrast, nitrogen starvation was more beneficial for enhancing astaxanthin content per dry weight biomass. The data indicate that high light intensity synergizes with nitrogen starvation to stimulate the biosynthesis of astaxanthin.

최적포트폴리오 기법을 이용한 개방형 전산 환경의 안정성 확보에 관한 연구 (Minimizing the Risk of an Open Computing Environment Using the MAD Portfolio Optimization)

  • 김학진;박지현
    • 지능정보연구
    • /
    • 제15권2호
    • /
    • pp.15-31
    • /
    • 2009
  • 차세대 전산환경은 사용자들이 필요한 전산자원을 네트워크를 통해 공급받는 그리드 컴퓨팅 기반의 개방형 전산환경으로 진화할 것으로 예상된다. 개방형 전산환경의 도입은 전산자원 활용의 효율성을 높이고 협업을 증진시키며 공급의 유연성과 비용 절감 등의 효과를 가져올 수 있다. 그러나 네트워크를 통해 공급되는 특성으로 인해 개방형 전산 자원의 성능에는 변동성이 수반된다. 전산자원의 성능에 변동성이 있는 경우, 주어진 예산과 시간만 고려하여 전산자원 서비스를 구성하는 단순 최적화 방법을 사용했을 때는 서비스의 최종 성능과 실행 시간 등을 규정한 서비스 수준계약(Service Level Agreement, SLA)을 만족시키지 못할 위험이 높다. 따라서 개방형 전산환경의 서비스 브로커는 전산자원 공급의 안정성을 높이기 위해서 서비스를 구성하는 개별 전산자원의 성능 변동성을 고려하여 위험을 최소화 하는전산자원포트폴리오를구성할것이요구된다. 본연구에서는평균절대편차(Mean-Absolute Deviation, MAD) 포트폴리오 최적화 기법을 이용하여 서비스 브로커의 공급 안정성을 향상시키는 방법을 제시하였다. 제시된 최적화 기법의 효과를 알아보기 위한 방법으로 가상의 개방형 전산환경을 모델링하고, 고객의 제약 조건과 개방형 전산환경의 변동성 정도에 따라 전산자원 공급 서비스의 성공률을 시뮬레이션 하였다. 시뮬레이션 결과로서, 첫째, 단순 최적화방법보다 변동성을 감안한 MAD 포트폴리오 최적화 기법을 이용했을 때 공급의 안정성이 뛰어난 것을 확인할 수 있었다. 둘째로는 특히 개별 전산자원의 변동성 예측의 정확성이 높아질수록 성능도 더욱 향상되는 결과를 가져왔다. 셋째, 측정된 변동성을 이용하여 개방형 전산자원의 가격을 할인하는 정책을 추진할 경우 서비스 공급 범위의 확대에도 효과가 클 것으로 예상되었다.

  • PDF