Results 181 to 190 of about 3,935 (225)

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

TSP Solver: An Integrated Framework for Solving Traveling Salesman Problems Consistent with TSPLIB [PDF]

, 2017
The Traveling Salesman Problem (TSP) is the subject of study in operational research for more than 30 years. The TSP is considered as NP-complete; consequently, many heuristic and metaheuristic algorithms have been developed to cope with the intractable nature of the problem.
Bihter Avsar, Danial Esmaeili Aliabadi, Edris Esmaeili Aliabadi   +2 more
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

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

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 0001, Toshiaki Fujii, Yukihiro Bandoh, Takehito Miyazawa, Seishi Takamura, Atsushi Shimizu   +7 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

Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP)

15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05), 2005
This article presents the design of a high level parallel composition or CPAN (according to its Spanish acronym) that implements a parallelization of the algorithmic design technique named branch and bound and uses it to solve the travelling salesman problem (TSP), within a methodological infrastructure made up of an environment of parallel objects, an
Manuel I. Capel Tuñón, Mario Rossainz López   +1 more
openaire   +1 more source

Modeling and analysis of the polyhedral pyramid structures by method of modified traveling salesman problem (TSP)

2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2015
In this paper we discuss the features and benefits of usage the concepts of polyhedral pyramidal structure in design and analysis of flexible and adaptive organizational structures. Pyramidal polyhedra are considered as a network consisting of nodes and flows where nodes correspond to points of polyhedra, and edges correspond to flows.
Slavomir Vukmirovic, Marko Cicin-Sain, Ivan Host   +2 more
openaire   +2 more sources

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 Improvement of the Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem (TSP)

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, 2009
The ant colony optimization algorithm usually falls into local optimal solution and can not select the path with high pheromone concentration quickly in solving the TSP. According to this, in this paper an improved MAX-MIN Ant System (MMAS) algorithm based on pheromone concentration reinitialization is proposed to overcome the shortcoming above.
Tiankun Li, Wanzhong Chen, Xin Zheng, Zhuo Zhang   +3 more
openaire   +1 more source