节点文献

面向第4方物流的多代理人作业整合优化算法

Optimization algorithm for multi-agent job integration for fourth-party-oriented logistics

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王勇吴志勇陈修素吴金奇

【Author】 WANG Yong1,WU Zhi-yong1,CHEN Xiu-su2,WU Jin-qi1 1.School of Economics and Business Administration of Chongqing University,Chongqing 400044,China;2.School of Mathematics and statistics of Chongqing Technology and Business University,Chongqing 400067,China

【机构】 重庆大学经济与工商管理学院重庆工商大学数学与统计学院

【摘要】 物流作业整合是现代物流方法中减少物流成本的主要手段.在综合考虑代理商选择和线路优化两问题的基础上,建立了基于图状结构的面向第4方物流的多代理人作业整合优化模型.为了避免将代理商选择和线路优化作为两个互相分离的子问题来处理,提出了求解它的两层邻域搜索算法.第1层采用了转移、交换和环形移动3种移动策略求解作业在代理商之间的分配,而在第2层提出了路合并、路生成替换策略,形成了适于该问题的优化算法.随机产生20例算例,将两层邻域搜索算法的计算结果与基于k-最短路的枚举算法的计算结果进行比较,说明了该算法的可行性和有效性.

【Abstract】 The integration of logistics job is a main method to reduces the logistics cost.In this paper,we consider the agent and road choice problems comprehensively,and then set up an multi-agent optimization model for job integration based on graph structure and fourth-party-oriented logistics.We propose a two layers neighborhood search algorithm to avoid the separation between agent choices and road optimization.In the first layer,shift move and swap move and loop move are used to assign jobs to agents;in the second layer,the line merging strategy,line generation and replacing strategy are used to form a suitable optimization algorithm for this problem.Twenty examples are generated randomly;to examine the feasibility and validity of the two-layers search algorithm,whose results are compared to that of enumerating algorithm based on the k-shortest road.

【基金】 国家自然科学基金资助项目(70572028,70872123)
  • 【文献出处】 管理科学学报 ,Journal of Management Sciences in China , 编辑部邮箱 ,2009年02期
  • 【分类号】F224;F252
  • 【被引频次】51
  • 【下载频次】831
节点文献中: 

本文链接的文献网络图示:

本文的引文网络