Results 31 to 40 of about 4,258 (228)
Linearity in the Traveling Salesman Problem
Applied Mathematics Letters, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce W. Colletti, J. Wesley Barnes
openaire +2 more sources
Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm [PDF]
Decision Science LettersThe multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution.
M. Veeresh +2 more
doaj +1 more source
Development of Heuristic Approaches for Last-Mile Delivery TSP with a Truck and Multiple Drones
Drones, 2023 Unmanned Aerial Vehicles (UAVs) are gaining momentum in many civil and military sectors. An example is represented by the logistics sector, where UAVs have been proven to be able to improve the efficiency of the process itself, as their cooperation with ...
Marco Rinaldi +4 more
doaj +1 more source
An efficient hybrid genetic algorithm for solving truncated travelling salesman problem [PDF]
Decision Science Letters, 2022 This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities as in conventional travelling salesman ...
S. Purusotham +3 more
doaj +1 more source
On the Recoverable Traveling Salesman Problem
CoRR, 2021 In this paper we consider the Recoverable Traveling Salesman Problem (TSP). Here the task is to find two tours simultaneously, such that the intersection between the tours is at least a given minimum size, while the sum of travel distances with respect to two different distance metrics is minimized.
Marc Goerigk, Stefan Lendl, Lasse Wulf
openaire +2 more sources
Computing compatible tours for the traveling salesman problem [PDF]
, 2010 We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour ...
Fortini, M +14 more
core +1 more source
Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB
Matematika, 2018 Abstrak. Travelling Salesman Problem (TSP) adalah permasalahan dimana seorang salesman harus mengunjungi semua kota yang mana tiap kota hanya dikunjungi sekali, dan harus kembali ke kota asal.
Muhammad Irfan
doaj +1 more source
An Algorithm for the Traveling Salesman Problem [PDF]
Operations Research, 1963 A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated.
Little, J. D. C. +3 more
openaire +2 more sources
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun Li 0011 +4 more
openaire +2 more sources
A model of human performance on the traveling salesperson problem. [PDF]
, 2000 A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests of the model are reported, using human performance measures from a variety of 10-, 20-, 40-, and 60-node problems, a single 48-node problem, and a single
MacGregor, J. N. +8 more
core +1 more source