A meta-heuristic algorithm for the efficient distribution of perishable foods

A fast and robust algorithm for solving the fresh milk distribution problem for one of the biggest diary companies in Greece was developed. This parti cular problem was formulated as a Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) for which, due to its high computational complexity, no e xact algorithm ever has been used to solve it. In this study, a threshold-a ccepting based algorithm was developed aiming to satisfy the needs of the c ompany that plans to use this methodology repeatedly to schedule their dist ribution many times a week. For this purpose. the proposed formulation was implemented in an efficient and reliable computer code. The algorithm manag es to provide practical solutions and the early findings indicate considera ble improvements in the operational performance of the company. (C) 2001 El sevier Science Ltd. All rights reserved.