LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo from wikipedia

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… Click to show full abstract

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.

Keywords: replenishment problem; joint replenishment; demand joint; cost; dynamic demand; problem

Journal Title: International Journal of Production Research
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.