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
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
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
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
The geometric maximum traveling salesman problem [PDF]
Journal of the ACM, 2003 We consider the traveling salesman problem when the cities are points in ℝ d for some fixed d and distances are computed according to geometric distances, determined by some norm.
Barvinok, A. +5 more
openaire +4 more sources
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm [PDF]
Journal of Project Management, 2021 In open travelling salesman subset-tour problem (OTSSP), the salesman needs to traverse a set of k (≤n) out of n cities and after visiting the last city, the salesman does not necessarily return to the central depot.
Singamsetty, Purusotham +2 more
doaj +1 more source
Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm
Journal of Computing Research and Innovation, 2022 Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP.
Siti Hafawati Jamaluddin +3 more
doaj +3 more sources
The 2013 Multi-objective Physical Travelling Salesman Problem Competition [PDF]
, 2014 This paper presents the game, framework, rules and results of the Multi-objective Physical Travelling Salesman Problem (MO-PTSP) Competition, that was held at the 2013 IEEE Conference on Computational Intelligence in Games (CIG).
Cowling, Peter I +5 more
core +1 more source
Optimal Scheduling Using Branch and Bound with SPIN 4.0 [PDF]
, 2003 The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct.
A. Fehnker +15 more
core +5 more sources
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
, 2017 We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal recombination problem is solved ...
AV Eremeev +12 more
core +1 more source