Results 11 to 20 of about 166,209 (267)
IET Networks, EarlyView., 2022 Abstract Everything can be connected in the Internet of Things (IoTs) technology that enables efficient communication between connected objects. IoTs industry‐based meta‐heuristic and mining algorithms, which are considered an important field of Artificial Intelligence will be used to construct a healthcare application in this study for lowering costs,
Muhaned Al‐Hashimi +4 more
wiley +1 more source
Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster
International Journal of Computational Intelligence Systems, 2021 The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) and Traveling Repairman Problem (TRP). In the TSP and TRP, the travel time to travel is assumed to be constant.
Ha-Bang Ban
doaj +1 more source
Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika
Journal of Applied Computer Science and Technology, 2021 Garbage pick-ups performed by two or more people must have a route in their pickup. However, it is not easy to model the route of the pickup that each point must be passed and each point is only passed once.
Aswandi +2 more
doaj +1 more source
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
IEEE Access, 2021 The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). To address this issue, we propose a novel greedy genetic sparrow search algorithm based on a sine
Changyou Wu +3 more
semanticscholar +1 more source
Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem [PDF]
Interdisciplinary Description of Complex Systems, 2020 The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. There are many different extensions and modifications of the original problem, such as The Time Dependent Traveling Salesman Problem (TDTSP), this specific extension
Ruba S. Almahasneh, László T. Kóczy
doaj +1 more source
Reinforcement learning for the traveling salesman problem with refueling
Complex & Intelligent Systems, 2021 The traveling salesman problem (TSP) is one of the best-known combinatorial optimization problems. Many methods derived from TSP have been applied to study autonomous vehicle route planning with fuel constraints.
A. L. Ottoni +3 more
semanticscholar +1 more source
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem [PDF]
AAAI Conference on Artificial Intelligence, 2020 We address the Traveling Salesman Problem (TSP), a famous NP-hard combinatorial optimization problem. And we propose a variable strategy reinforced approach, denoted as VSR-LKH, which combines three reinforcement learning methods (Q-learning, Sarsa and ...
Jiongzhi Zheng +4 more
semanticscholar +1 more source
Velocity‐based stowage policy for a semiautomated fulfillment system
Production and Operations Management, EarlyView., 2022 Abstract Online retail fulfillment is increasingly performed by semiautomated fulfillment systems in which inventory is stored in mobile pods that are moved by robotic drives. In this paper, we develop a model that explores the benefits of velocity‐based stowage policies for semiautomated fulfillment systems, also known as robotic mobile fulfillment ...
Tolga Cezik +2 more
wiley +1 more source
An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets
Algorithms, 2018 The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems.
Furqan Hussain Essani, Sajjad Haider
doaj +1 more source
Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem
EAI Endorsed Transactions on Energy Web, 2018 Traveling Salesman Problem is one of the motivating problem in classical and advanced Optimization. In this work, theoretical analysis and relative study of Traveling Salesman Problem in Intuitionistic Fuzzy Optimization is examined with real examples.
Anitha. N, C. Vijayalakshmi
doaj +1 more source