Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning
In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniques can be used to improve the quality of the...
Main Authors: | Gianpaolo Ghiani, Tommaso Adamo, Pierpaolo Greco, Emanuela Guerriero |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-12-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/12/340 |
Similar Items
-
Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem
by: Tommaso Adamo, et al.
Published: (2023-01-01) -
Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem
by: Ruba S. Almahasneh, et al.
Published: (2020-10-01) -
An analysis of several heuristics for the traveling salesman problems /
by: 428771 Rosenkrants, Daniel J., et al. -
Solving the clustered traveling salesman problem via traveling salesman problem methods
by: Yongliang Lu, et al.
Published: (2022-06-01) -
Study on genetic algorithm and heuristic method for solving traveling salesman problem /
by: 443801 Sze, San Nah
Published: (2004)