Logo image
An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles
Journal article

An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles

He-Yau Kang, Amy H.I. Lee, Chien-Wei Wu and Cheng-Han Lee
International Journal of Production Research, pp.1-20
07/08/2016

Abstract

dynamic-demand joint replenishment problem (DJRP) mixed integer programming (MIP) multiple suppliers multiple vehicles particle swarm optimisation (PSO)
How to improve competitive edges to meet rapidly changing market environment and dynamic customer needs is critical for the survival and success of firms these days. A good supply chain and inventory management is a necessity in the intensive competitive market. This paper considers a dynamic-demand joint replenishment problem with multiple vehicle routing. The problem is first formulated as a mixed integer programming model with an objective to minimise total costs, which include ordering cost, purchase cost, production cost, transportation cost and holding cost, under a prerequisite that inventory shortage is prohibited in the system. A particle swarm optimisation model is proposed next to solve large-scale problems which are computationally difficult. A case study of a touch panel manufacturer is presented to examine the practicality of the models.

Metrics

1 Record Views

Details

Logo image