Results 171 to 180 of about 21,266 (220)
Some of the next articles are maybe not open access.
LF-TSP: Traveling salesman problem for HEVC-based light-field coding
2019 IEEE Visual Communications and Image Processing (VCIP), 2019We 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 +7 more
openaire +1 more source
A Secure Quantum Technology for Smart Cities Using Travelling Salesman Problem (TSP)
2023Modern 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 +2 more
openaire +1 more source
Traveling Salesman Problem With a Drone Station
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2019The importance of drone delivery services is increasing. However, the operational aspects of drone delivery services have not been studied extensively. Specifically, with respect to truck-drone systems, researchers have not given sufficient attention to ...
Sungwook Kim, I. Moon
semanticscholar +1 more source
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
INFORMS journal on computing, 2019The Traveling Salesman Problem with a Drone (TSP-D) is a hybrid truck and drone model of delivery, in which the drone rides on the truck and launches from the truck to deliver packages.
Stefan Poikonen, B. Golden, E. Wasil
semanticscholar +1 more source
An Application of Assignment Problem in Traveling Salesman Problem (TSP)
2014Assignment 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 +6 more
openaire +1 more source
Application of traveling salesman problem (TSP) for decision of optimal production sequence
Korean Journal of Chemical Engineering, 1997In 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 +5 more
openaire +1 more source
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
Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)
2007 International Conference on Intelligent and Advanced Systems, 2007Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely ant colony system (ACS). The principle of cooperation has been the backbone in these algorithmic developments.
Helmi Md Rais +2 more
openaire +1 more source
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
European Journal of Operational Research, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Dal, René +2 more
openaire +2 more sources