Operations Research
Journal of Computational Physics
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Parallelization of the scatter search for the p-median problem
Parallel Computing - Special issue: Parallel computing in logistics
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
BDD minimization by scatter search
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the nearest neighbor rule for the traveling salesman problem
Operations Research Letters
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Arc-Routing Models for Small-Package Local Routing
Transportation Science
A survey on metaheuristics for stochastic combinatorial optimization
Natural Computing: an international journal
Computers and Operations Research
A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Estimation-based metaheuristics for the probabilistic traveling salesman problem
Computers and Operations Research
Decision support systems and the coordination of supply consortium partners
Computers in Industry
Hi-index | 0.01 |
The probabilistic traveling salesman problem (PTSP) is an important theoretical and practical topic in the study of stochastic network problems. It provides researchers with a modeling framework for exploring the stochastic effects in routing problems. This paper focuses on developing the hybrid scatter search (HSS) by incorporating the nearest neighbor rule (NNR), threshold accepting (TA) and edge recombination (ER) crossover into a scatter search conceptual framework to solve the PTSP. A set of numerical experiments were conducted to test the validity of the HSS based on the test problems from Tang and Miller-Hooks' study. The numerical results showed that the HSS can effectively solve the PTSP in most of the tested cases in terms of objective function value. Moreover, the results also indicated that incorporating threshold accepting into the scatter search framework can further increase the computation efficiency while maintaining solution quality. These findings show the potential of the proposed HSS in solving the large-scale PTSP.