基于遗传算法的具有主次仓库的调度问题优化研究  

Genetic algorithm-based further approach on an attemper problem with primary and secondary warehouses

作　　者：李修飞[1] 曹振宇[1] 周根贵[1] 

机构地区：[1]浙江工业大学经贸学院,浙江杭州310032

出　　处：《浙江工业大学学报》2004年第2期198-202,共5页Journal of Zhejiang University of Technology

摘　　要：在当今以客户为中心的供应链中,及时的确定分配方案已成为物流管理的一个重要部分,经典的配送系统大多运用单一分配规则,这一规则假设客户所需商品由与其最近的某一仓库提供[1]。文章在分析和总结相关文献的基础上,研究如何在有容量限制的主次仓库间分配客户需求的供应链管理问题,当主仓库不能满足客户需求时,通过一个次仓库弥补主仓库的不足。首先,把该问题构造成一个整数规划模型,其次,运用遗传算法加以解决,算法应用和检验说明了该遗传算法在解决这类问题中的有效性和实用性,在实际的供应链网络设计中有着广泛的应用前景和实际意义。Nowadays in the inside supply chain which regards the customer as the center, the determination of the allocation plan has become an important part of logistics. the classical transfer systems mostly use the single allocation rule. This rule gives an assumption that the merchandise the customer needs is supplied by another warehouse which is nearest to the customer. In this paper, we consider a supply chain management problem of allocating customer demands to primary and secondary warehouses with capacity restrictions on the basis of analyzing and summarizing the correlation literature. This problem is formulated as an Integer-programming model and solved by using genetic algorithms. The application of this calculation method and its examination show the effectiveness and practicality of the proposed method in dealing with such problems.It has broad application prospects and is of practical significance in the network design of real supply chains.

关 键 词：遗传算法 供应链管理 分配问题 仓库 物流管理 

分 类 号：F252[经济管理—国民经济]