13,867 Hits in 4.6 sec

Parallel Simulated Annealing with MRAnneal

Benjamin Marks, Riley Collins, Kevin C. Webb
2015 2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)  
Simulated annealing algorithms, which repeatedly make small changes to candidate solutions to find approximately optimal ones, are a common method for approximating solutions to computationally expensive  ...  optimization problems.  ...  Using simulated annealing to find solutions to complex problems is not novel. Kirkpatrick et al. proposed using simulated annealing as a means to solve optimization problems [1] .  ... 
doi:10.1109/icpads.2015.74 dblp:conf/icpads/MarksCW15 fatcat:6ldwxj24xzb5hdkfquwbuqgohu

Planning the location and rating of distributed energy storage in LV networks using a genetic algorithm with simulated annealing

A.F. Crossland, D. Jones, N.S. Wade
2014 International Journal of Electrical Power & Energy Systems  
Planning the location and rating of distributed energy storage in LV networks using a genetic algorithm with simulated annealing.  ...  Simulated annealing As discussed in [38] , simulated annealing should understand and make use of properties of the problem to be effective.  ...  using a genetic algorithm with simulated annealing.  ... 
doi:10.1016/j.ijepes.2014.02.001 fatcat:dblr36tolbgx3jyim6ctcgujr4

Solving hybrid-vehicle routing problem using modified simulated annealing

Nour Alsumairat, Mahmoud Alrefaei
2021 International Journal of Power Electronics and Drive Systems (IJPEDS)  
This optimization problem is solved using a modified simulated annealing (SA) heuristic procedure with constant temperature.  ...  The aim of this problem is to minimize the total cost of travelling between customers, provided that each customer is visited only once.  ...  ACKNOWLEDGEMENTS The authors would like to thank Jordan University of Science and Technology for supporting this work.  ... 
doi:10.11591/ijece.v11i6.pp4922-4931 fatcat:exkkptuodnevvdjhkl6gispcyq

A Parallel Simulated Annealing Approach for the Mirrored Traveling Tournament Problem [article]

Vijay Menon, Saurabh Jha
2013 arXiv   pre-print
In this paper we test a parallel simulated annealing approach for solving the mTTP using OpenMP on shared memory systems and we found that this approach is superior especially with respect to the number  ...  The Mirrored Traveling Tournament Problem (mTTP) is variation of the TTP that represents certain types of sports scheduling problems where the main objective is to minimize the total distance traveled  ...  Methodology Simulated Annealing is a local search meta-heuristic used to address global optimization problems, especially when the search space is discrete.  ... 
arXiv:1311.1884v1 fatcat:lby4sp23tjhgbals3kxz5sw5nu

Maximising the Utility of Enterprise Millimetre-Wave Networks [article]

Nicolo Facchi, Francesco Gringoli, Paul Patras
2018 arXiv   pre-print
Simulation results demonstrate that our schemes provide up to 60% higher throughput as compared to the commonly used signal strength based association policy for mmWave networks, and outperform recently  ...  In this paper we formulate and solve these tasks as utility maximisation problems under different traffic regimes, for the first time in the mmWave context.  ...  Optimal association in wireless mesh networks is tackled using an airtime-metric based mechanism in [9] .  ... 
arXiv:1706.04278v2 fatcat:pacyglmfz5bifdcgnpadmhtvsm

An Efficient Simulated Annealing Approach to the Travelling Tournament Problem

Sevnaz Nourollahi, Kourosh Eshghi, Hooshmand Shokri Razaghi
2012 American Journal of Operations Research  
In this paper, an efficient simulated annealing approach is presented for TTP which applies two simultaneous and disparate models for the problem in order to search the solutions space more effectively  ...  Also, a computationally efficient modified greedy scheme is proposed for constructing a favorable initial solution for the simulated annealing algorithm.  ...  This limitation is the reason why this problem is hard to solve. d d d d d     d d d   v V  In specific parts of the proposed simulated annealing algorithm in this paper, it is necessary to use  ... 
doi:10.4236/ajor.2012.23047 fatcat:eacoag4fdffarmv3lbxpzzelp4

LightSolver – A New Quantum-inspired Solver Cracks the 3-Regular 3-XORSAT Challenge [article]

Idan Meirzada, Assaf Kalinski, Dov Furman, Tsafrir Armon, Talya Vaknin, Harel Primack, Chene Tradonsky, Ruti Ben-Shlomi
2022 arXiv   pre-print
LightSolver's simulator is the first to break the exponential barrier, outperforming both classical and quantum platforms by several orders-of-magnitude and extending the maximal problem size to more than  ...  So far, the challenge has resulted in a clear exponential barrier in terms of time-to-solution (TTS), preventing the inspected platforms from solving problems larger than a few hundred variables.  ...  ACKNOWLEDGEMENTS We wish to thank Dr. Itay Hen (University of Southern California), for performing the simulations on our alpha version of the simulator and the in-depth analysis of the results.  ... 
arXiv:2207.09517v1 fatcat:ev5ppj2obbas5eo5cqx7em3ejy

Development of a Modified Simulated Annealing to School Timetabling Problem

