Results 1 to 10 of about 122,465 (150)
Hybridizing slime mould algorithm with simulated annealing algorithm: a hybridized statistical approach for numerical and engineering design problems [PDF]
The existing slime mould algorithm clones the uniqueness of the phase of oscillation of slime mould conduct and exhibits slow convergence in local search space due to poor exploitation phase.
Leela Kumari Ch +2 more
doaj +2 more sources
An Overview of Approaches to Modernize Quantum Annealing Using Local Searches [PDF]
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm.
Nicholas Chancellor
doaj +4 more sources
A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem [PDF]
In this paper, a memory-based simulated annealing algorithm called the Dual Memory Simulated Annealing Algorithm (DMSA) is presented to solve multi-line facility layout problems. The objective is to minimize the total material handling cost. Two
Kamran Zolfi +2 more
doaj +1 more source
Quantum Simulated Annealing Algorithm [PDF]
Simulated annealing (SA) has been considered as a good tool for searchand optimization problems which represent the abstraction of obtaining thecrystalline structure through a physical process. This algorithm works sequentiallythat the current state will
Rana Fareed Ghani
doaj +1 more source
Study on Path Sweep Coverage Problem in Mobile Sensor Networks [PDF]
As an important application of wireless sensor networks, compared to traditional covering methods, a sweep coverage provides a more cost-efficient method for monitoring the Points of Interest (POIs) by placing the sensors regularly within the monitored ...
MIAO Xin, CHEN Xuan, BAO Hongying, ZHANG Jingxuan, YU Wei
doaj +1 more source
Portfolio optimization with simulated annealing algorithm [PDF]
The Markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered.
Saeid Qodsi, Reza Tehrani, Mahdi Bashiri
doaj +1 more source
Simulated annealing for earthquake location
Earthquake location is one of the most basic tasks of seismology research such as earthquake monitoring and earthquake prediction. Identification of earthquake location with high efficiency and accuracy is of great significance to the development of ...
Xiaohan Li, Guangke Li, Dawei Jiao
doaj +1 more source
This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP).
Anak Agung Ngurah Perwira Redi +6 more
doaj +1 more source
The multi-objective grasshopper optimization algorithm (MOGOA) is a relatively new algorithm inspired by the collective behavior of grasshoppers, which aims to solve multi-objective optimization problems in IoT applications.
Faria Sajjad +8 more
doaj +1 more source
In the classical simulated annealing algorithm (SAA), the iteration feasible solution is mainly based on a certain random probability. In the process of iteration, there is a lack of comparison between individuals and the whole population of feasible ...
Fangwei Zhang +3 more
doaj +1 more source

