Expanding Neighborhood GRASP for the Traveling Salesman Problem

Authors:
Yannis Marinakis;Athanasios Migdalas;Panos M. Pardalos
Affiliations:
Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete, Chania, Greece 73100;Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete, Chania, Greece 73100;Department of Industrial and Systems Engineering, University of Florida, USA
Venue:
Computational Optimization and Applications
Year:
2005

Citing 8
Cited 12

Data structures and network algorithms

Data structures and network algorithms
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
A Multilevel Approach to the Travelling Salesman Problem

Operations Research
Efficient cluster compensation for lin-kernighan heuristics

Efficient cluster compensation for lin-kernighan heuristics
Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
A hybrid heuristic for the traveling salesman problem

IEEE Transactions on Evolutionary Computation

A Hybrid Clustering Algorithm Based on Honey Bees Mating Optimization and Greedy Randomized Adaptive Search Procedure

Learning and Intelligent Optimization
A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem

Computers and Operations Research
A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem

Expert Systems with Applications: An International Journal
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
Honey Bees Mating Optimization algorithm for large scale vehicle routing problems

Natural Computing: an international journal
A hybrid particle swarm optimization algorithm for the vehicle routing problem

Engineering Applications of Artificial Intelligence
Process visualization to solve the travelling salesman problem

Proceedings of the 3rd International Symposium on Visual Information Communication
A honey bees mating optimization algorithm for the open vehicle routing problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Information Sciences: an International Journal
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem

Expert Systems with Applications: An International Journal
A hybrid particle Swarm optimization algorithm for clustering analysis

DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
A discrete gravitational search algorithm for solving combinatorial optimization problems

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the application of a modified version of the well known Greedy Randomized Adaptive Search Procedure (GRASP) to the TSP. The proposed GRASP algorithm has two phases: In the first phase the algorithm finds an initial solution of the problem and in the second phase a local search procedure is utilized for the improvement of the initial solution. The local search procedure employs two different local search strategies based on 2-opt and 3-opt methods. The algorithm was tested on numerous benchmark problems from TSPLIB. The results were very satisfactory and for the majority of the instances the results were equal to the best known solution. The algorithm is also compared to the algorithms presented and tested in the DIMACS Implementation Challenge that was organized by David Johnson.