Results 11 to 20 of about 59,482 (207)
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun, Li +4 more
openaire +4 more sources
Synchronized Traveling Salesman Problem
Journal of Graph Algorithms and Applications, 2021 We consider a variation of the well-known traveling salesman problem in which there are multiple agents who all have to tour the whole set of nodes of the same graph, while obeying node- and edge-capacity constraints require that agents must not "crash".
Pap, Gyula, Varnyú, József
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
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
The Attractive Traveling Salesman Problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdogan, Gunes +2 more
openaire +2 more sources
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
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
EFFICIENT TOUR PLANNING FOR A MEASUREMENT VEHICLE BY COMBINING NEXT BEST VIEW AND TRAVELING SALESMAN [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2021 Path planning for a measuring vehicle requires solving two popular problems from computer science, namely the search for the optimal tour and the search for the optimal viewpoint.
J. Gehrung +4 more
doaj +1 more source
Optimasi Asymmetric City Tour di Kota Kediri Menggunakan Ant Colony System
Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2020 Kota Kediri merupakan kota persinggahan lalu lintas transportasi dan memiliki sejumlah potensi di bidang pariwisata, pendidikan, dan industri. Dengan demikian, Kota Kediri menjadi salah satu kota yang sangat mungkin untuk berkembang dan ramai dikunjungi.
Abidatul Izzah +3 more
doaj +1 more source