• Title/Summary/Keyword: Many-objective optimization

Search Result 199, Processing Time 0.027 seconds

Techno-economic assessment of a very small modular reactor (vSMR): A case study for the LINE city in Saudi Arabia

  • Salah Ud-Din Khan;Rawaiz Khan
    • Nuclear Engineering and Technology
    • /
    • v.55 no.4
    • /
    • pp.1244-1249
    • /
    • 2023
  • Recently, the Kingdom of Saudi Arabia (KSA) announced the development of first-of-a-kind(FOAK) and most advanced futuristic vertical city and named as 'The LINE'. The project will have zero carbon dioxide emissions and will be powered by clean energy sources. Therefore, a study was designed to understand which clean energy sources might be a better choice. Because of its nearly carbon-free footprint, nuclear energy may be a good choice. Nowadays, the development of very small modular reactors (vSMRs) is gaining attention due to many salient features such as cost efficiency and zero carbon emissions. These reactors are one step down to actual small modular reactors (SMRs) in terms of power and size. SMRs typically have a power range of 20 MWe to 300 MWe, while vSMRs have a power range of 1-20 MWe. Therefore, a study was conducted to discuss different vSMRs in terms of design, technology types, safety features, capabilities, potential, and economics. After conducting the comparative test and analysis, the fuel cycle modeling of optimal and suitable reactor was calculated. Furthermore, the levelized unit cost of electricity for each reactor was compared to determine the most suitable vSMR, which is then compared other generation SMRs to evaluate the cost variations per MWe in terms of size and operation. The main objective of the research was to identify the most cost effective and simple vSMR that can be easily installed and deployed.

Energy Forecasting Information System of Optimal Electricity Generation using Fuzzy-based RERNN with GPC

  • Elumalaivasan Poongavanam;Padmanathan Kasinathan;Karunanithi Kandasamy;S. P. Raja
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.10
    • /
    • pp.2701-2717
    • /
    • 2023
  • In this paper, a hybrid fuzzy-based method is suggested for determining India's best system for power generation. This suggested approach was created using a fuzzy-based combination of the Giza Pyramids Construction (GPC) and Recalling-Enhanced Recurrent Neural Network (RERNN). GPC is a meta-heuristic algorithm that deals with solutions for many groups of problems, whereas RERNN has selective memory properties. The evaluation of the current load requirements and production profile information system is the main objective of the suggested method. The Central Electricity Authority database, the Indian National Load Dispatch Centre, regional load dispatching centers, and annual reports of India were some of the sources used to compile the data regarding profiles of electricity loads, capacity factors, power plant generation, and transmission limits. The RERNN approach makes advantage of the ability to analyze the ideal power generation from energy data, however the optimization of RERNN factor necessitates the employment of a GPC technique. The proposed method was tested using MATLAB, and the findings indicate that it is effective in terms of accuracy, feasibility, and computing efficiency. The suggested hybrid system outperformed conventional models, achieving the top result of 93% accuracy with a shorter computation time of 6814 seconds.

Design of Fuzzy Model-based Multi-objective Controller and Its Application to MAGLEV ATO system (퍼지 모델 기반 다목적 제어기의 설계와 자기부상열차 자동운전시스템에의 적용)

  • 강동오;양세현;변증남
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.211-217
    • /
    • 1998
  • Many practical control problems for the complex, uncertain or large-scale plants, need to simultaneously achieve a number of objectives, which may conflict or compete with each other. If the conventional optimization methods are applied to solve these control problems, the solution process may be time-consuming and the resulting solution would ofter lose its original meaning of optimality. Nevertheless, the human operators usually performs satisfactory results based on their qualitative and heuristic knowledge. In this paper, we investigate the control strategies of the human operators, and propose a fuzzy model-based multi-objective satisfactory controller. We also apply it to the automatic train operation(ATO) system for the magnetically levitated vehicles(MAGLEV). One of the human operator's strategies is to predict the control result in order to find the meaningful solution. In this paper, Takagi-Sugeno fuzzy model is used to simulated the prediction procedure. Another str tegy is to evaluate the multiple objectives with respect to their own standards. To realize this strategy, we propose the concept of a satisfactory solution and a satisfactory control scheme. The MAGLEV train is a typical example of the uncertain, complex and large-scale plants. Moreover, the ATO system has to satisfy multiple objectives, such as seed pattern tracking, stop gap accuracy, safety and riding comfort. In this paper, the speed pattern tracking controller and the automatic stop controller of the ATO system is designed based on the proposed control scheme. The effectiveness of the ATO system based on the proposed scheme is shown by the experiments with a rotary test bed and a real MAGLEV train.

  • PDF

