客户订单合成配送问题建模与遗传算法研究  

Mathematical Model and Genetic Algorithm of Customer Order Consolidation Delivery Problem

作　　者：代红艳[1] 原忠虎[1] 恩莉[1] 

机构地区：[1]沈阳大学信息科学与工程学院,辽宁沈阳110044

出　　处：《控制工程》2005年第3期281-284,共4页Control Engineering of China

基　　金：国家自然科学基金资助项目(60274027)

摘　　要：为了降低成本,取得企业竞争优势,合理进行配送成为实现物流规模经济、降低物流成本的重要手段。在一些模型假设的基础上,建立了目标函数为最小化运距的客户订单合成配送问题的数学模型,提出并实现了解决该问题的遗传算法。大量仿真结果表明:该算法能够在较短的时间内有效求得问题的近优解,该算法的运行时间主要取决于订单数和交货组数,为实现物流配送提供了一个基本方法。Modern flow material is the important source for corporation to reduce cost and obtain competitive advantage. A mathematical model of customer order consolidation delivery problem is introduced based on some model hypothesis,in which the objective is to minimize the transportation distance. A genetic algorithm is proposed to solve this problem. Experimental results show that this algorithm can obtain effectively nearly optimization solution to customer order consolidation delivery problem in short time. The running time is decided by order quantity and delivery groups, and it provides a basic method for realizing the automation of material flow delivery.

关 键 词：算法研究 合成 订单 客户 建模 降低成本 竞争优势 规模经济 物流成本 模型假设 数学模型 目标函数 遗传算法 仿真结果 运行时间 物流配送 最小化 企业 

分 类 号：F416.474[经济管理—产业经济] O121.5[理学—数学]