|
|
|
|
|
Debdatta Sinha Roy, Bruce Golden, Xingyin Wang and Edward Wasil
We construct empirically based regression models for estimating the tour length in the Close Enough Traveling Salesman Problem (CETSP). In the CETSP, a customer is considered visited when the salesman visits any point in the customer?s service region. We...
ver más
|
|
|
|
|
|
|
|
|
Víctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta and Nodari Vakhania
The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem,...
ver más
|
|
|
|
|
|
|
|
|
Uthman Baroudi, Mohammad Alshaboti, Anis Koubaa and Sahar Trigui
In this paper, we address the problem of online dynamic multi-robot task allocation (MRTA) problem. In the existing literature, several works investigated this problem as a multi-objective optimization (MOO) problem and proposed different approaches to s...
ver más
|
|
|
|
|
|
|
|
|
Jiaxu Ning, Changsheng Zhang, Peng Sun and Yunfei Feng
In recent years, when solving MOPs, especially discrete path optimization problems, MOACOs concerning other meta-heuristic algorithms have been used and improved often, and they have become a hot research topic. This article will start from the basic pro...
ver más
|
|
|
|
|
|
|
|
|
Ai-Hua Zhou, Li-Peng Zhu, Bin Hu, Song Deng, Yan Song, Hongbin Qiu and Sen Pan
The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algori...
ver más
|
|
|
|