Results 111 to 120 of about 3,935 (225)
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96)
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core
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
Algoritmo Simulated Annealing: uma nova abordagem [PDF]
, 2001 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.A busca por soluções de problemas por meio do computador é o tema central da ciência da computação, relevante para ...
Araujo, Haroldo Alexandre de
core
Algoritmo de otimização paralelo: um modelo proposto e implementado [PDF]
, 2002 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.A busca de soluções para problemas de otimização das informações nas organizações por meio do computador constituiu a ...
Blume, Evandro
core
Application of the traveling salesman problem
, 2020 Problem trgovačkog putnika je problem koji se proučava još od 18. stoljeća te gotovo da nema područja u kojemu on nije primjenjiv. U ovom radu problem trgovačkog putnika, skraćeno TSP (Traveling Salesman Problem) obrađena je teorijska podloga prometnih ...
Pančić, Silvia
core
Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm [PDF]
International Journal of Industrial Engineering and Production ResearchThe Traveling Salesman Problem (TSP) is a well-known problem in optimization and graph theory, where finding the optimal solution has always been of significant interest.
Ahmad Aliyari Boroujeni, Ameneh Khadivar
doaj
Coevolutionary Memetic Algorithms for Solving Traveling Salesman Problem (TSP)
, 2013 ABSTRACT: In this thesis, Coevolutionary Memetic Algorithms are used for solving the well-known Traveling Salesman Problem (TSP). Traveling Salesman Problem is NP-Complete which means no algorithm can solve this problem in a computing time that increases polynomially with respect to the problem size.
openaire +1 more source
Aplikasi Program Dinamik pada Traveling Salesman Problem (TSP)
, 2019 Traveling Salesman Problem (TSP) is defined as a task for finding of the shortest cycle with minimum weight in complete graph of N nodes. In this articles studies about used of dynamic programming to look for optimal solution at Traveling Salesman ...
Azwar, Nurul Azri
core
Travelling Salesman Problem (TSP): Algorithms and Approaches- A Comprehensive Survey and Analysis
The Travelling Salesman Problem (TSP) represents one of the most extensively studied NP-hard combinatorial optimization problems in computer science and operations research [10,42]. This comprehensive survey examines the evolution, current state, and future directions of TSP algorithms and approaches, analyzing over 87 recent research contributions ...
openaire +2 more sources
The Pyramidal Capacitated Vehicle Routing Problem [PDF]
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP).
Lysgaard, Jens
core