Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadata

https://hal.mines-ales.fr/hal-03717063
Contributor : Administrateur IMT - Mines Alès Connect in order to contact the contributor
Submitted on : Friday, July 8, 2022 - 8:44:41 AM
Last modification on : Friday, August 5, 2022 - 2:44:08 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-10-29

Please log in to resquest access to the document

Identifiers

Citation

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

Share

Metrics

Record views

16