Semantic Scholar uses AI to extract papers important to this topic.
This article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic… Expand The Traveling Salesman Problem (TSP) is one of the standard test problems used in performance analysis of discrete optimization… Expand Small UAVs are currently used in several monitoring applications to monitor a set of targets and collect relevant data. One of… Expand We address in this paper the one-commodity pickup-and-delivery traveling salesman problem, which is characterized by a set of… Expand This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The… Expand The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number… Expand This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the… Expand The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi… Expand The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available… Expand In this project, we investigated several approximation algorithms for the Max-Cut problem. Our main approach to this problem is a… Expand