scholarly journals DESIGN OF MULTILAYER MICROWAVE ABSORBERS USING HYBRID BINARY LIGHTNING SEARCH ALGORITHM AND SIMULATED ANNEALING

2017 ◽  
Vol 78 ◽  
pp. 75-90 ◽  
Author(s):  
Yuting Lu ◽  
Yongquan Zhou
Keyword(s):  
Simulated Annealing ◽  
Search Algorithm ◽  
Microwave Absorbers

scholarly journals Heterogeneous Simulated Annealing Teams: An Optimizing Search Algorithm Inspired by Engineering Design Teams

2018 ◽  
Author(s):  
Christopher McComb ◽  
Jonathan Cagan ◽  
Kenneth Kotovsky
Keyword(s):  
Simulated Annealing ◽  
Engineering Design ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Random Search ◽  
Design Teams ◽  
Design Cognition ◽  
Gradient Based ◽  
Multi Agent ◽  
Annealing Algorithms

Although insights uncovered by design cognition are often utilized to develop the methods used by human designers, using such insights to inform computational methodologies also has the potential to improve the performance of design algorithms. This paper uses insights from research on design cognition and design teams to inform a better simulated annealing search algorithm. Simulated annealing has already been established as a model of individual problem solving. This paper introduces the Heterogeneous Simulated Annealing Team (HSAT) algorithm, a multi-agent simulated annealing algorithm. Each agent controls an adaptive annealing schedule, allowing the team develop heterogeneous search strategies. Such diversity is a natural part of engineering design, and boosts performance in other multi-agent algorithms. Further, interaction between agents in HSAT is structured to mimic interaction between members of a design team. Performance is compared to several other simulated annealing algorithms, a random search algorithm, and a gradient-based algorithm. Compared to other algorithms, the team-based HSAT algorithm returns better average results with lower variance.

scholarly journals Scheduling Optimization of Sugarcane Harvest Using Simulated Annealing Algorithm

2018 ◽  
Vol 5 (2) ◽  
pp. 138-147
Author(s):  
Eka Nur Afifah ◽  
Alamsyah Alamsyah ◽  
Endang Sugiharti
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Planning Process ◽  
Search Algorithm ◽  
Raw Material ◽  
Local Search Algorithm ◽  
Harvest Scheduling ◽  
Actual Result ◽  
Material Supply ◽  
Annealing Algorithm

Scheduling is one of the important part in production planning process. One of the factor that influence the smooth production process is raw material supply. Sugarcane supply as the main raw material in the making of sugar is the most important componen. The algorithm that used in this study was Simulated Annealing (SA) algorithm. SA apability to accept the bad or no better solution within certain time distinguist it from another local search algorithm. Aim of this study was to implement the SA algorithm in scheduling the sugarcane harvest process so that the amount of sugarcane harvest not so differ from mill capacity of the factory. Data used in this study were 60 data from sugarcane farms that ready to cut and mill capacity 1660 tons. Sugarcane harvest process in 19 days producing 33043,76 tons used SA algorithm and 27089,47 tons from factory actual result. Based on few experiments, obtained sugarcane harvest average by SA algorithm was 1651,63 tons per day and factory actual result was 1354,47 tons. Result of harvest scheduling used SA algorithm showed not so differ average from mill capacity of factory. Truck uses scheduling by SA algorithm showed average 119 trucks per day while from factory actual result was 156 trucks. With the same harvest time, SA algorithm result was greater  and the amount of used truck less than actual result of factory. Thus, can be concluded SA algorithm can make the scheduling of sugarcane harvest become more optimall compared to other methods applied by the factory nowdays.

scholarly journals Fault Localization Based on Hybrid Genetic Simulated Annealing Algorithm

2021 ◽  
Vol 28 (2) ◽  
pp. 101-109
Keyword(s):  
Simulated Annealing ◽  
Software Testing ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Fault Localization ◽  
Good Effect ◽  
Test Case ◽  
Genetic Simulated Annealing Algorithm ◽  
Starting Point ◽  
Annealing Algorithm

Software testing is an important stage in the software development process, which is the key to ensure software quality and improve software reliability. Software fault localization is the most important part of software testing. In this paper, the fault localization problem is modeled as a combinatorial optimization problem, using the function call path as a starting point. A heuristic search algorithm based on hybrid genetic simulated annealing algorithm is used to locate software defects. Experimental results show that the fault localization method, which combines genetic algorithm, simulated annealing algorithm and function correlation analysis method, has a good effect on single fault localization and multi-fault localization. It greatly reduces the requirement of test case coverage and the burden of the testers, and improves the effect of fault localization.

Evaluation of Bayesian Network Structure Learning Using Elephant Swarm Water Search Algorithm

2020 ◽  
pp. 139-159
Author(s):  
Shahab Wahhab Kareem ◽  
Mehmet Cudi Okur
Keyword(s):  
Simulated Annealing ◽  
Bayesian Network ◽  
Network Structure ◽  
Structure Learning ◽  
Search Algorithm ◽  
Confusion Matrix ◽  
Data Sets ◽  
Greedy Search ◽  
Bayesian Network Structure ◽  
Bayesian Network Structure Learning

