Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

3-opt

In optimization, 3-opt is a simple local search algorithm for solving the travelling salesman problem and related network optimization problems. 3… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic… Expand
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
2012
2012
Small UAVs are currently used in several monitoring applications to monitor a set of targets and collect relevant data. One of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Highly Cited
2009
Highly Cited
2009
We address in this paper the one-commodity pickup-and-delivery traveling salesman problem, which is characterized by a set of… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Highly Cited
2006
Highly Cited
2006
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
2004
2004
This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Highly Cited
2004
Highly Cited
2004
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi… Expand
  • figure 3
  • table 1
  • table 2
  • table 3
  • table 4
Highly Cited
1998
Highly Cited
1998
The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
1993
1993
In this project, we investigated several approximation algorithms for the Max-Cut problem. Our main approach to this problem is a… Expand