Results 111 to 120 of about 4,258 (228)
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
Techno.ComLembaga Amil Zakat, Infaq, dan Sadaqah Muhammadiyah (Lazismu) di Pontianak Tenggara menghadapi kendala operasional dalam pengambilan donasi dari kotak infaq yang tersebar di berbagai lokasi.
Iskandar Hadiatma +2 more
doaj +1 more source
The traveling salesman problem
Discrete Optimization, 2006 Gregory Z. Gutin, Abraham P. Punnen
openaire +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core
Dataset for the electric capacitated traveling salesman problem. [PDF]
Data Brief, 2023 Gialos A, Zeimpekis V.
europepmc +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
Reachability cuts for the vehicle routing problem with time windows [PDF]
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem ...
Lysgaard, Jens
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
A new Lagrangean Approach for the Travelling Salesman Problem [PDF]
, 2015 In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman problem more suitable for Lagrangean relaxation and analyse the new approach on examples from TSP Lib.
Jörnsten, Kurt, Kalcsics, Jörg
core
The seriation problem and the travelling salesman problem
, 1978 The relationship between two combinatorial problems is explained in this paper. The first problem is the well known travelling salesman problem. The other problem, the seriation problem, is frequently encountered in archeology and has applications in ...
Laporte, Gilbert
core +1 more source