Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (34): 215-218.DOI: 10.3778/j.issn.1002-8331.2009.34.067
• 工程与应用 • Previous Articles Next Articles
XIE Tian-bao,ZHU Ning
Received:
Revised:
Online:
Published:
Contact:
谢天保,朱 宁
通讯作者:
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.
摘要: 通过分析一次完整的物流联盟企业项目型物流配送过程,提出物流联盟规划问题的两阶段解决方案。首先,针对当前大型物流配送系统的现状,采用实例化路径视图的策略,预先计算和存储可行路径,给出相应算法。其次,在信息不完备情况下,采用基于协商的Agent技术优化可行路径。实验证明:在不完全信息下,解决方案能求得在指定时间约束下的最优成本方案。
CLC Number:
TP393
XIE Tian-bao,ZHU Ning. Optimization of negotiatory logistic alliance transportation programming model[J]. Computer Engineering and Applications, 2009, 45(34): 215-218.
谢天保,朱 宁. 协商式的物流联盟运输规划模型优化研究[J]. 计算机工程与应用, 2009, 45(34): 215-218.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.34.067
http://cea.ceaj.org/EN/Y2009/V45/I34/215