Cargando…
Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour
Finding the shortest tour visiting all given points at least ones belongs to the most famous optimization problems until today [travelling salesman problem (TSP)]. Optimal solutions exist for many problems up to several ten thousand points. The major difficulty in solving larger problems is the requ...
Autor principal: | Strutz, Tilo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Frontiers Media S.A.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8075568/ https://www.ncbi.nlm.nih.gov/pubmed/33912597 http://dx.doi.org/10.3389/frobt.2021.652417 |
Ejemplares similares
-
Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020
por: Mariescu-Istodor, Radu, et al.
Publicado: (2021) -
Fast Joint Multi-Robot Trajectory Optimization by GPU Accelerated Batch Solution of Distributed Sub-Problems
por: Guhathakurta, Dipanwita, et al.
Publicado: (2022) -
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
por: Champagne Gareau, Jaël, et al.
Publicado: (2023) -
From Multi-Modal Property Dataset to Robot-Centric Conceptual Knowledge About Household Objects
por: Thosar, Madhura, et al.
Publicado: (2021) -
One-shot learning for autonomous aerial manipulation
por: Zito, Claudio, et al.
Publicado: (2022)