• Title/Summary/Keyword: optimal algorithm

Search Result 6,798, Processing Time 0.032 seconds

An Optimal Peer Selection Algorithm for Mesh-based Peer-to-Peer Networks

  • Han, Seung Chul;Nam, Ki Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.133-151
    • /
    • 2019
  • In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

A Study on the Optimal Energy Mix Model in Buildings with OEMGD Algorithm Focusing on Ground Source Heat Pump and District Heating & Cooling System (OEMGD 알고리즘을 이용한 건물 냉난방용 최적 에너지 믹스 모델에 관한 연구 - 지열히트펌프와 지역냉난방 시스템을 중심으로)

  • Lee, Key Chang;Hong, Jun Hee;Lee, Kyu Keon
    • The Korean Journal of Community Living Science
    • /
    • v.27 no.2
    • /
    • pp.281-294
    • /
    • 2016
  • This study was conducted to promote consumer interest in Geothermal Heat Pump (Ground Source Heat Pump, GSHP) and district heating and cooling (District Heating & Cooling, DHC) systems, which are competing with each other in the heating and cooling field. Considering not only the required cost data of energy itself, but also external influence factors, the optimal mix ratio of these two energy systems was studied as follows. The quantitative data of the two energy systems was entered into a database and the non-quantitative factors of external influence were applied in the form of coefficients. Considering both of these factors, the optimal mix ratio of GSHP and DHC systems and minimum Life Cycle Cost (LCC) were obtained using an algorithm model design. The Optimal Energy Mix of GSHP & DHC (OEMGD) algorithm was developed using a software program (Octave 4.0). The numerical result was able to reflect the variety of external influence factors through the OEMGD algorithm. The OEMGD model found that the DHC system is more economical than the GSHP system and was able to represent the optimal energy mix ratio and LCC of mixed energy systems according to changes in the external influences. The OEMGD algorithm could be of help to improve the consumers' experience and rationalize their energy usage.

Optimal Routes Analysis of Vehicles for Auxiliary Operations in Open-pit Mines using a Heuristic Algorithm for the Traveling Salesman Problem (휴리스틱 외판원 문제 알고리즘을 이용한 노천광산 보조 작업 차량의 최적 이동경로 분석)

  • Park, Boyoung;Choi, Yosoon;Park, Han-Su
    • Tunnel and Underground Space
    • /
    • v.24 no.1
    • /
    • pp.11-20
    • /
    • 2014
  • This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

Optimal Variable Step Size for Simplified SAP Algorithm with Critical Polyphase Decomposition (임계 다위상 분해기법이 적용된 SAP 알고리즘을 위한 최적 가변 스텝사이즈)

  • Heo, Gyeongyong;Choi, Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.11
    • /
    • pp.1545-1550
    • /
    • 2021
  • We propose an optimal variable step size adjustment method for the simplified subband affine projection algorithm (Simplified SAP; SSAP) in a subband structure based on a polyphase decomposition technique. The proposed method provides an optimal step size derived to minimize the mean square deviation(MSD) at the time of updating the coefficients of the subband adaptive filter. Application of the proposed optimal step size in the SSAP algorithm using colored input signals ensures fast convergence speed and small steady-state error. The results of computer simulations performed using AR(2) signals and real voices as input signals prove the validity of the proposed optimal step size for the SSAP algorithm. Also, the simulation results show that the proposed algorithm has a faster convergence rate and good steady-state error compared to the existing other adaptive algorithms.

Optimal sensor placement for structural health monitoring based on deep reinforcement learning

  • Xianghao Meng;Haoyu Zhang;Kailiang Jia;Hui Li;Yong Huang
    • Smart Structures and Systems
    • /
    • v.31 no.3
    • /
    • pp.247-257
    • /
    • 2023
  • In structural health monitoring of large-scale structures, optimal sensor placement plays an important role because of the high cost of sensors and their supporting instruments, as well as the burden of data transmission and storage. In this study, a vibration sensor placement algorithm based on deep reinforcement learning (DRL) is proposed, which can effectively solve non-convex, high-dimensional, and discrete combinatorial sensor placement optimization problems. An objective function is constructed to estimate the quality of a specific vibration sensor placement scheme according to the modal assurance criterion (MAC). Using this objective function, a DRL-based algorithm is presented to determine the optimal vibration sensor placement scheme. Subsequently, we transform the sensor optimal placement process into a Markov decision process and employ a DRL-based optimization algorithm to maximize the objective function for optimal sensor placement. To illustrate the applicability of the proposed method, two examples are presented: a 10-story braced frame and a sea-crossing bridge model. A comparison study is also performed with a genetic algorithm and particle swarm algorithm. The proposed DRL-based algorithm can effectively solve the discrete combinatorial optimization problem for vibration sensor placements and can produce superior performance compared with the other two existing methods.

