In this new article, Raquel Bernardino addresses a famous routine problem (the family capacitated vehicle routing problem) that has practical application in warehouse management in warehouses with scattered storage.
The authors present several programming formulations and establish a theoretical and empirical comparison. Their computational experiment allows to identify the challenges and limitations of the method, which the authors tested with a newly generated data set.
Finally, they develop a search algorithm to efficiently obtain feasible solutions, which proved very efficient within the set time limit.
