scholarly journals A Novel Method for Economic Dispatch with Across Neighborhood Search: A Case Study in a Provincial Power Grid, China

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Guojiang Xiong ◽  
Jing Zhang ◽  
Xufeng Yuan ◽  
Dongyuan Shi ◽  
Yu He ◽  
...  
Keyword(s):  
Power Grid ◽  
Economic Dispatch ◽  
Optimal Solution ◽  
Inequality Constraints ◽  
Search Space ◽  
Neighborhood Search ◽  
Solution Quality ◽  
Promising Alternative ◽  
Comparison Results ◽  
Population Based Algorithm

Economic dispatch (ED) is of cardinal significance for the power system operation. It is mathematically a typical complex nonlinear multivariable strongly coupled optimization problem with equality and inequality constraints, especially considering the valve-point effects. In order to effectively solve the problem, a simple yet very young and efficient population-based algorithm named across neighborhood search (ANS) is implemented in this paper. In ANS, a group of individuals collaboratively navigate through the search space for obtaining the optimal solution by simultaneously searching the neighborhoods of multiple superior solutions. Four benchmark test cases with diverse complexities and characteristics are firstly employed to comprehensively verify the feasibility and effectiveness of ANS. The experimental and comparison results fully demonstrate the superiority of ANS in terms of the final solution quality, convergence speed, robustness, and statistics. In addition, the sensitivities of ANS to variations of population size and across-search degree are studied. Furthermore, ANS is applied to a practical provincial power grid of China. All the comparison results consistently indicate that ANS is highly competitive and can be used as a promising alternative for ED problems.

Neural Network-Based Metaheuristic Parameterization with Application to the Vehicle Matching Problem in Ride-Hailing Services

2019 ◽  
Vol 2673 (10) ◽  
pp. 311-320
Author(s):  
Arslan Ali Syed ◽  
Irina Gaponova ◽  
Klaus Bogenberger
Keyword(s):  
Neural Network ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Computation Time ◽  
Problem Instance ◽  
Neighborhood Search ◽  
Matching Problem ◽  
Solution Quality ◽  
Actual Problem ◽  
Parameter Values

The majority of transportation problems include optimizing some sort of cost function. These optimization problems are often NP-hard and have an exponential increase in computation time with the increase in the model size. The problem of matching vehicles to passenger requests in ride hailing (RH) contexts typically falls into this category.Metaheuristics are often utilized for such problems with the aim of finding a global optimal solution. However, such algorithms usually include lots of parameters that need to be tuned to obtain a good performance. Typically multiple simulations are run on diverse small size problems and the parameters values that perform the best on average are chosen for subsequent larger simulations.In contrast to the above approach, we propose training a neural network to predict the parameter values that work the best for an instance of the given problem. We show that various features, based on the problem instance and shareability graph statistics, can be used to predict the solution quality of a matching problem in RH services. Consequently, the values corresponding to the best predicted solution can be selected for the actual problem. We study the effectiveness of above described approach for the static assignment of vehicles to passengers in RH services. We utilized the DriveNow data from Bavarian Motor Works (BMW) for generating passenger requests inside Munich, and for the metaheuristic, we used a large neighborhood search (LNS) algorithm combined with a shareability graph.

scholarly journals Optimal economic dispatch of power generation solution using lightning search algorithm

2020 ◽  
Vol 9 (3) ◽  
pp. 371
Author(s):  
Murad Yahya Nassar ◽  
Mohd Noor Abdullah ◽  
Asif Ahmed Rahimoon
Keyword(s):  
Power Generation ◽  
Power System ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Thermal Power ◽  
Economic Dispatch ◽  
Optimal Solution ◽  
Fuel Price ◽  
Solution Quality ◽  
Generation Cost

Economic dispatch (ED) is the power demand allocating process for the committed units at minimum generation cost while satisfying system and operational constraints. Increasing cost of fuel price and electricity demand can increase the cost of thermal power generation. Therefore, robust and efficient optimization algorithm is required to determine the optimal solution for ED problem in power system operation and planning. In this paper the lightning search algorithm (LSA) is proposed to solve the ED problem. The system constraints such as power balance, generator limits, system transmission losses and valve-points effects (VPE) are considered in this paper. To verify the effectiveness of LSA in terms of convergence characteristic, robustness, simulation time and solution quality, the two case studies consists of 6 and 13 units have been tested. The simulation results show that the LSA can provide optimal cost than many methods reported in literature. Therefore, it has potential to solve many optimization problems in power dispatch and power system applications.

Swarm-Based Mean-Variance Mapping Optimization (MVMOS) for Solving Non-Convex Economic Dispatch Problems

2015 ◽  
pp. 211-251 ◽  
Author(s):  
Truong Hoang Khoa ◽  
Pandian Vasant ◽  
Balbir Singh Mahinder Singh ◽  
Vo Ngoc Dieu
Keyword(s):  
Optimization Technique ◽  
Economic Dispatch ◽  
Optimal Solution ◽  
Mapping Function ◽  
Population Based ◽  
Optimization Techniques ◽  
Solution Quality ◽  
Complex Constraints ◽  
Global Optimal ◽  
Mean Variance

