scholarly journals Multilevel Large-Scale Modules Floorplanning/Placement with Improved Neighborhood Exchange in Simulated Annealing

10.5772/10037 ◽  
2010 ◽  
Author(s):  
Hung-Ming Chen ◽  
Kuan-Chung Wang
Keyword(s):  
Simulated Annealing ◽  
Large Scale

scholarly journals Research on capacity optimization of micro-grid hybrid energy storage system based on simulated annealing artificial fish swarm algorith with memory function

2020 ◽  
Vol 185 ◽  
pp. 01023
Author(s):  
Yuan An ◽  
Jianing Li ◽  
Cenyue Chen
Keyword(s):  
Simulated Annealing ◽  
Energy Storage ◽  
Large Scale ◽  
Memory Function ◽  
Storage System ◽  
Energy Storage System ◽  
Hybrid Energy ◽  
Hybrid Energy Storage ◽  
Hybrid Energy Storage System ◽  
With Memory

The intermittence and uncertainty of wind power and photovoltaic power have hindered the large-scale development of both. Therefore, it is very necessary to properly configure energy storage devices in the wind-solar complementary power grid. For the hybrid energy storage system composed of storage battery and supercapacitor, the optimization model of hybrid energy storage capacity is established with the minimum comprehensive cost as the objective function and the energy saving and charging state as the constraints. A simulated annealing artificial fish school algorithm with memory function is proposed to solve the model. The results show that the hybrid energy storage system can greatly save costs and improve system economy.

Absolutely Stochastic Simulated Annealing Approach to Large Scale Unit Commitment Problem

2006 ◽  
Vol 34 (6) ◽  
pp. 619-637 ◽  
Author(s):  
Tomonobu Senjyu ◽  
Ahmed Yousuf Saber ◽  
Tsukasa Miyagi ◽  
Naomitsu Urasaki ◽  
Toshihisa Funabashi
Keyword(s):  
Simulated Annealing ◽  
Large Scale ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Scale Unit ◽  
Commitment Problem

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.

Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing algorithm

2009 ◽  
Vol 223 (8) ◽  
pp. 1045-1054 ◽  
Author(s):  
H A Hassan-Pour ◽  
M Mosadegh-Khah ◽  
R Tavakkoli-Moghaddam
Keyword(s):  
Simulated Annealing ◽  
Large Scale ◽  
Simulated Annealing Algorithm ◽  
Genetic Operators ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Multi Objective ◽  
Location Routing ◽  
Proposed Model ◽  
Stochastic Location

This paper presents a novel mathematical model for a stochastic location-routing problem (SLRP) that minimizes the facilities establishing cost and transportation cost, and maximizes the probability of delivery to customers. In this proposed model, new aspects of a location-routing problem (LRP), such as stochastic availability of facilities and routes, are developed that are similar to real-word problems. The proposed model is solved in two stages: (i) solving the facility location problem (FLP) by a mathematical algorithm and (ii) solving the multi-objective multi-depot vehicle routing problem (MO-MDVRP) by a simulated annealing (SA) algorithm hybridized by genetic operators, namely mutation and crossover. The proposed SA can find good solutions in a reasonable time. It solves the proposed model in large-scale problems with acceptable results. Finally, a trade-off curve is used to depict and discuss a large-sized problem. The associated results are compared with the results obtained by the lower bound and Lingo 8.0 software.

Sign in / Sign up

Export Citation Format

Share Document