首页 | 本学科首页   官方微博 | 高级检索  
     

带时间要求的物流作业集成优化分配方法
引用本文:王勇,梁志坚,许溢宏. 带时间要求的物流作业集成优化分配方法[J]. 系统工程学报, 2004, 19(2): 154-160
作者姓名:王勇  梁志坚  许溢宏
作者单位:1. 重庆大学经济与工商管理学院,重庆,400044
2. 香港中文大学,香港
3. 香港城市大学,香港
基金项目:重庆市软科学研究资助项目(7754),重庆市渝中区科技计划基金资助项目(2003-14).
摘    要:作业集成机制是物流中心降低运行成本的核心手段,论文基于活动集成和批量集成的概念,吸收置信区间的思想,建立带时间要求的物流中心作业集成优化分配模型,研究了模型变形、分解和利于作业集成的选择变量置换的试探途径,提出了获得模型初始可行解和优化分配方案的启发式方法,提出了模型分枝定界过程的若干性质和减枝规则,形成了适于模型的分枝定界法,数值计算结果证明了算法的有效性。

关 键 词:物流中心 物流作业 集成优化分配方法 时间约柬
文章编号:1000-5781(2004)02-0154-07

Assignment optimization method for integration and consolidation of logistics tasks with time requirement
WANG Yong,Lawrence C.Leung,Yer Van Hui. Assignment optimization method for integration and consolidation of logistics tasks with time requirement[J]. Journal of Systems Engineering, 2004, 19(2): 154-160
Authors:WANG Yong  Lawrence C.Leung  Yer Van Hui
Affiliation:WANG Yong~1,Lawrence C.Leung~2,Yer Van Hui~3
Abstract:The mechanism integrating logistics tasks is the core way for decreasing costs of the logistics centers. Based on the concept of integration and consolidation and the idea of the cofidence interval, this paper develops an assignment model for the integration and consolidation of logistics tasks with time requirement. The paper studies the variant and the decomposition of model, suggests an exchange way for choiced variables to get more degree of integration and consolidation, and presents a method of obtaining initial feasible solution and heuristic algorithm for optimization solution. This paper investigates some properties and rules for fathoming branches and proposes a special branch and bound method for this model. Computational results show that these algorithms are effective.
Keywords:logistics tasks  integration  time constraint  heuristics algorithm  fathom rules
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号