Optimising and Recognising 2-Stage Delivery Chains with Time Windows

Abstract

In logistic delivery chains time windows are common. An arrival has to be in a certain time interval, at the expense of waiting time or penalties if the time limits are exceeded. This paper looks at the optimal placement of those time intervals in a specific case of a barge visiting two ports in sequence. For the second port a possible delay or penalty should be incorporated. Next, recognising these penalty structures in data is analysed. Do certain patterns in public travel data indicate that a certain dependency is existing.