Results 161 to 170 of about 15,296 (207)

Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2009
The multiagent optimization system (MAOS) is a nature-inspired method, which supports cooperative search by the self-organization of a group of compact agents situated in an environment with certain sharing public knowledge. Moreover, each agent in MAOS is an autonomous entity with personal declarative memory and behavioral components.
Xiao-Feng, Xie, Jiming, Liu
openaire   +2 more sources

Optical processor for solving the traveling salesman problem (TSP)

SPIE Proceedings, 2006
This paper introduces an optical solution to (bounded-length input instances of) an NP-complete problem called the traveling salesman problem using a pure optical system. The solution is based on the multiplication of a binary-matrix, representing all feasible routes, by a weight-vector, representing the weights of the problem.
Natan T. Shaked, Gil Simon, Tal Tabib, Stephane Mesika, Shlomi Dolev, Joseph Rosen   +5 more
openaire   +1 more source

MGA-TSP: modernised genetic algorithm for the travelling salesman problem

International Journal of Reasoning-based Intelligent Systems, 2019
This paper proposes a new enhanced algorithm called modernised genetic algorithm for solving the travelling salesman problem (MGA-TSP). Recently, the most successful evolutionary algorithm used for TSP problem, is GA algorithm. The main obstacles for GA is building its initial population.
N.A. Ra', ed M. Al Khatib, Mohammed Azmi Al Betar, Mohammed A. Awadallah, Khalid M.O. Nahar, Mohammed M. Abu Shquier, Ahmad M. Manasrah, Ahmad Bany Doumi   +7 more
openaire   +1 more source

Optimized Solution of TSP (Travelling Salesman Problem) Based on Mendelian Inheritance

Recent Advances in Computer Science and Communications, 2020
Background: TSP problem has been the part of literature from many decades; it’s an important optimization issue in operation research. TSP problem always remain greedy for the better results especially if chosen working field are Genetic Algorithms (GA).
Vivek Sharma, Rakesh Kumar, Sanjay Tyagi
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  

LF-TSP: Traveling salesman problem for HEVC-based light-field coding

2019 IEEE Visual Communications and Image Processing (VCIP), 2019
We studied a coding scheme where light field (LF) images (dense multi-view images) are regarded as a sequence of temporal video frames and encoded with video codecs such as High Efficiency Video Coding (HEVC). An important issue with this scheme is how to determine the frame order of the LF images.
Kota Imaeda, Kohei Isechi, Keita Takahashi, Toshiaki Fujii, Yukihiro Bandoh, Takehito Miyazawa, Seishi Takamura, Atsushi Shimizu   +7 more
openaire   +1 more source

A Secure Quantum Technology for Smart Cities Using Travelling Salesman Problem (TSP)

2023
Modern computing techniques like quantum computing are based on the remarkable phenomena of quantum mechanics. With an increasing number of instances of quantum supremacy displaying that a programmable quantum device can overcome the challenge that no computer algorithm can solve in any reasonable amount of time being shown by Google, IBM, Honeywell ...
A. Rehash Rushmi Pavitra, I. Daniel Lawrence, A. Muthukrishnan   +2 more
openaire   +1 more source

An Application of Assignment Problem in Traveling Salesman Problem (TSP)

2014
Assignment problem (AP) is completely degenerate form of a transportation problem. It appears in somedecision-making situations, this paper focused on TSP for finding the shortest closed route. By using „ROAMethod" and „Ghadle and Muley Rule" will get optimal solution for TSP within few steps.
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, null Hasneeza Liza Zakaria, null M. S Asi, null Rozmie Razif Othman, null Wan Nur Suryani Firuz Wan Ariffin, null Nuraminah Ramli, null Mohd Alif Hasmani Abd Ghani   +6 more
openaire   +1 more source

Application of traveling salesman problem (TSP) for decision of optimal production sequence

Korean Journal of Chemical Engineering, 1997
In the present study a reliable and structural decision system for production sequence of polymeric products is developed. Minimization of the amount of off-specs is the main objective in the decision of production sequence to maximize profit. Off-specs are generated when the production sequence of polymeric products is changed. The amount of off-specs
Eun-Young Jeong, Sea Cheon Oh, Yeong-Koo Yeo, Kun Soo Chang, Jin Yang Chang, Kil Su Kim   +5 more
openaire   +1 more source