Results 101 to 110 of about 11,422 (178)
Developing an efficient heuristic algorithm for multiple traveling salesman problem
, 2020 The Traveling Salesman Problem is a non-deterministic polynomial problem. The Multiple Traveling Salesman Problem is one of the generalizations of the traveling salesman problem in which more than one salesperson is allowed.
Kankotiya, Gaurang
core
Traveling Salesman Problem Under Categorization
, 1992 We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem.
Punnen, AP.
core +1 more source
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover
, 2012 Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time.
Masson, Michael E. J. +2 more
core +1 more source
A three-phase algorithm for the pollution traveling Salesman problem
HeliyonThis paper studies a variant of the Pollution Traveling Salesman Problem (PTSP) focused on fuel consumption and pollution emissions (PTSPC). The PTSPC generalizes the well-known Traveling Salesman Problem (TSP), classified as NP-Hard.
Karen García-Vasquez +2 more
doaj +1 more source
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP.
Jäger, G., Goldengorin, B.
core
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core
Traveling salesman games with the Monge property
, 2004 optimization problems and the core non-emptiness of cooperative games associated with them, and between intractable combinatorial optimization problems and the hardness to decide the core non-emptiness of the associated games.
Okamoto, Yoshio, Yoshio Okamoto
core +1 more source
Approaches for solving some scheduling and routing problems
, 2009 We study approaches for finding good solutions, and lower bounds, for three difficult combinatorial optimisation problems.The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must ...
Drake, Andrew John
core
The traveling salesman problem
Discrete Optimization, 2006 Gregory Z. Gutin, Abraham P. Punnen
openaire +1 more source
TSP--Infrastructure for the Traveling Salesperson Problem
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Kurt Hornik, Michael Hahsler
core