Abstract
In this paper, we consider a real-life vehicle routeing problem that occurs in a major Swiss company producing pet food and flour. In contrast with usual hypothetical problems, a large variety of restrictions has to be considered. The main constraints are relative to the accessibility and the time windows at customers, the carrying capacities of vehicles, the total duration of routes and the drivers' breaks. To find good solutions to this problem, we propose two heuristic methods: a fast straightforward insertion procedure and a method based on tabu search techniques. Next, the produced solutions are compared with the routes actually covered by the company. Our outcomes indicate that the total distance travelled can be reduced significantly when such methods are used.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rochat, Y., Semet, F. A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland. J Oper Res Soc 45, 1233–1246 (1994). https://doi.org/10.1057/jors.1994.197
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1994.197