Thiago Guimaraes, Federal University of Paraná

Abstract

We propose a new branch-and-cut scheme with modular mechanisms to recover feasibility and improve even partial solutions, by reorganizing delivery routes and optimizing inventory flows. Our algorithm employs a decision tree to select either aggregated or disaggregated formulations, according to the number of periods, vehicles, and customers. Due to the hardware used, computational experiments ran up to 1620 seconds, and our method was able to find 342 optimal solutions among 1038 feasible instances solved within this time.