Optimising and Recognising 2-Stage Delivery Chains with Time Windows
conference paper
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 to see if certain patters in public travel data indicate that a certain dependency exists.
TNO Identifier
782190
Source title
8th International Conference on Computational Logistics, Southampton, United Kingdom, 2017.
Files
To receive the publication files, please send an e-mail request to TNO Repository.