Results 21 to 30 of about 108,421 (273)
An open close multiple travelling salesman problem with single depot [PDF]
Decision Science Letters, 2019 This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP).
Jayanth Kumar Thenepalle +1 more
doaj +1 more source
IEEE Access, 2020 Optimizing the coverage path planning (CPP) in robotics has become essential to accomplish efficient coverage applications. This work presents a novel approach to solve the CPP problem in large complex environments based on the Travelling Salesman Problem
Phone Thiha Kyaw +5 more
semanticscholar +1 more source
On solving Travelling Salesman Problem with Vertex Requisitions [PDF]
Yugoslav Journal of Operations Research, 2017 We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev Anton V., Kovalenko Yulia V.
doaj +1 more source
ECOLOGICAL OPTIMIZATION OF CARGO TRANSPORTATION OF AN ENTERPRISE USING INFORMATION SYSTEMS
Фінансово-кредитна діяльність: проблеми теорії та практики, 2022 . The aim of the article is to systematize the existing ways to decrease the environmental load at the enterprise, in the country and in the world, to identify ways of greening the enterprise by using transportation means to transport goods from ...
О. Sazonets , A. Terebii
doaj +1 more source
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 +2 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
An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows [PDF]
Yugoslav Journal of Operations Research, 2013 General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems.
Mladenović Nenad +2 more
doaj +1 more source
GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The Travelling Salesman Problem (TSP) is a classical problem in combinatorial optimization that consists of finding the shortest tour through all cities such that the salesman visits each city only one time and returns to the starting city.
N. Mouttaki, J. Benhra, G. Rguiga
doaj +1 more source
Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem
IEEE Access, 2023 Fleet management plays a central role in several application contexts such as distribution planning, mail delivery, garbage collection, salt gritting, field service routing. Since road congestion has a big impact on driving times, fleet management can be
Tommaso Adamo +3 more
doaj +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