The practical Economic Dispatch (ED) problems have non-convex objective functions with complex constraints due to the effects of valve point loadings, multiple fuels, and prohibited zones. This leads to difficulty in finding the global optimal solution of the ED problems. This chapter proposes a new swarm-based Mean-Variance Mapping Optimization (MVMOS) for solving the non-convex ED. The proposed algorithm is a new population-based meta-heuristic optimization technique. Its special feature is a mapping function applied for the mutation. The proposed MVMOS is tested on several test systems and the comparisons of numerical obtained results between MVMOS and other optimization techniques are carried out. The comparisons show that the proposed method is more robust and provides better solution quality than most of the other methods. Therefore, the MVMOS is very favorable for solving non-convex ED problems.

scholarly journals BOOSTING SIMULATED ANNEALING WITH FITNESS LANDSCAPE PARAMETERS FOR BETTER OPTIMALITY

2015 ◽  
pp. 107-112
Author(s):  
Sunanda Gupta ◽  
Sakshi Arora
Keyword(s):  
Simulated Annealing ◽  
Probability Function ◽  
Fitness Landscape ◽  
Optimal Solution ◽  
Search Space ◽  
Solution Quality ◽  
Acceptance Probability ◽  
Evaluation Strategies ◽  
Fitness Distance Correlation ◽  
The Cost

Multi Dimensional Knapsack problem is a widely studied NP hard problem requiring extensive processing to achieve optimality. Simulated Annealing (SA) unlike other is capable of providing fast solutions but at the cost of solution quality. This paper focuses on making SA robust in terms of solution quality while assuring faster convergence by incorporating effective fitness landscape parameters. For this it proposes to modify the ‘Acceptance Probability’ function of SA. The fitness landscape evaluation strategies are embedded to Acceptance Probability Function to identify the exploitation and exploration of the search space and analyze the behavior on the performance of SA. The basis of doing so is that SA in the process of reaching optimality ignores the association between the search space and fitness space and focuses only on the comparison of current solution with optimal solution on the basis of temperature settings at that point. The idea is implemented in two different ways i.e. by making use of Fitness Distance Correlation and Auto Correlation functions. The experiments are conducted to evaluate the resulting SA on the range of MKP instances available in the OR library.

scholarly journals Limited Search Space-Based Algorithm for Dual Resource Constrained Scheduling Problem with Multilevel Product Structure

2019 ◽  
Vol 9 (19) ◽  
pp. 4005 ◽  
Author(s):  
Geunho Yang ◽  
Byung Do Chung ◽  
Sang Jin Lee
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Solution Space ◽  
Search Space ◽  
Product Structure ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Resource Constrained

This study addresses the dual resource constrained flexible job shop scheduling problem (DRCFJSP) with a multilevel product structure. The DRCFJSP is a strong NP-hard problem, and an efficient algorithm is essential for DRCFJSP. In this study, we propose an algorithm for the DRCFJSP with a multilevel product structure to minimize the lateness, makespan, and deviation of the workload with preemptive priorities. To efficiently solve the problem within a limited time, the search space is limited based on the possible start and end time, and focus is placed on the intensification rather than diversification, which can help the algorithm spend more time to find an optimal solution in a reasonable solution space. The performance of the proposed algorithm is compared with those of a genetic algorithm and a hybrid genetic algorithm with variable neighborhood search. The numerical experiments demonstrate that the strategy limiting the search space is effective for large and complex problems.

scholarly journals Environmental Economic Dispatch with the use of Particle Swarm Optimization Technique based on Space Reduction Strategy

2019 ◽  
Vol 9 (5) ◽  
pp. 4605-4611 ◽  
Author(s):  
Τ. M. Kumar ◽  
Ν. A. Singh
Keyword(s):  
Particle Swarm Optimization ◽  
Environmental Economic ◽  
Economic Dispatch ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Search Space ◽  
Pareto Optimal Solution ◽  
Pareto Optimal ◽  
Swarm Optimization ◽  
Space Reduction

This paper introduces a professional edition of Particle Swarm Optimization (PSO) technique, intending to address the Environmental Economic Dispatch problem of thermal electric power units. Space Reduction (SR) strategy based PSO is proposed, in order to obtain the Pareto optimal solution in the prescribed search space, by enhancing the speed of the optimization process. PSO is a natural algorithm, which can be used in a wide area of engineering issues. Many papers have illustrated different techniques that solve various types of dispatch problems, with numerous pollutants as constraints. Search SR strategy is applied to PSO algorithm in order to increase the particles’ moving behavior, by using effectively the search space, and thus increasing the convergence rate, so as to attain the Pareto optimal solution. The validation of SR-PSO algorithm is demonstrated, through its application on an Indian system with 6 generators and three IEEE systems with 30, 57 and 118 buses respectively, for variable load demands. The minimum fuel cost and least emission solutions are achieved by examining various load conditions.

