[HTML][HTML] Machine learning aided metaheuristics: A comprehensive review of hybrid local search methods

S Szénási, G Légrádi - Expert Systems with Applications, 2024 - Elsevier
Abstract Machine learning-based methods have emerged as competitors to traditional
metaheuristic-based solutions in many areas. Besides investigating their effectiveness, it …

A new constructive heuristic driven by machine learning for the traveling salesman problem

UJ Mele, LM Gambardella, R Montemanni - Algorithms, 2021 - mdpi.com
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem
(TSP) exhibit issues when they try to scale up to real case scenarios with several hundred …

Combining deep reinforcement learning with heuristics to solve the traveling salesman problem

L Hong, Y Liu, M Xu, W Deng - Chinese Physics B, 2025 - iopscience.iop.org
Recent studies employing deep learning to solve the traveling salesman problem (TSP)
have mainly focused on learning construction heuristics. Such methods can improve TSP …

[PDF][PDF] Robustness versus stability measures in proactive scheduling for timetabling applications

S Vergotte - 2023 - libstore.ugent.be
Writing this master dissertation was a challenging and demanding experience, one that I
couldn't have undertaken without the invaluable help of several individuals whom I would …

Using Machine Learning in Combinatorial Optimization: Extraction of Graph Features for Travelling Salesman Problem

P Stodola, R Ščurek - Available at SSRN 4892759 - papers.ssrn.com
Abstract Machine learning has emerged as a paradigmatic approach for addressing
complex problems across various scientific disciplines, including combinatorial optimization …

[引用][C] An iterated local search for the travelling salesman problem

PB Castellucci - Anais do XVIII Encontro Nacional de Inteligência …, 2021 - SBC