An Improved Robust Fuzzy Principal Component Analysis (잡음 민감성이 개선된 퍼지 주성분 분석)

  • Heo, Gyeong-Yong;Woo, Young-Woon;Kim, Seong-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1093-1102
    • /
    • 2010
  • Principal component analysis (PCA) is a well-known method for dimension reduction while maintaining most of the variation in data. Although PCA has been applied to many areas successfully, it is sensitive to outliers. Several variants of PCA have been proposed to resolve the problem and, among the variants, robust fuzzy PCA (RF-PCA) demonstrated promising results. RF-PCA uses fuzzy memberships to reduce the noise sensitivity. However, there are also problems in RF-PCA and the convergence property is one of them. RF-PCA uses two different objective functions to update memberships and principal components, which is the main reason of the lack of convergence property. The difference between two functions also slows the convergence and deteriorates the solutions of RF-PCA. In this paper, a variant of RF-PCA, called RF-PCA2, is proposed. RF-PCA2 uses an integrated objective function both for memberships and principal components. By using alternating optimization, RF-PCA2 is guaranteed to converge on a local optimum. Furthermore, RF-PCA2 converges faster than RF-PCA and the solutions found are more similar to the desired solutions than those of RF-PCA. Experimental results also support this.

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

Optimal scheduling of multiproduct batch processes with various due date (다양한 납기일 형태에 따른 다제품 생산용 회분식 공정의 최적 생산계획)

  • 류준형
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.844-847
    • /
    • 1997
  • In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

  • PDF

A Magnetic Energy Recovery Switch Based Terminal Voltage Regulator for the Three-Phase Self-Excited Induction Generators in Renewable Energy Systems

  • Wei, Yewen;Kang, Longyun;Huang, Zhizhen;Li, Zhen;Cheng, Miao miao
    • Journal of Power Electronics
    • /
    • v.15 no.5
    • /
    • pp.1305-1317
    • /
    • 2015
  • Distributed generation systems (DGSs) have been getting more and more attention in terms of renewable energy use and new generation technologies in the past decades. The self-excited induction generator (SEIG) occupies an important role in the area of energy conversion due to its low cost, robustness and simple control. Unlike synchronous generators, the SEIG has to absorb capacitive reactive power from the outer device aiming to stabilize the terminal voltage at load changes. This paper presents a novel static VAR compensator (SVC) called a magnetic energy recovery switch (MERS) to serve as a voltage controller in SEIG powered DGSs. In addition, many small scale SEIGs, instead of a single large one, are applied and devoted to promote the generation efficiency. To begin with, an expandable mathematic model based on a d-q equivalent circuit is created for parallel SEIGs. The control method of the MERS is further improved with the objective of broadening its operating range and restraining current harmonics by parameter optimization. A hybrid control strategy is developed by taking both of the stand-alone and grid-connected modes into consideration. Then simulation and experiments are carried out in the case of single and double SEIG(s) generation. Finally, the measurement results verify that the proposed DGS with SVC-MERS achieves a better stability and higher feasibility. The major advantages of the mentioned variable reactive power supplier, when compared to the STATCOM, include the adoption of a small DC capacitor, line frequency switching, simple control and less loss.

Optimization of TCN-Ethernet Topology for Distributed Control System in Railway Vehicles (다관절 차량의 분산형 제어 시스템을 위한 이더넷 기반 TCN 토폴로지 최적화)

  • Kim, Jungtai;Hwang, Hwanwoong;Lee, Kang-Won;Yun, Ji-Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.9
    • /
    • pp.38-45
    • /
    • 2016
  • For higher efficiency and reliability of railroad trains with many electronic sensors and actuators, a distributed control system with which electronic components communicate with each other in a distributed manner via a data network is considered. This paper considers Ethernet-based Train Communication Network (TCN) for this purpose and proposes a methodology to optimize the topology in terms of transmission latency and reliability, each of which is modeled as the number of traversing backbone nodes and the number of cables between vehicles, respectively. An objective function is derived accordingly and a closed-form optimum is obtained by relaxing the integer constraint of the number of vehicles for a unit network. Then, the final integer optimum is searched around it. Through numerical evaluation, the validity of the proposed methodology and the characteristics of the resulting solutions are shown.

Detection of damage in truss structures using Simplified Dolphin Echolocation algorithm based on modal data

  • Kaveh, Ali;Vaez, Seyed Rohollah Hoseini;Hosseini, Pedram;Fallah, Narges
    • Smart Structures and Systems
    • /
    • v.18 no.5
    • /
    • pp.983-1004
    • /
    • 2016
  • Nowadays, there are two classes of methods for damage detection in structures consisting of static and dynamic. The dynamic methods are based on studying the changes in structure's dynamic characteristics. The theoretical basis of this method is that damage causes changes in dynamic characteristics of structures. The dynamic methods are divided into two categories: signal based and modal based. The modal based methods utilize the modal properties consisting of natural frequencies, modal damping and mode shapes. As the modal properties are sensitive to changes in the structure, these can be used for detecting the damages. In this study, using dynamic method and modal based approach (natural frequencies and mode shapes), the objective function is formulated. Then, detection of damages of truss structures is addressed by using Simplified Dolphin Echolocation algorithm and solving inverse optimization problem. Many scenarios are used to simulate the damages. To demonstrate the ability of the algorithm, different truss structures with several multiple elements scenarios are tested using a few runs. The influence of the two different levels of noise in the modal data for these scenarios is also considered. The last example of this article is investigated using a different mutation. This mutation obtains the exact answer with fewer loops and population by limited computational effort.