Results 121 to 130 of about 4,258 (228)
Problema do caixeiro viajante: um algoritmo para resolução de problemas de grande porte baseado em busca local dirigida [PDF]
Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico.Neste trabalho é proposto um algoritmo para a resolução do Problema do Caixeiro Viajante (PCV), baseado em estratégia de particionamento, que atua em conjunto com a recém
Rodrigues, Marco Antonio Pereira
core
Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility
In this article, we model an “Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility” (ICCSTSPC), a generalization of Covering Salesman Problem (CSP), in fuzzy environment.
Panigrahi, Goutam +7 more
core +1 more source
The multi-stripe travelling salesman problem. [PDF]
Çela E, Deineko VG, Woeginger GJ.
europepmc +1 more source
Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the
Milan Djordjevic +2 more
doaj
Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem. [PDF]
Kyritsis M +3 more
europepmc +1 more source
Algorithm for DNA sequence assembly by quantum annealing. [PDF]
Nałęcz-Charkiewicz K, Nowak RM.
europepmc +1 more source
Solution of the Travelling Salesman Problem - LocalSolver
Tato bakalářská práce se zabývá řešením úlohy obchodního cestujícího v optimalizačním softwaru LocalSolver. Teoretická část je zaměřena na historii a popis samotného problému obchodního cestujícího.
Uvaliyeva, Angelina
core +1 more source
A good distribution channel is needed by all kind of company. Article proposed distribution channel using certain method to reduce the delay problem, a better distribution channel so the distribution process is able to run better, and design a computer ...
Bahtiar, S. Abbas, Jeremia, Indarta
core
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
Travelling salesman problem – delivery of postal items
The aim of this thesis is to propose the process of delivering postal items by using general knowledge of the travelling salesman problem. The first part briefly describes the historical evolution concentrating on solving real problems.
Říha, Vojtěch
core

