A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Parallel Meta-heuristics
[chapter]
2010
International Series in Operations Research and Management Science
Preserved Fulltext
annealing for graph partitioning [7, 6, 91, 43] (in
the first two contributions the simulated annealing threads were enhanced with a simple tabu
search to avoid cycling and were part of a multi-level ...
Serial and Parallel Simulated
Annealing and Tabu Search Algorithms for the Traveling Salesman Problem. Annals of
Operations Research, 21:59–84, 1989. ...
doi:10.1007/978-1-4419-1665-5_17
fatcat:5hhwwngx6jb6pnaugdgvenjraq
Tabu Search for Partitioning Dynamic Dataflow Programs
2016
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The approach relies on the use of a simulation tool, capable of estimating the performance for any partitioning configuration exploiting a model of the target architecture and the profiling results. ...
The partitioning solutions generated with tabu search are validated for consistency and high accuracy with experimental platform executions. ...
Multi-objective evolutionary algorithms used for performing an automatic design space exploration are also an objective of work discussed in [28] . ...
doi:10.1016/j.procs.2016.05.486
fatcat:k2dbqkbfznfghkybdpqdasv7sm
Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem
2012
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP). ...
The algorithm has been tested upon a series of benchmarks including large scale test case and has shown better output than the simple or non-modified version of the same algorithm. ...
They used multi-objective evolutionary algorithms (MOEA) for good diversity and (local) convergence. ...
doi:10.1016/j.procs.2012.04.034
fatcat:mfal6ftu7bemfmei2kaatgpt7i
Parallel Metaheuristics Applications
[chapter]
2005
Parallel Metaheuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The reader may consult a number of surveys, taxonomies, and syntheses of parallel meta-heuristics, of which quite a few address the "classical" meta-heuristics, Simulated Annealing, Genetic Algorithms, ...
and Tabu Search, while some others address the field in more comprehensive terms: ...
Acknowledgments Funding for this project has been provided by the Natural Sciences and Engineering Council of Canada, and by the Fonds FQRNT of the Province of Québec. ...
doi:10.1002/0471739383.ch19
fatcat:junbparoinckhfulturvyqvuxu
Towards hybrid evolutionary algorithms
1999
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms. ...
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms. ...
The search algorithm may be a simple hill-climber, a tabu search, or even some kind of simulated annealing algorithm [4] . ...
doi:10.1016/s0969-6016(99)00019-2
fatcat:cr525zd6hvgg3gfe55642t5jsi
Towards hybrid evolutionary algorithms
1999
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms. ...
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms. ...
The search algorithm may be a simple hill-climber, a tabu search, or even some kind of simulated annealing algorithm [4] . ...
doi:10.1111/j.1475-3995.1999.tb00173.x
fatcat:axqcpomtujcx5fd23rsnwqo54m
:{unav)
2012
Journal of Heuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The taxonomy, while presented in terms of metaheuristics, is also applicable to most types of heuristics and exact optimization algorithms. ...
In this paper, a taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms. ...
Combinations of algorithms such as descent local search, simulated annealing, tabu search, and evolutionary algorithms have provided very powerful search algorithms. ...
doi:10.1023/a:1016540724870
fatcat:zrjhda6uqfgm3b23zfa7lcm2bu
Survey of Metaheuristic Algorithms for Combinatorial Optimization
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These include simulated annealing, tabu search, variable neighborhood search and greedy randomized adaptive search procedure. Population based methods deal with a set of solutions. ...
This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems. ...
In order to improve the performance simulated annealing is merged with a tabu search algorithm [4] . Huajin jang et al (2006) proposed a simulated annealing for solving traveling salesman problem. ...
doi:10.5120/9391-3813
fatcat:7ur2f64xvvb6jc4ojsd5jujfeq
Benchmarking of Graph Partitioning Tools and Techniques
2019
International journal of recent technology and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Tools are compared on the basis of parameters which will impact the performance of tool. ...
Also authors have suggested future research directions and anomalies for improvement in tools and techniques for Graph Partitioning. ...
Tabu search and simulated annealing are mostly used. Simulated annealing found to be older but good optimization method. ...
doi:10.35940/ijrte.d7369.118419
fatcat:hy2qdjhk6zbd5al5up26qce7yy
Acceleration Based Particle Swarm Optimization for Graph Coloring Problem
2015
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In case of tabu search, the algorithm becomes slow, if the tabu list is big. ...
Simulated annealing has a big handicap when applied to graph coloring problem because there are lots of neighboring states that have the same energy value. ...
The algorithm is compared with simulated annealing and experiment shows that tabu search outperforms simulated annealing on different instances of random dense graph performance. ...
doi:10.1016/j.procs.2015.08.223
fatcat:mycmrbqd6zbnrfyjotno3juzwq
Simulated Annealing
[chapter]
2010
International Series in Operations Research and Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Asymptotic convergence and finite-time performance theory for simulated annealing are reviewed. Other local search algorithms are discussed in terms of their relationship to simulated annealing. ...
Background Survey Simulated annealing is a local search algorithm (metaheuristic) capable of escaping from local optima. ...
Acknowledgments This work is supported in part by the Air Force Office of Scientific Research (FA9550-07-1-0232). The authors wish to thank the anonymous referees for their feedback on this chapter. ...
doi:10.1007/978-1-4419-1665-5_1
fatcat:idntn7ghpnc6div67wrwchizru
Allocation search methods for a generalized class of location–allocation problems
2009
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In particular, we apply multi-start, (variable) neighborhood search, tabu search, simulated annealing, an evolutionary algorithm and an ant colony optimization algorithm. ...
For the resulting multi-dimensional mixed-integer optimization problem, we compare various traditional and new search methods. ...
Each search method, that is the multi-start method, K-neighborhood search, variable neighborhood search, tabu search, simulated annealing, threshold accepting, the evolutionary algorithm and the ant colony ...
doi:10.1016/j.ejor.2007.10.022
fatcat:vqssr5cnmzai7h7ffmnew4copi
A Multi-Agent System to Assist with Property Valuation Using Heterogeneous Ensembles of Fuzzy Models
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Six optimization heuristics including genetic, tabu search, simulated annealing, minimum average and random algorithms were implemented and applied to obtain the best ensembles for different number of ...
The multi-agent system for real estate appraisals MAREA was extended to include aggregating agents, which are equipped with heuristic optimization algorithms and can create heterogeneous ensemble models ...
N N519 407437 funded by Polish Ministry of Science and Higher Education (2009-2012). ...
doi:10.1007/978-3-642-13480-7_44
fatcat:cdftygzhpvbytlh5vtxzyd5xhu
Graph drawing using tabu search coupled with path relinking
2018
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. ...
We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. ...
We first compared the performance of our tabu search method to hill climbing and simulated annealing. ...
doi:10.1371/journal.pone.0197103
pmid:29746576
pmcid:PMC5945037
fatcat:hrdobgz7p5cslg2gce5ifijrba
Multi-objective optimization using metaheuristics: non-standard algorithms
2012
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Most studies on metaheuristics for multiobjective optimization are focused on Evolutionary Algorithms, and some of the state-of-the-art techniques belong to this class of algorithms. ...
In particular, we focus on non-evolutionary metaheuristics, hybrid multi-objective metaheuristics, parallel multi-objective optimization, and multi-objective optimization under uncertainty. ...
Multi-objective Simulated Annealing Simulated Annealing algorithms are commonly said to be the oldest among the metaheuristics. ...
doi:10.1111/j.1475-3995.2011.00808.x
fatcat:wkcurdztanek5i5ptwfikqha3a
« Previous
Showing results 1 — 15 out of 912 results