In this new article, Raquel Bernardino addresses a famous routing problem (the family capacitated vehicle routing problem) with practical application in warehouse management in warehouses with scattered storage.
The authors present several mixed-integer linear programming formulations and establish a theoretical and empirical comparison among them. Their computational experiment, which they tested with a newly generated data set, allows them to identify the method’s challenges and limitations.
Finally, they developed an iterated local search algorithm to efficiently obtain feasible solutions, which proved more effective than the formulations within the set time limit.
