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
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
Exploiting planarity in separation routines for the symmetric traveling salesman problem [PDF]
, 2008 At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Adam N. Letchford +5 more
core +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
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
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
Linearity in the Traveling Salesman Problem
Applied Mathematics Letters, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce W. Colletti, J. Wesley Barnes
openaire +2 more sources
Computing compatible tours for the traveling salesman problem [PDF]
, 2010 We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour ...
Fortini, M +14 more
core +1 more source
The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types
Mathematics, 2020 The double traveling salesman problem with multiple stacks involves the transportation of goods between two regions. In one region, a vehicle carrying a container visits customers, where pallets of goods are loaded into the container.
Lars Magnus Hvattum +2 more
doaj +1 more source
TSP - Infrastructure for the Traveling Salesperson Problem [PDF]
, 2006 The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.
Kurt Hornik +3 more
core +2 more sources