Cargando…
Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020
The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solve a TSP problem instance that is larger than 1 M n...
Autores principales: | Mariescu-Istodor, Radu, Fränti, Pasi |
---|---|
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/PMC8520904/ https://www.ncbi.nlm.nih.gov/pubmed/34671647 http://dx.doi.org/10.3389/frobt.2021.689908 |
Ejemplares similares
-
Planning Your Route: Where to Start?
por: Sengupta, Lahari, et al.
Publicado: (2018) -
Travelling Santa Problem: Optimization of a Million-Households Tour Within One Hour
por: Strutz, Tilo
Publicado: (2021) -
Can we optimize locations of hospitals by minimizing the number of patients at risk?
por: Fränti, Pasi, et al.
Publicado: (2023) -
Feature Guided Search for Creative Problem Solving Through Tool Construction
por: Nair, Lakshmi, et al.
Publicado: (2020) -
Solving Gravity Anomaly Matching Problem Under Large Initial Errors in Gravity Aided Navigation by Using an Affine Transformation Based Artificial Bee Colony Algorithm
por: Dai, Tian, et al.
Publicado: (2019)