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 small scale instances previously presented in the literature.

Additional Metadata
Keywords Vehicle Routing, Time Window Assignment, Precedence Inequalities, 90B06 (Transportation), 90C11 (Mixed integer programming), 90C57 (Branch-and-cut)
Persistent URL hdl.handle.net/1765/97802
Series Econometric Institute Research Papers
Citation
Dalmeijer, K, & Spliet, R. (2016). A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (No. EI2016-39). Econometric Institute Research Papers. Retrieved from http://hdl.handle.net/1765/97802