计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (34): 215-218.DOI: 10.3778/j.issn.1002-8331.2009.34.067

• 工程与应用 • 上一篇    下一篇

协商式的物流联盟运输规划模型优化研究

谢天保,朱 宁   

  1. 西安理工大学 管理学院,西安 710054
  • 收稿日期:2008-07-03 修回日期:2008-10-20 出版日期:2009-12-01 发布日期:2009-12-01
  • 通讯作者: 谢天保

Optimization of negotiatory logistic alliance transportation programming model

XIE Tian-bao,ZHU Ning   

  1. Faculty of Business Administrator,Xi’an University of Technology,Xi’an 710054,China
  • Received:2008-07-03 Revised:2008-10-20 Online:2009-12-01 Published:2009-12-01
  • Contact: XIE Tian-bao

摘要: 通过分析一次完整的物流联盟企业项目型物流配送过程,提出物流联盟规划问题的两阶段解决方案。首先,针对当前大型物流配送系统的现状,采用实例化路径视图的策略,预先计算和存储可行路径,给出相应算法。其次,在信息不完备情况下,采用基于协商的Agent技术优化可行路径。实验证明:在不完全信息下,解决方案能求得在指定时间约束下的最优成本方案。

Abstract: The paper provides logistics alliance two-stage solution for logistics programming model through analysis of a whole project-based logistics delivery process.Firstly,path materialization strategy for pre-computing and store available paths is employed,a useful algorithm method for current large-scale logistics delivery context is proposed.Secondly,negotiation-based agent technology in imperfect information situation is used.Experiment shows that this solution can reach lowest cost under specified time limitation in imperfect information situation.

中图分类号: