This paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and multiple separation heuristics are presented. In our numerical experiments the branch-and-cut algorithm is 3.8 times faster when separating precedence inequalities. Furthermore, in our experiments, the branch-and-cut algorithm is 193.9 times faster than the best known algorithm in the literature. Finally, using our algorithm, instances of the TWAVRP are solved which are larger than the instances previously presented in the literature.

Additional Metadata
Keywords Precedence inequalities, Time window assignment, Vehicle Routing
Persistent URL dx.doi.org/10.1016/j.cor.2017.08.015, hdl.handle.net/1765/101837
Journal Computers & Operations Research
Citation
Dalmeijer, K, & Spliet, R. (2017). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem. Computers & Operations Research, 89, 140–152. doi:10.1016/j.cor.2017.08.015