Results 11 to 20 of about 8,730 (184)
POPMUSIC for the travelling salesman problem [PDF]
European Journal of Operational Research, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taillard, Eric, Helsgaun, Keld
openaire +3 more sources
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +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
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
Traveling salesman problem with a center [PDF]
Physical Review E, 2005 We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $
Adam Lipowski, Dorota Lipowska
openaire +3 more sources
Traveling salesman path problems [PDF]
Mathematical Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources
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
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
Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm
Biomimetics, 2023 The min-max clustered traveling salesmen problem (MMCTSP) is a generalized variant of the classical traveling salesman problem (TSP). In this problem, the vertices of the graph are partitioned into a given number of clusters and we are asked to find a ...
Xiaoguang Bao +3 more
doaj +1 more source