Bayesian networks are useful analytical models for designing the structure of knowledge in machine learning which can represent probabilistic dependency relationships among the variables. The authors present the Elephant Swarm Water Search Algorithm (ESWSA) for Bayesian network structure learning. In the algorithm; Deleting, Reversing, Inserting, and Moving are used to make the ESWSA for reaching the optimal structure solution. Mainly, water search strategy of elephants during drought periods is used in the ESWSA algorithm. The proposed method is compared with Pigeon Inspired Optimization, Simulated Annealing, Greedy Search, Hybrid Bee with Simulated Annealing, and Hybrid Bee with Greedy Search using BDeu score function as a metric for all algorithms. They investigated the confusion matrix performances of these techniques utilizing various benchmark data sets. As presented by the results of evaluations, the proposed algorithm achieves better performance than the other algorithms and produces better scores as well as the better values.

scholarly journals Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Muhammad Sulaiman ◽  
Ashfaq Ahmad ◽  
Asfandyar Khan ◽  
Shakoor Muhammad
Keyword(s):  
Simulated Annealing ◽  
Objective Function ◽  
Search Algorithm ◽  
Optimal Operation ◽  
Decision Variables ◽  
Overcurrent Relays ◽  
Overcurrent Relay ◽  
Symbiotic Organism Search

This paper presents the solution of directional overcurrent relay (DOCR) problems using Simulated Annealing based Symbiotic Organism Search (SASOS). The objective function of the problem is to minimize the sum of the operating times of all primary relays. The DOCR problem is nonlinear and highly constrained with two types of decision variables, namely, the time dial settings (TDS) and plug setting (PS). In this paper, three models of the problem are considered, the IEEE 3-bus, 4-bus, and 6-bus, respectively. We have applied SASOS to solve the problem and the obtained results are compared with other algorithms available in the literature.

scholarly journals Job Scheduling in Cloud Computing Using a Modified Harris Hawks Optimization and Simulated Annealing Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Ibrahim Attiya ◽  
Mohamed Abd Elaziz ◽  
Shengwu Xiong
Keyword(s):  
Cloud Computing ◽  
Simulated Annealing ◽  
Large Scale ◽  
Simulated Annealing Algorithm ◽  
Job Scheduling ◽  
Search Algorithm ◽  
Scheduling Algorithms ◽  
Scheduling Problems ◽  
It Services ◽  
On Demand

In recent years, cloud computing technology has attracted extensive attention from both academia and industry. The popularity of cloud computing was originated from its ability to deliver global IT services such as core infrastructure, platforms, and applications to cloud customers over the web. Furthermore, it promises on-demand services with new forms of the pricing package. However, cloud job scheduling is still NP-complete and became more complicated due to some factors such as resource dynamicity and on-demand consumer application requirements. To fill this gap, this paper presents a modified Harris hawks optimization (HHO) algorithm based on the simulated annealing (SA) for scheduling jobs in the cloud environment. In the proposed HHOSA approach, SA is employed as a local search algorithm to improve the rate of convergence and quality of solution generated by the standard HHO algorithm. The performance of the HHOSA method is compared with that of state-of-the-art job scheduling algorithms, by having them all implemented on the CloudSim toolkit. Both standard and synthetic workloads are employed to analyze the performance of the proposed HHOSA algorithm. The obtained results demonstrate that HHOSA can achieve significant reductions in makespan of the job scheduling problem as compared to the standard HHO and other existing scheduling algorithms. Moreover, it converges faster when the search space becomes larger which makes it appropriate for large-scale scheduling problems.

A Hybrid Meta-Heuristic Algorithm for Vehicle Routing Problem with Time Windows

2015 ◽  
Vol 24 (06) ◽  
pp. 1550021 ◽  
Author(s):  
Esam Taha Yassen ◽  
Masri Ayob ◽  
Mohd Zakree Ahmad Nazri ◽  
Nasser R. Sabar
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Routing Problem

Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

Parameter Estimation of Nonlinear Systems by Dynamic Cuckoo Search

2017 ◽  
Vol 29 (4) ◽  
pp. 1103-1123 ◽  
Author(s):  
Qixiang Liao ◽  
Shudao Zhou ◽  
Hanqing Shi ◽  
Weilai Shi
Keyword(s):  
Simulated Annealing ◽  
Nonlinear Systems ◽  
Simulated Annealing Algorithm ◽  
Learning Strategy ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Superior Performance ◽  
Multiple Point ◽  
Crossover Operator

In order to address with the problem of the traditional or improved cuckoo search (CS) algorithm, we propose a dynamic adaptive cuckoo search with crossover operator (DACS-CO) algorithm. Normally, the parameters of the CS algorithm are kept constant or adapted by empirical equation that may result in decreasing the efficiency of the algorithm. In order to solve the problem, a feedback control scheme of algorithm parameters is adopted in cuckoo search; Rechenberg’s 1/5 criterion, combined with a learning strategy, is used to evaluate the evolution process. In addition, there are no information exchanges between individuals for cuckoo search algorithm. To promote the search progress and overcome premature convergence, the multiple-point random crossover operator is merged into the CS algorithm to exchange information between individuals and improve the diversification and intensification of the population. The performance of the proposed hybrid algorithm is investigated through different nonlinear systems, with the numerical results demonstrating that the method can estimate parameters accurately and efficiently. Finally, we compare the results with the standard CS algorithm, orthogonal learning cuckoo search algorithm (OLCS), an adaptive and simulated annealing operation with the cuckoo search algorithm (ACS-SA), a genetic algorithm (GA), a particle swarm optimization algorithm (PSO), and a genetic simulated annealing algorithm (GA-SA). Our simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document