A new constructive heuristic driven by machine learning for the traveling salesman problem
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 …
(TSP) exhibit issues when they try to scale up to real case scenarios with several hundred …
Cycle mutation: Evolving permutations via cycle induction
VA Cicirello - Applied Sciences, 2022 - mdpi.com
Evolutionary algorithms solve problems by simulating the evolution of a population of
candidate solutions. We focus on evolving permutations for ordering problems such as the …
candidate solutions. We focus on evolving permutations for ordering problems such as the …
Machine learning constructives and local searches for the travelling salesman problem
T Vitali, UJ Mele, LM Gambardella… - … on Operations Research, 2021 - Springer
The ML-Constructive heuristic is a recently presented method and the first hybrid method
capable of scaling up to real scale traveling salesman problems. It combines machine …
capable of scaling up to real scale traveling salesman problems. It combines machine …
Modeling Groups of Pilotless Aircraft in Constructing the Optimal Route by Machine Learning
AA Gogolev, AP Voiskovskii - Russian Engineering Research, 2022 - Springer
A method is proposed for simulating a group of pilotless aircraft (drones), with preparation of
the initial data for machine learning algorithms and optimal route determination (the …
the initial data for machine learning algorithms and optimal route determination (the …