Results 21 to 30 of about 863 (188)
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
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
Journal of Transportation and Logistics, 2018 Logistics sector is one of the most prominent field in economic development of a country. Travelling Salesman Problem which is studied commonly in logistic sector is also based a number of other problems.
Mehmet Aksaraylı, Osman Pala
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
OPSI, 2023 The optimization of route planning is a critical consideration frequently happened in the logistics of product distribution. This study addresses distribution issues, such as long trip distances, which result in high distribution costs.
Hayati Mukti Asih +4 more
doaj +1 more source
An efficient hybrid genetic algorithm for solving truncated travelling salesman problem [PDF]
Decision Science Letters, 2022 This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities as in conventional travelling salesman ...
S. Purusotham +3 more
doaj +1 more source
Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm [PDF]
Journal of Project ManagementThe Multiple Travelling Salesman Problem (MTSP) is one of the prominent combinatorial optimization problems with both theoretical interest and practical applications.
M. Veeresh +2 more
doaj +1 more source
Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm [PDF]
Decision Science LettersThe multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution.
M. Veeresh +2 more
doaj +1 more source
Development of Heuristic Approaches for Last-Mile Delivery TSP with a Truck and Multiple Drones
Drones, 2023 Unmanned Aerial Vehicles (UAVs) are gaining momentum in many civil and military sectors. An example is represented by the logistics sector, where UAVs have been proven to be able to improve the efficiency of the process itself, as their cooperation with ...
Marco Rinaldi +4 more
doaj +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 $
Lipowski, Adam, Lipowska, Dorota
openaire +3 more sources