A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design

Abstract

Scheduled Service Network Design supports consolidation-based freight carriers in setting up a transportation network by selecting the transportation services to operate, with their schedules, and the itineraries of the commodities to move. We propose a new formulation to the problem that represents time in its continuous nature, directly over the physical graph, thus mitigating the drawbacks that a traditional formulation, relying on a time-space network, may have for large scale instances, due to the increase in its dimensions and the consequent intractability in solving the problem exactly. Preliminary numerical experiments comparing the new and traditional formulations on a set of randomly generated instances are performed. Results highlight that the proposed formulation is a valuable tool to solve large scale instances with a long schedule length.