Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

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

Highly Cited

2006

Highly Cited

2006

This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The… Expand

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

2004

2004

This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the… Expand

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

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

1993

1993

In this project, we investigated several approximation algorithms for the Max-Cut problem. Our main approach to this problem is a… Expand