Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems? - IMT Mines Alès Accéder directement au contenu
Article Dans Une Revue Computing and Informatics Année : 2022

Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems?

Ali Yaddaden
Sébastien Harispe
Michel Vasquez

Résumé

Recently, combinatorial optimization problems have aroused a great deal of interest in Machine Learning, leading to interesting advances in Neural Combinatorial Optimization (NCO): the study of data-driven solvers for NP-Hard problems based on neural networks. This paper studies the benefit of Transfer Learning for NCO by evaluating how model training can be improved taking advantage of knowledge learned while solving similar tasks. We focus, in particular, on two famous routing problems: the Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP). The latter being a generalization of the former, we study the effect of applying Transfer Learning from a model trained to solve TSP while training a model learning to solve the Capacitated VRP (CVRP). We present adaptations of a state-of-the-art NCO model for implementing Transfer Learning. Our results based on extensive empirical experiments in different settings show that Transfer Learning may help to speed up the training process while being more sample efficient.
Fichier principal
Vignette du fichier
TL_TSP_VRP.pdf (516.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03717063 , version 1 (08-07-2022)

Identifiants

Citer

Ali Yaddaden, Sébastien Harispe, Michel Vasquez. Is Transfer Learning Helpful for Neural Combinatorial Optimization Applied to Vehicle Routing Problems?. Computing and Informatics, 2022, 41 (1), pp.172-190. ⟨10.31577/cai_2022_1_172⟩. ⟨hal-03717063⟩
64 Consultations
1725 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More