## 6 Citations

Global convergence analysis of the bat algorithm using a markovian framework and dynamical system theory

- Computer Science, MathematicsExpert Syst. Appl.
- 2018

Contextual Simulated Annealing Q-Learning for Pre-negotiation of Agent-Based Bilateral Negotiations

- BusinessEPIA
- 2019

A new learning model is introduced to enable players identifying the expected prices of future bilateral agreements, as a way to improve the decision-making process in deciding the opponent players to approach for actual negotiations.

A Particle Swarm Optimization for Terminal Resistor Matching

- Computer ScienceDEStech Transactions on Environment, Energy and Earth Sciences
- 2019

This paper transforms the terminal resistor matching problem into a minimisation multi-objective optimization problem and formulate the objective function by considering three objectives: bus voltage, rise time and overshoot, and establishes a network topology model of CAN bus in Saber, and combines saber and MATLAB.

Platelets inventory management: A rolling horizon Sim–Opt approach for an age-differentiated demand

- BusinessJ. Simulation
- 2019

In this study, a stocking model of platelets is considered under age-diﬀerentiated and stochastic demand, and a hybrid of simulation and optimisation is established to optimise the decision variables.

Cloud Charge Impacts on Thunderstorm Algorithm Performances Considering the Scheduled Power Output Optimization Problem

- Computer Science2018 Electrical Power, Electronics, Communications, Controls and Informatics Seminar (EECCIS)
- 2018

A computational intelligent based on thunderstorm mechanisms which are applied to IEEE-62 bus system considering cloud charges is gained and technical constraints and environmental requirements for defining an optimizing problem are conducted.

## References

SHOWING 1-10 OF 15 REFERENCES

Convergence theorems for a class of simulated annealing algorithms on ℝd

- Mathematics
- 1992

We study a class of simulated annealing algorithms for global minimization of a continuous function defined on a subset of We consider the case where the selection Markov kernel is absolutely…

Improving simulated annealing through derandomization

- MathematicsJ. Glob. Optim.
- 2017

The main result shows that the resulting optimization method, which is referred to as QMC-SA, converges almost surely to the global optimum of the objective functionφ for any R∈N, and is in addition able to show that the completely deterministic version of Q MC-SA is convergent.

Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions

- Computer Science
- 2000

The main idea of the paper is that of relating both the temperature value and the support dimension of the next candidate point, so that they are small at points with function value close to the current record and bounded away from zero otherwise.

Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing

- Mathematics
- 1998

We study convergence rates of R-d-valued algorithms, especially in the case of multiple targets and simulated annealing. We precise, for example, the convergence rate of simulated annealing…

Convergence of simulated annealing using Foster-Lyapunov criteria

- MathematicsJournal of Applied Probability
- 2001

Simulated annealing is a popular and much studied method for maximizing functions on finite or compact spaces. For noncompact state spaces, the method is still sound, but convergence results are…

Quantitative bounds on convergence of time-inhomogeneous Markov chains

- Mathematics
- 2004

Convergence rates of Markov chains have been widely studied in recent years. In particular, quantitative bounds on convergence rates have been studied in various forms by Meyn and Tweedie [Ann. Appl.…

Fast simulated annealing in R-d with an application to maximum likelihood estimation in state-space models

- Mathematics
- 2009

Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization

- MathematicsJ. Glob. Optim.
- 2000

It will be proved that, under suitable assumptions, the annealing algorithm for continuous global optimization is convergent.

Extensible grids: uniform sampling on a space filling curve

- MathematicsArXiv
- 2014

It is shown that certain discontinuous functions with infinite variation in the sense of Hardy and Krause can be integrated with a mean squared error of O(n^{-1-1/d}) and certain space-filling curves also attain these rates.