A heuristic algorithm for the capacitated multiple supplier inventory grouping problem

A heuristic algorithm for the capacitated multiple supplier inventory grouping problem

0.00 Avg rating0 Votes
Article ID: iaor20083790
Country: United States
Volume: 27
Issue: 4
Start Page Number: 711
End Page Number: 733
Publication Date: Sep 1996
Journal: Decision Sciences
Authors: ,
Keywords: inventory, programming: integer
Abstract:

This paper presents and solves a model for the multiple supplier inventory grouping problem, which involves the minimization of logistics costs for a firm that has multiple suppliers with capacity limitations. The costs included in the model are purchasing, transportation, ordering, and inventory holding, while the firm's objective is to determine the optimal flows and groups of commodities from each supplier. We present an algorithm, which combines subgradient optimization and a primal heuristic, to quickly solve the multiple supplier inventory grouping problem. Our algorithm is tested extensively on problems of various sizes and structures, and its performance is compared to that of OSL, a state-of-the-art integer programming code. The computational results indicate that our approach is extremely efficient for solving the multiple supplier inventory grouping problem.

Reviews

Required fields are marked *. Your email address will not be published.