| 客户订单合成配送问题建模与遗传算法研究 |
| |
| 引用本文： | 代红艳,原忠虎,恩莉. 客户订单合成配送问题建模与遗传算法研究[J]. 控制工程, 2005, 12(3): 281-284 |
| |
| 作者姓名： | 代红艳 原忠虎 恩莉 |
| |
| 作者单位： | 沈阳大学,信息科学与工程学院,辽宁,沈阳,110044;沈阳大学,信息科学与工程学院,辽宁,沈阳,110044;沈阳大学,信息科学与工程学院,辽宁,沈阳,110044 |
| |
| 基金项目： | 国家自然科学基金资助项目(60274027) |
| |
| 摘 要： | 为了降低成本，取得企业竞争优势，合理进行配送成为实现物流规模经济、降低物流成本的重要手段。在一些模型假设的基础上，建立了目标函数为最小化运距的客户订单合成配送问题的数学模型，提出并实现了解决该问题的遗传算法。大量仿真结果表明：该算法能够在较短的时间内有效求得问题的近优解，该算法的运行时间主要取决于订单数和交货组数，为实现物流配送提供了一个基本方法。
|
| 关 键 词： | 订单 合成 配送 优化 遗传算法 |
| 文章编号： | 1671-7848(2005)03-0281-04 |
| 修稿时间： | 2005-03-10 |
Mathematical Model and Genetic Algorithmof Customer Order Consolidation Delivery Problem |
| |
| DAI Hong-yan,YUAN Zhong-hu,EN Li. Mathematical Model and Genetic Algorithmof Customer Order Consolidation Delivery Problem[J]. Control Engineering of China, 2005, 12(3): 281-284 |
| |
| Authors: | DAI Hong-yan YUAN Zhong-hu EN Li |
| |
| Abstract: | 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. |
| |
| Keywords: | order consolidation delivery optimization genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
