scholarly journals A synergy between the genetic algorithm and simulated annealing in a gas allocation optimization problem

2020 ◽  
Vol 3 (1) ◽  
pp. 1-7
Author(s):  
V. Sawadogo ◽  
◽  
A. Diallo ◽  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Problem

scholarly journals Optimizing Virtual Private Network Design Using a New Heuristic Optimization Method

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Hongbing Lian ◽  
András Faragó
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Design Optimization ◽  
Optimization Problem ◽  
Optimization Methods ◽  
Optimization Method ◽  
Virtual Private Network ◽  
Successful Model ◽  
Search Speed ◽  
Private Network

In virtual private network (VPN) design, the goal is to implement a logical overlay network on top of a given physical network. We model the traffic loss caused by blocking not only on isolated links, but also at the network level. A successful model that captures the considered network level phenomenon is the well-known reduced load approximation. We consider here the optimization problem of maximizing the carried traffic in the VPN. This is a hard optimization problem. To deal with it, we introduce a heuristic local search technique called landscape smoothing search (LSS). This study first describes the LSS heuristic. Then we introduce an improved version called fast landscape smoothing search (FLSS) method to overcome the slow search speed when the objective function calculation is very time consuming. We apply FLSS to VPN design optimization and compare with well-known optimization methods such as simulated annealing (SA) and genetic algorithm (GA). The FLSS achieves better results for this VPN design optimization problem than simulated annealing and genetic algorithm.

Three Dimensional Offline Packing Optimization Problem Based on Genetic Simulated Annealing Algorithm

2015 ◽  
Vol 744-746 ◽  
pp. 1919-1923
Author(s):  
Zhan Zhong Wang ◽  
Jing Fu ◽  
Lan Fang Liu ◽  
Rui Rui Liu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Three Dimensional ◽  
Packing Problem ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Final Optimization ◽  
Packing Optimization

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results and each suppliers’ current packing data.The experimental results show that the algorithm has a certain validity and practicability in multiple container packing problem.

scholarly journals Application of Nontraditional Optimization Techniques for Airfoil Shape Optimization

2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
R. Mukesh ◽  
K. Lingadurai ◽  
U. Selvakumar
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Shape Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimization Algorithms ◽  
Optimization Techniques ◽  
Aerodynamic Shape Optimization ◽  
Shape Optimization Problem ◽  
Aerodynamic Shape

The method of optimization algorithms is one of the most important parameters which will strongly influence the fidelity of the solution during an aerodynamic shape optimization problem. Nowadays, various optimization methods, such as genetic algorithm (GA), simulated annealing (SA), and particle swarm optimization (PSO), are more widely employed to solve the aerodynamic shape optimization problems. In addition to the optimization method, the geometry parameterization becomes an important factor to be considered during the aerodynamic shape optimization process. The objective of this work is to introduce the knowledge of describing general airfoil geometry using twelve parameters by representing its shape as a polynomial function and coupling this approach with flow solution and optimization algorithms. An aerodynamic shape optimization problem is formulated for NACA 0012 airfoil and solved using the methods of simulated annealing and genetic algorithm for 5.0 deg angle of attack. The results show that the simulated annealing optimization scheme is more effective in finding the optimum solution among the various possible solutions. It is also found that the SA shows more exploitation characteristics as compared to the GA which is considered to be more effective explorer.

scholarly journals Simulated Annealing Algorithm for Wind Farm Layout Optimization: A Benchmark Study

Energies ◽  
2019 ◽  
Vol 12 (23) ◽  
pp. 4403 ◽  
Author(s):  
Yang ◽  
Cho
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Wind Turbines ◽  
Wind Farm ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Layout Optimization ◽  
Wind Farm Layout ◽  
Wind Farm Layout Optimization ◽  
Annealing Algorithm

The optimal layout of wind turbines is an important factor in the wind farm design process, and various attempts have been made to derive optimal deployment results. For this purpose, many approaches to optimize the layout of turbines using various optimization algorithms have been developed and applied across various studies. Among these methods, the most widely used optimization approach is the genetic algorithm, but the genetic algorithm handles many independent variables and requires a large amount of computation time. A simulated annealing algorithm is also a representative optimization algorithm, and the simulation process is similar to the wind turbine layout process. However, despite its usefulness, it has not been widely applied to the wind farm layout optimization problem. In this study, a wind farm layout optimization method was developed based on simulated annealing, and the performance of the algorithm was evaluated by comparing it to those of previous studies under three wind scenarios; likewise, the applicability was examined. A regular layout and optimal number of wind turbines, never before observed in previous studies, were obtained and they demonstrated the best fitness values for all the three considered scenarios. The results indicate that the simulated annealing (SA) algorithm can be successfully applied to the wind farm layout optimization problem.

scholarly journals A simulated annealing-based algorithm for selecting balanced samples

2021 ◽  
Author(s):  
Roberto Benedetti ◽  
Maria Michela Dickson ◽  
Giuseppe Espa ◽  
Francesco Pantalone ◽  
Federica Piersimoni
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Sample Selection ◽  
Auxiliary Information ◽  
Real Data ◽  
Simulation Experiments ◽  
Balanced Sampling ◽  
Inclusion Probabilities ◽  
Random Method ◽  
Annealing Algorithms

AbstractBalanced sampling is a random method for sample selection, the use of which is preferable when auxiliary information is available for all units of a population. However, implementing balanced sampling can be a challenging task, and this is due in part to the computational efforts required and the necessity to respect balancing constraints and inclusion probabilities. In the present paper, a new algorithm for selecting balanced samples is proposed. This method is inspired by simulated annealing algorithms, as a balanced sample selection can be interpreted as an optimization problem. A set of simulation experiments and an example using real data shows the efficiency and the accuracy of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document