Odeniyi Odeniyi, O. A., Omidiora Omidiora, E. O., Olabiyisi Olabiyisi, S. O., Aluko Aluko, J. O.
2015 International Journal of Applied Information Systems  
In this work, a Modified Simulated Annealing (MSA) was developed as an approach for solving timetabling problems compared to classical Simulated Annealing (SA) approach.  ...  Simulated Annealing is a good tool for solving complex nonlinear optimization problems ii.  ... 
doi:10.5120/ijais14-451277 fatcat:rqwgeegtlzekhekr23k4brpkdy

How to Use Metaheuristics for Design of Symmetric-Key Primitives [article]

Ivica Nikolic
2017 IACR Cryptology ePrint Archive  
We use two nature-inspired metaheuristics, simulated annealing and genetic algorithm, to optimize in terms of security the components of two recent cryptographic designs, SKINNY and AES-round based constructions  ...  So far, these problems mainly have been solved with trivial algorithms such as brute force or random search.  ...  Acknowledgments The author would like to thank the anonymous reviewers of ASIACRYPT'17 for their constructive comments and Yu Sasaki for helping to finalize the paper.  ... 
dblp:journals/iacr/Nikolic17 fatcat:ez7kab77r5awvm4b6iyrsvhmum

Experimental investigation of performance differences between coherent Ising machines and a quantum annealer

Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki (+11 others)
2019 Science Advances  
Physical annealing systems provide heuristic approaches to solving combinatorial optimization problems.  ...  On denser problems, however, we observe an exponential penalty for the quantum annealer [exp(–αDWN2)] relative to CIMs [exp(–αCIMN)] for fixed anneal times, both on the SK model and on 50% edge density  ...  Simulated CIM success probability and time to solution (in round trips) for SK and MAX-CUT problems. Fig. S11. Time-to-solution analysis for D-Wave at optimal annealing time. Fig. S12.  ... 
doi:10.1126/sciadv.aau0823 fatcat:23gb76kgunhildclcr7mz46dcq

Optimizing stability bounds of finite-precision PID controllers using adaptive simulated annealing

1999 Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)  
An efficient strategy based on adaptive simulated annealing (ASA) is adopted to solve this complex optimization problem.  ...  A numerical example of optimizing the finite-precision PID controller for a steel rolling mill system is used to demonstrate the effectiveness of the proposed method.  ...  Adaptive simulated annealing The ASA is an efficient algorithm for solving the following general constrained optimization problem: min W J(w) (23 where w = [w1 . . w,,IT is the parameter vector.  ... 
doi:10.1109/acc.1999.786381 fatcat:k2rea2wvybd7jokuco3t6ynkwu

Controlling Multi Algorithms Using Round Robin for University Course Timetabling Problem [chapter]

Khalid Shaker, Salwani Abdullah
2010 Communications in Computer and Information Science  
We use a Round Robin Scheduling Algorithm (RR) as a strategy to control the application of these three algorithms.  ...  In this study, we apply three algorithms to the CTTP problem: Great Deluge, Simulated Annealing and Hill Climbing.  ...  The pseudo code for the Great Deluge Simulated Annealing Algorithm The Simulated Annealing algorithm uses a temperature temp.  ... 
doi:10.1007/978-3-642-17622-7_6 fatcat:wxkgora2a5br7cgrldckgjaqhq

LEACH-C Variants using Different Optimization Techniques: A Survey

Nidhi Saini, Rajeev Kumar, Reeta Bhardwaj
2017 International Journal of Computer Applications  
A number of LEACH-C variants came into consideration that uses different optimization techniques in place of Simulated Annealing for CH selection, cluster formation and data transmission also.  ...  Network lifetime is compared by evaluating the number of nodes dead with respect to the rounds.  ...  The most reliable method of solving NPhard problems is to use approximation algorithms to determine optimal solution of the problem in polynomial time [8] .  ... 
doi:10.5120/ijca2017915818 fatcat:k5je4ywmnjgqnnpe237j4supkq

Quantum-Inspired Solvers on Mixed-Integer Linear Programming Problem [article]

Hao Wang, Yu Pan, Wei Cui
2022 arXiv   pre-print
Quantum-inspired Ising machines, as a new computing paradigm, can be used to solve integer programming problems by reducing them into Ising models.  ...  Then, focused on Ising model, the principle and implementations of annealers and coherent Ising machines are summarized.  ...  Approximate algorithms inspired by biological or physical phenomena have been also used to design solvers, such as simulated annealing [27] .  ... 
arXiv:2204.04574v1 fatcat:pyqnmi5xznbizb3cz73meu7isy

The Optimal Power Flow Calculation of Power System Based on the Annealing Algorithm

Xiaodong Yu
2013 Energy and Power Engineering  
For this goal, the idea of simulated annealing method is introduced, mixed with the greedy randomized algorithm (GRASP), and then the hybrid SA algorithm is obtained.  ...  The result of OPF whose task is to compute the voltage and angle of each node in power system is the basic of stability calculation and failure analysis in power system.  ...  And the simulated annealing algorithm is a good solution to this problem. Simulated annealing algorithm is derived from the principle of solid annealing.  ... 
doi:10.4236/epe.2013.54b153 fatcat:3v4x5yvrtbhbvaihicvsbrxexa
« Previous Showing results 1 — 15 out of 13,867 results