Heuristic approaches for determining minimum cost delivery quantities in supply chains Online publication date: Thu, 22-May-2008
by Alexander Hornung, Lars Monch
European J. of Industrial Engineering (EJIE), Vol. 2, No. 4, 2008
Abstract: In this paper, we consider heuristic approaches for the determination of delivery quantities in a Supply Chain (SC). The problem under consideration is important for the design of delivery quantity negotiations between manufacturers and suppliers. We describe a Mixed Integer Programming (MIP) formulation for the optimisation problem to be solved. We explain how we can incorporate and use the suggested decision model into a decision-support system for Supply Chain Management (SCM). Because of the computational intractable large-sized mixed integer programs, we describe an efficient Genetic Algorithm (GA) in order to get near-to-optimal solutions of the mixed integer programs. We compare the GA with a Random Search Heuristic and a Branch and Bound (B&B) algorithm to solve the mixed integer programs. The different solution procedures are assessed with respect to solution quality and computational time based on stochastically generated test instances. The GA produces high-quality solutions with an acceptable computational effort. [Received 20 December 2006; Revised 01 June 2007; Second Revision Received 06 October 2007; Accepted 06 December 2007]
Online publication date: Thu, 22-May-2008
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com