An GA-based Alternative Approach on the Capacitated Warehouse Allocation of Customers with Uncertain Demands
With the increasing importance of seamless supply chain integration to business success, the role of warehouses has become more of flow-through transshipment facilities intended for timely order fulfillment than inventory stocking points. The ability to serve all customers in a timely manner becomes even more important in nowadays supply chain network. One of the most effective ways of enhancing this strategic position of warehouses is to serve customers from an alternative warehouse when an assigned warehouse is due to stock outs because of the uncertain demands from customers. In this paper, we consider a capacitated warehouse allocation problem with uncertain demands. Firstly we deal with this problem via an alternative approach with a primary and a secondary warehouse for customers. Secondly this problem is formulated as an Integer Programming model and solved by using a genetic algorithm. In the GA approach, all candidate solutions are encoded as a permutation of the warehouse labels, and the evaluation of them are based on the total shipping cost of both the primary warehouses and the nearest secondary warehouses to all customers. Finally, the application of the proposed GA to a real world problem and numerical analysis show its high effectiveness and efficiency.
Supply chain network Capacitated allocation Uncertain demands Genetic algorithm.
Zhou Gengui Ye Feng Cao Jian Cao Zhengyu
College of Business Administration Zhejiang University of Technology, Hangzhou 310014, P.R.China
国际会议
第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)
武汉
英文
308-315
2007-08-03（万方平台首次上网日期，不代表论文的发表时间）