Optimal Energy Shift Scheduling Algorithm for Energy Storage Considering Efficiency Model

  • Cho, Sung-Min
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.5
    • /
    • pp.1864-1873
    • /
    • 2018
  • Energy shifting is an innovative method used to obtain the highest profit from the operation of energy storage systems (ESS) by controlling the charge and discharge schedules according to the electricity prices in a given period. Therefore, in this study, we propose an optimal charge and discharge scheduling method that performs energy shift operations derived from an ESS efficiency model. The efficiency model reflects the construction of power conversion systems (PCSs) and lithium battery systems (LBSs) according to the rated discharge time of a MWh-scale ESS. The PCS model was based on measurement data from a real system, whereas for the LBS, we used a circuit model that is appropriate for the MWh scale. In addition, this paper presents the application of a genetic algorithm to obtain the optimal charge and discharge schedules. This development represents a novel evolutionary computation method and aims to find an optimal solution that does not modify the total energy volume for the scheduling process. This optimal charge and discharge scheduling method was verified by various case studies, while the model was used to realize a higher profit than that realized using other scheduling methods.

Optimal user selection and power allocation for revenue maximization in non-orthogonal multiple access systems

  • Pazhayakandathil, Sindhu;Sukumaran, Deepak Kayiparambil;Koodamannu, Abdul Hameed
    • ETRI Journal
    • /
    • v.41 no.5
    • /
    • pp.626-636
    • /
    • 2019
  • A novel algorithm for joint user selection and optimal power allocation for Stackelberg game-based revenue maximization in a downlink non-orthogonal multiple access (NOMA) network is proposed in this study. The condition for the existence of optimal solution is derived by assuming perfect channel state information (CSI) at the transmitter. The Lagrange multiplier method is used to convert the revenue maximization problem into a set of quadratic equations that are reduced to a regular chain of expressions. The optimal solution is obtained via a univariate iterative procedure. A simple algorithm for joint optimal user selection and power calculation is presented and exhibits extremely low complexity. Furthermore, an outage analysis is presented to evaluate the performance degradation when perfect CSI is not available. The simulation results indicate that at 5-dB signal-to-noise ratio (SNR), revenue of the base station improves by at least 15.2% for the proposed algorithm when compared to suboptimal schemes. Other performance metrics of NOMA, such as individual user-rates, fairness index, and outage probability, approach near-optimal values at moderate to high SNRs.

Optimal Location of FACTS Devices Using Adaptive Particle Swarm Optimization Hybrid with Simulated Annealing

  • Ajami, Ali;Aghajani, Gh.;Pourmahmood, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.179-190
    • /
    • 2010
  • This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

Reactive navigation of mobile robots using optmal via-point selection method (최적 경유점 선택 방법을 이용한 이동로봇의 반응적 주행)

  • 김경훈;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.227-230
    • /
    • 1997
  • In this paper, robot navigation experiments with a new navigation algorithm are carried out in real environments. The authors already proposed a reactive navigation algorithm for mobile robots using optimal via-point selection method. At each sampling time, a number of via-point candidates is constructed with various candidates of heading angles and velocities. The robot detects surrounding obstacles, and the proposed algorithm utilizes fuzzy multi-attribute decision making in selecting the optimal via-point the robot would proceed at next step. Fuzzy decision making allows the robot to choose the most qualified via-point even when the two navigation goals-obstacle avoidance and target point reaching-conflict each other. The experimental result shows the successful navigation can be achieved with the proposed navigation algorithm for real environments.

  • PDF

Development of an Algorithm for Searching Optimal Temperature Setpoint for Lettuce in Greenhouse Using Crop Growth Model (작물생장모델을 이용한 상추의 온실 최적설정온도 탐색 알고리즘의 개발)

  • 류관희;김기영;김희구;채희연
    • Journal of Biosystems Engineering
    • /
    • v.24 no.5
    • /
    • pp.445-452
    • /
    • 1999
  • This study was conducted to develop a searching algorithm for optimal daily temperature setpoint greenhouse. An algorithm using crop growth and energy models was developed to determine optimum crop growth environment. The results of this study were as follows: 1. Mathematical models for crop growth and energy consumption were derived to define optimal daily temperature setpoint. 2. Optimum temperature setpoint, which could maximize performance criterion, was determined by using Pontryagin maximum principle. 3. Dynamic control of daily temperature using the developed algorithm showed higher performance criterion than static control with fixed temperature setpoint. Performance criteria for dynamic control models were with simulated periodic weather data and with real weather data, increased by 48% and 60%, respectively.

  • PDF