scholarly journals Hybrid Differential Evolution Algorithm and Adaptive Large Neighborhood Search to Solve Parallel Machine Scheduling to Minimize Energy Consumption in Consideration of Machine-Load Balance Problems

2021 ◽  
Vol 13 (10) ◽  
pp. 5470
Author(s):  
Rujapa Nanthapodej ◽  
Cheng-Hsiang Liu ◽  
Krisanarach Nitisiri ◽  
Sirorat Pattanapairoj
Keyword(s):  
Mathematical Model ◽  
Energy Consumption ◽  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Parallel Machine Scheduling ◽  
Neighborhood Search ◽  
Solution Quality ◽  
Machine Load ◽  
The Mathematical Model

Environmental and economic considerations create a challenge for manufacturers. The main priorities for production planning in environmentally friendly manufacturing industries are reducing energy consumption and improving productivity by balancing machine load. This paper focuses on parallel machine scheduling to minimize energy consumption (PMS_ENER), which is an indicator of environmental sustainability when considering machine-load balance problems. A mathematical model was formulated to solve the proposed problem and tested using a set of problem groups. The findings indicated that the mathematical model could find an optimal solution within a limited calculation time for small problems. For medium and large problems, the mathematical model could also find the optimal solution within a limited calculation time, but worse than all metaheuristics. However, finding an optimal solution for a larger problem is time-consuming. Thus, a novel method, a hybrid differential evolution algorithm with adaptive large neighborhood search (HyDE-ALNS), is presented to solve large-scale PMS_ENER. The new mutation and recombination formula for the differential evolution (DE) algorithm proposed in this article obtained promising results. By using the HyDE-ALNS, we improved the solution quality by 0.22%, 7.21%, and 12.01% compared with a modified DE (MDE-3) for small, medium, and large problems respectively. In addition, five new removal methods were designed to implement in ALNS and achieve optimal solution quality.

Feature Selection Algorithm for High-dimensional Biomedical Data Using Information Gain and Improved Chemical Reaction Optimization

2021 ◽  
Vol 15 (8) ◽  
pp. 912-926
Author(s):  
Ge Zhang ◽  
Pan Yu ◽  
Jianlin Wang ◽  
Chaokun Yan
Keyword(s):  
Feature Selection ◽  
Chemical Reaction ◽  
Information Gain ◽  
Feature Selection Method ◽  
Search Space ◽  
Neighborhood Search ◽  
Biomedical Data ◽  
Chemical Reaction Optimization ◽  
Search Mechanism ◽  
Reaction Optimization

Background: There have been rapid developments in various bioinformatics technologies, which have led to the accumulation of a large amount of biomedical data. However, these datasets usually involve thousands of features and include much irrelevant or redundant information, which leads to confusion during diagnosis. Feature selection is a solution that consists of finding the optimal subset, which is known to be an NP problem because of the large search space. Objective: For the issue, this paper proposes a hybrid feature selection method based on an improved chemical reaction optimization algorithm (ICRO) and an information gain (IG) approach, which called IGICRO. Methods: IG is adopted to obtain some important features. The neighborhood search mechanism is combined with ICRO to increase the diversity of the population and improve the capacity of local search. Results: Experimental results of eight public available data sets demonstrate that our proposed approach outperforms original CRO and other state-of-the-art approaches.

Whale optimization algorithm based on lateral inhibition for image matching and vision-guided AUV docking

2020 ◽  
pp. 1-12
Author(s):  
Zheping Yan ◽  
Jinzhong Zhang ◽  
Jialing Tang
Keyword(s):  
Lateral Inhibition ◽  
Optimization Algorithm ◽  
Image Matching ◽  
Autonomous Underwater Vehicle ◽  
Optimal Solution ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Inhibition Mechanism ◽  
Whale Optimization ◽  
Accuracy And Stability

The accuracy and stability of relative pose estimation of an autonomous underwater vehicle (AUV) and a target depend on whether the characteristics of the underwater image can be accurately and quickly extracted. In this paper, a whale optimization algorithm (WOA) based on lateral inhibition (LI) is proposed to solve the image matching and vision-guided AUV docking problem. The proposed method is named the LI-WOA. The WOA is motivated by the behavior of humpback whales, and it mainly imitates encircling prey, bubble-net attacking and searching for prey to obtain the globally optimal solution in the search space. The WOA not only balances exploration and exploitation but also has a faster convergence speed, higher calculation accuracy and stronger robustness than other approaches. The lateral inhibition mechanism can effectively perform image enhancement and image edge extraction to improve the accuracy and stability of image matching. The LI-WOA combines the optimization efficiency of the WOA and the matching accuracy of the LI mechanism to improve convergence accuracy and the correct matching rate. To verify its effectiveness and feasibility, the WOA is compared with other algorithms by maximizing the similarity between the original image and the template image. The experimental results show that the LI-WOA has a better average value, a higher correct rate, less execution time and stronger robustness than other algorithms. The LI-WOA is an effective and stable method for solving the image matching and vision-guided AUV docking problem.

Sign in / Sign up

Export Citation Format

Share Document