Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints

Publicado en línea: 09 nov 2024

Páginas: 99 - 112

Recibido: 30 jun 2024

Aceptado: 30 ago 2024

DOI: https://doi.org/10.2478/bipie-2023-0017

Palabras clave

Travelling Salesman, optimization, ant colony, graph, time windows

© 2023 Mihaela-Alexandra Barb-Ciorbea, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.