Learning Dominant States in Elementary Resource Constrained Shortest Path Problems

TL;DR

This paper explores using machine learning to identify promising states in dynamic programming for resource-constrained shortest path problems, improving efficiency through pattern recognition.

Contribution

It introduces a novel approach to distinguish dominating states in ERCSPP using supervised learning on large datasets of generated labels.

Findings

Effective identification of dominating states within the same instance.

Strong results on dataset G demonstrating the approach's potential.

Variable performance on unseen instances, indicating room for generalization improvements.

Abstract

In this work, we investigate whether machine learning can be leveraged to identify promising states in dynamic programming algorithms, focusing on Elementary Resource Constrained Shortest Path Problems (ERCSPP). More in detail, we solved 41 single resource instances from SPPRCLIB using iterative relaxation techniques through the PathWyse library, systematically collecting all generated states (i.e. labels). We designed ad-hoc features computable in constant time and constructed two datasets: one containing all generated labels (G) and another with only those inserted into data pools (I), totaling several hundred million labels. Machine learning tools are then employed to explore these datasets, revealing significant patterns between successive relaxations. Leveraging these insights, we propose a normalization approach and apply supervised learning techniques to distinguish dominating states, both within subsequent relaxations of the same problem and in previously unseen instances. Our results demonstrate the effectiveness of this approach on Dataset G, while for Dataset I, performance varies, showing strong results within the same instance but declining for unseen ones. Overall, these findings open new perspectives for the development of data-driven dynamic programming algorithms.