Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic… Expand

Is this relevant?

Highly Cited

2015

Highly Cited

2015

The Traveling Salesman Problem (TSP) is one of the standard test problems used in performance analysis of discrete optimization… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic… Expand

Is this relevant?

2012

2012

In this paper we are presenting high performance GPU implementations of the 2-opt and 3-opt local search algorithms used to solve… Expand

Is this relevant?

2012

2012

In this paper we are presenting high performance GPU implementations of the 2-opt and 3-opt local search algorithms used to solve… Expand

Is this relevant?

2011

2011

The Traveling Salesman Problem (TSP) is a famous NP-hard problem typically solved using various heuristics. One of popular… Expand

Is this relevant?

2005

2005

The general routing problem (GRP) is the problem of finding a minimum length tour, visiting a number of specified vertices and… Expand

Is this relevant?

1996

1996

A special class of 4-opt moves plays a key role in several leading heuristics for the traveling salesman problem (TSP). However… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

We consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

We introduce a new class of Markov chain Monte Carlo search procedures, leading to more powerful optimizat~on methods than… Expand

Is this relevant?