Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints

Abstract

In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC). We consider two integer programming formulations which exploit the characteristics of the time-dependent travel time function. Two exact algorithms based on these formulations are developed and evaluated on benchmark instances from the literature. Preliminary experiments show that the approach has potential to be used within a Branch and Price algorithm.