Simulated annealing: theory and applications
Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Operations Research
Ant algorithms for discrete optimization
Artificial Life
Tabu Search
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
Evolutionary Computing on Consumer Graphics Hardware
IEEE Intelligent Systems
A data parallel approach to genetic programming using programmable graphics hardware
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Computers and Operations Research
Probabilistic Traveling Salesman Problem with Deadlines
Transportation Science
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
Computer Aided Systems Theory - EUROCAST 2009
Parallel ant colony for nonlinear function optimization with graphics hardware acceleration
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Fast genetic programming on GPUs
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Estimation-based metaheuristics for the probabilistic traveling salesman problem
Computers and Operations Research
Parallelizing Simulated Annealing-Based Placement Using GPGPU
FPL '10 Proceedings of the 2010 International Conference on Field Programmable Logic and Applications
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform
Journal of Parallel and Distributed Computing
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
| Hi-index | 0.00 |
In this work we propose a general metaheuristic framework for solving stochastic combinatorial optimization problems based on general-purpose computing on graphics processing units (GPGPU). This framework is applied to the probabilistic traveling salesman problem with deadlines (PTSPD) as a case study. Computational studies reveal significant improvements over state-of-the-art methods for the PTSPD. Additionally, our results reveal the huge potential of the proposed framework and sampling-based methods for stochastic combinatorial optimization problems.