A guide to simulation (2nd ed.)
A guide to simulation (2nd ed.)
P-Complete Approximation Problems
Journal of the ACM (JACM)
Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A Development Framework for Rapid Meta-Heuristics Hybridization
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Neural Networks - 2005 Special issue: IJCNN 2005
Engineering Applications of Artificial Intelligence
Efficient parallel cooperative implementations of GRASP heuristics
Parallel Computing
Computers and Operations Research
Improved Tabu search heuristics for the dynamic space allocation problem
Computers and Operations Research
Iterated fast local search algorithm for solving quadratic assignment problems
Robotics and Computer-Integrated Manufacturing
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A new iterated fast local search heuristic for solving QAP formulation in facility layout design
Robotics and Computer-Integrated Manufacturing
Solving the flow shop problem by parallel programming
Journal of Parallel and Distributed Computing
The single-finger keyboard layout problem
Computers and Operations Research
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Autonomous Control Approach for Local Search
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Efficient MAP Inference for Statistical Relational Models through Hybrid Metaheuristics
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Hierarchical Iterated Local Search for the Quadratic Assignment Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
High Performing Algorithms for MAP and Conditional Inference in Markov Logic
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Chemical-reaction-inspired metaheuristic for optimization
IEEE Transactions on Evolutionary Computation
International Journal of Innovative Computing and Applications
Consultant-guided search algorithms for the quadratic assignment problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem
Computers and Industrial Engineering
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Boosting learning and inference in Markov logic through metaheuristics
Applied Intelligence
ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignment
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards paradisEO-MO-GPU: a framework for GPU-based local search metaheuristics
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
The balanced academic curriculum problem revisited
Journal of Heuristics
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Variable neighborhood search with permutation distance for QAP
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
On the quality and quantity of random decisions in stochastic local search for SAT
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
GPU-Based multi-start local search algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A parallel tabu search algorithm for optimizing multiobjective VLSI placement
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
New linearizations of quadratic assignment problems
Computers and Operations Research
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Operations Research Letters
An exploration-exploitation compromise-based adaptive operator selection for local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
Journal of Global Optimization
ACO on multiple GPUs with CUDA for faster solution of QAPs
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A Tabu Search Approach for the NMR Protein Structure-Based Assignment Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A comparison of operator utility measures for on-line operator selection in local search
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Enhancing the performance of hybrid genetic algorithms by differential improvement
Computers and Operations Research
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Computer Networks: The International Journal of Computer and Telecommunications Networking
A study of adaptive perturbation strategy for iterated local search
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
ParadisEO-MO-GPU: a framework for parallel GPU-based local search metaheuristics
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Thermal-constrained task allocation for interconnect energy reduction in 3-D homogeneous MPSoCs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform
Journal of Parallel and Distributed Computing
Computers and Operations Research
| Hi-index | 0.00 |
An adaptation of taboo search to the quadratic assignment problem is discussed in this paper. This adaptation is efficient and robust, requiring less complexity and fewer parameters than earlier adaptations. In order to improve the speed of our taboo search, two parallelization methods are proposed and their efficiencies shown for a number of processors proportional to the size of the problem. The best published solutions to many of the biggest problems have been improved and every previously best solution (probably optimal) of smaller problems has been found. In addition, an easy way of generating random problems is proposed and good solutions of these problems, whose sizes are between 5 and 100, are given.