Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem

DOI10.1007/s11590-007-0064-3zbMath1159.90462OpenAlexW1984036937MaRDI QIDQ941025

Athanasios Migdalas, Panos M. Pardalos, Yannis Marinakis

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-007-0064-3

zbMATH Keywords

metaheuristicsprobabilistic traveling salesman problemexpanding neighborhood search-GRASP

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Shortest path problems with left-side time windows, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, Honey bees mating optimization algorithm for large scale vehicle routing problems, Estimation-based metaheuristics for the probabilistic traveling salesman problem, 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

• TSPLIB
• GRASP
• LKH

Cites Work

• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• A hybrid scatter search for the probabilistic traveling salesman problem
• Solving the probabilistic TSP with ant colony optimization
• Greedy randomized adaptive search procedures
• Further results on the probabilistic traveling salesman problem
• Aggregation for the probabilistic traveling salesman problem
• Expanding neighborhood GRASP for the traveling salesman problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Tabu Search—Part I
• Tabu Search—Part II
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Computational Approaches to Stochastic Vehicle Routing Problems
• Computer Solutions of the Traveling Salesman Problem
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item