Cargando…
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm
We studied two problems called the Traveling Repairman Problem (TRPTW) and Traveling Salesman Problem (TSPTW) with time windows. The TRPTW wants to minimize the sum of travel durations between a depot and customer locations, while the TSPTW aims to minimize the total time to visit all customers. In...
Autores principales: | Ban, Ha-Bang, Pham, Dang-Hai |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280250/ https://www.ncbi.nlm.nih.gov/pubmed/37346673 http://dx.doi.org/10.7717/peerj-cs.1192 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
por: Hao, Tan, et al.
Publicado: (2023) -
A novel approach for solving travelling thief problem using enhanced simulated annealing
por: Ali, Hamid, et al.
Publicado: (2021) -
A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems
por: Li, Xia, et al.
Publicado: (2022) -
A new optimization algorithm based on average and subtraction of the best and worst members of the population for solving various optimization problems
por: Dehghani, Mohammad, et al.
Publicado: (2022)