A Multi-Phase Method for Euclidean Traveling Salesman Problems
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS [PDF]
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
Improved Biogeography-Based Optimization for the Traveling Salesman Problem
We develop a novel method to improve biogeography-based optimization (BBO) for solving the traveling salesman problem (TSP). The improved method is comprised of a greedy randomized adaptive search procedure, the 2-opt algorithm, and G2BBO.
Cheng-Hsiung Tsai +5 more
semanticscholar +1 more source
A Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Drone
The challenging idea of using drones in last-mile delivery systems of logistics addresses a new routing problem referred to as the traveling salesman problem with drone (TSP-D).
Noyan Sebla Gunay-Sezer +2 more
semanticscholar +1 more source
Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model
Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren +3 more
doaj +1 more source
Exact Methods for the Traveling Salesman Problem with Drone
Efficiently handling last-mile deliveries becomes more and more important nowadays. Using drones to support classical vehicles allows improving delivery schedules as long as efficient solution methods to plan last-mile deliveries with drones are ...
R. Roberti, Mario Ruthmair
semanticscholar +1 more source
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
The sparrow search algorithm (SSA) tends to fall into local optima and to have insufficient stagnation when applied to the traveling salesman problem (TSP). To address this issue, we propose a novel greedy genetic sparrow search algorithm based on a sine
Changyou Wu +3 more
semanticscholar +1 more source
A novel discrete Rat swarm optimization (DRSO) algorithm for solving the traveling salesman problem
: Metaheuristics are often used to find solutions to real and complex problems. These algorithms can solve optimization problems and provide solutions close to the global optimum in an acceptable and reasonable time.
Toufik Mzili +3 more
semanticscholar +1 more source
TRAVELLING SALESMAN PROBLEM (TSP) OPTIMIZATION SEED DIS-TRIBUTION USING GENETIC ALGORITHM
Abstract: Distribution is an important the business sector, the agricultural sector for distributing seeds to ensure the location of customers selling seeds. Problems that are often encountered seed distribution process are the efficiency of the time and distance distribution.
Vera Wati +3 more
openaire +1 more source
Exact methods for the traveling salesman problem with multiple drones
Drone delivery is drawing increasing attention in last-mile delivery. Effective solution methods to solve decision-making problems arising in drone delivery allow to run and assess drone delivery systems.
Sara Cavani, M. Iori, R. Roberti
semanticscholar +1 more source

