A hybrid scatter search for the probabilistic traveling salesman problem

DOI10.1016/j.cor.2005.11.008zbMath1185.90162OpenAlexW2032200826MaRDI QIDQ878568

Yu-Hsin Liu

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.008

zbMATH Keywords

threshold acceptingscatter searchstochastic combinatorial optimizationprobabilistic traveling salesman problemedge recombination crossover

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (12)

A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ Validating vehicle routing zone construction using Monte Carlo simulation ⋮ Adaptive demand peak management in online transport process planning ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem ⋮ Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
• Scaling features in complex optimization problems
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• On the nearest neighbor rule for the traveling salesman problem
• Solving the probabilistic TSP with ant colony optimization
• Scatter search. Methodology and implementation in C. With CD-ROM.
• A multi-start local search algorithm for the vehicle routing problem with time windows
• Genetic algorithms for the traveling salesman problem
• Record breaking optimization results using the ruin and recreate principle
• Further results on the probabilistic traveling salesman problem
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Computational Approaches to Stochastic Vehicle Routing Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• A Priori Optimization

This page was built for publication: A hybrid scatter search for the probabilistic traveling salesman problem