Results 111 to 120 of about 4,732 (227)
Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility
, 2017 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
Iterative Patching and the Asymmetric Traveling Salesman Problem
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Goldengorin, Boris +3 more
core
Submodularity and the travelling salesman problem
, 1990 Submodularity and the travelling salesman ...
Herer, Y.
core
, 2020 Travelling salesman problem can be modeled as graph where as the cities are the graph vertices, path is graph edges and path distance is edge distance. Our goal is to seek out the shortest tour that visits each city during a given graph exactly ones then
R, RAMYA
core
Aplicação de algoritmos heuristicos para a racionalização de roteiros na coleta de malotes dos correios [PDF]
, 1996 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro TecnologicoProposição de uma metodologia de racionalização de roteiros na coleta de malotes pelos Correios através da aplicação de algoritmos heurísticos e exatos.
Canassa, Jose Aparecido
core
Optimizing Path of The Travelling Salesman Problem Through Modified Genetic Algorithms
NTU Journal of Pure SciencesThe Traveling Salesman Problem (TSP) stands as one of the earliest and most pervasive optimization challenges, aiming to streamline the salesman's travel route, ensuring efficiency and avoiding redundancy. With an extensive number of cities to visit and
Osama Hassani
doaj +1 more source
Algorithm for DNA sequence assembly by quantum annealing. [PDF]
BMC Bioinformatics, 2022 Nałęcz-Charkiewicz K, Nowak RM.
europepmc +1 more source
The traveling salesman problem
Discrete Optimization, 2006 Gregory Z. Gutin, Abraham P. Punnen
openaire +1 more source
Evolutionary computation applied to combinatorial optimisation problems [PDF]
, 2007 This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core
Travelling Salesman Problem – Case Study
, 2018 W artykule przedstawiono problem komiwojażera na przykładzie liczbowym. Celem jest znalezienie trasy łączącej wszystkie miasta, która całościowo jest najkrótsza, najszybsza lub najtańsza i ponadto zaczyna się i kończy się w określonym punkcie.
Miziołek, Angelika +2 more
core +1 more source