Title
Optimising and Recognising 2-Stage Delivery Chains with Time Windows
Author
Frank Phillipson, F.
Ortega del Vecchyo, M.
van Ginkel, B.
Huizing, S.
Sangers, A.
Publication year
2017
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 to see if certain patters in public travel data indicate that a certain dependency exists.
Subject
2016 ICT
CSR - Cyber Security & Robustness
TS - Technical Sciences
Infostructures
Logistics
Information Society
Logistics
Computation models
2-Stage Delivery
Data analysis
To reference this document use:
http://resolver.tudelft.nl/uuid:32456c1a-ef57-48a7-847e-edf6ee2c7f81
TNO identifier
782190
Source
8th International Conference on Computational Logistics, Southampton, United Kingdom, 2017.
Document type
conference paper