An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles
针对多供应商多车辆路径的动态需求联合补货问题，建立混合整数规划模型，并用粒子群优化算法求解大规模算例，以触控面板制造商案例验证实用性。
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.