Results 191 to 200 of about 3,935 (225)
Some of the next articles are maybe not open access.
High Performance Ant Colony Optimizer (HPACO) for Travelling Salesman Problem (TSP)
2014Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature and is well suited for evaluation of unconventional algorithmic approaches based on natural computation. Ant Colony Optimization (ACO) technique is one of the popular unconventional optimization technique to solve this problem. In this
Sudip Kumar Sahana, Aruna Jain
openaire +1 more source
Bibliometric Analysis Of Travelling Salesman Problem With Drones (TSP-D)
International Journal of Advanced Communication Technology (IJACT)The growing need for efficient package delivery systems in Last Mile Delivery (LMD) has attracted significant attention, bringing the Travelling Salesman Problem with Drones (TSP-D) to the forefront of scholarly research. The research under consideration generated a surge in scientific output across various domains, including economics, industry, and ...
null Yugeswary Kanesen +6 more
openaire +1 more source
13th International IEEE Conference on Intelligent Transportation Systems, 2010
In this paper we present the Intelligent Transportation Systems Traveling Salesman Problem (ITS-TSP), which is a heuristic algorithm loosely based on the traditional TSP with three variations: the edge weights can change constantly, not every node in the graph must be visited, and simple cycles can exist.
Jeffrey Miller +2 more
openaire +1 more source
In this paper we present the Intelligent Transportation Systems Traveling Salesman Problem (ITS-TSP), which is a heuristic algorithm loosely based on the traditional TSP with three variations: the edge weights can change constantly, not every node in the graph must be visited, and simple cycles can exist.
Jeffrey Miller +2 more
openaire +1 more source
IMPLEMENTASI TRAVELING SALESMAN PROBLEM (TSP) MENGGUNAKAN ALGORITMA BRUTE FORCE [PDF]
, 2021 PLN adalah suatu perusahaan yang mengurus semua aspek kelistrikan. Perusahaan tersebut harus selalu melakukan maintenance di setiap gardunya. Hal tersebut membuat semua teknisi harus memperhitungkan rute dengan jarak terpendek agar meminimumkan biaya transportasi dan waktu yang digunakan.
openaire
IEEE Transactions on Systems, Man, and Cybernetics, 1994
Local search is very efficient to solve combinatorial optimization problems. Due to the rugged terrain surface of the search space, it often gets stuck at a locally optimum configuration. In this paper, we give a local search method with a search space smoothing technique. It is capable of smoothing the rugged terrain surface of the search space.
Jun Gu, Xiaofei Huang
openaire +1 more source
Local search is very efficient to solve combinatorial optimization problems. Due to the rugged terrain surface of the search space, it often gets stuck at a locally optimum configuration. In this paper, we give a local search method with a search space smoothing technique. It is capable of smoothing the rugged terrain surface of the search space.
Jun Gu, Xiaofei Huang
openaire +1 more source
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
Operations Research Letters, 2020Stefan Hougardy +2 more
exaly