面向第四方物流的多代理人作业整合优化方法.docVIP

论文编号：540# 面向第四方物流的多代理人作业整合优化算法 王 勇1，吴志勇1，陈修素2, 吴金奇1 （1：重庆大学经济与工商管理学院，重庆，400044， 2：重庆工商大学数学与统计学院，重庆，400067） 摘要：物流作业整合是现代物流方法减少物流成本的主要手段。该文在综合考虑代理商选择和线路优化两问题的基础上，建立了基于图状结构的面向第四方物流的多代理人作业整合优化模型。为了避免将代理商选择和线路优化作为两个互相分离的子问题来处理，提出了求解它的两层邻域搜索算法。第一层采用了转移、交换和环形移动三种移动策略求解作业在代理商之间的分配，而在第二层提出了路合并、路生成替换策略，形成了适于该问题的优化算法。本文随机产生20例算例，将两层邻域搜索算法的计算结果与基于k-最短路的枚举算法的计算结果进行比较，说明了本算法的可行性和有效性。 关键词： 第四方物流, 多代理人, 作业整合, 邻域搜索算法 中图分类号：F224.3, O22 文献标识码：A An Optimization Algorithm of job integration of multi-agent oriented 4th party logistics Wang Yong1 Wu zhiyong1 Chen xiusu2 Wu JinQi1 (1: School of Economics and Business Administration of Chongqing University,400044, 2: School of Mathematics and statistics of Chongqing Technology and Business University, 400067) Abstract: The integration of logistics job is a main means that the modern logistics method reduces the logistics cost. In this paper, we consider the agent and road choice problems comprehensively, and build up an optimization model of job integration of multi-agent which is based on graph structure and oriented 4th party 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 merge strategy, line generation and replace strategy are used to form a suitable optimization algorithm to this problem. Twenty examples are generated randomly; to examine the feasibility and validity of two layers search algorithm, whose results are compared to that of enumerating algorithm based on k-shortest road. Key words: fourth party logistics, multi-agent, job integration, neighborhood search algorithm 1．引言 物流与供应链已成为当前管理科学的研究热点[1-2]。随着第四方物流的发展，物流作业整合已成为现代物流方法减少物流成本的主要手段。探讨第四方物流整合商如何针对多个代理商进行优化分配和对多个物流作业进行作业路线整合，已成为管理科学界十分迫切的任务。为了深入研究有效的物流整合方法，学术界已开始针对面向第四方物流的多代理人作业整合优化模型的研究。 Lau [3] 基于拟指派问题