用禁忌算法求解第四方物流作业整合优化模型  

Tabu search algorithm for optimization model of integration of job of 4th party logistics

作　　者：王勇[1] 赵骅[1] 李勇[1] 

机构地区：[1]重庆大学经济与工商管理学院,重庆400044

出　　处：《系统工程学报》2006年第2期143-149,共7页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(70572028);教育部人文社科规划基金资助项目(05JA630063);重庆市自然科学基金资助项目(2004BB2180)

摘　　要：建立了考虑时间和风险因素约束的面向第四方物流的物流平台作业整合优化模型,在研究基本变量邻域、作业步邻域、批量整合邻域和柔性禁忌策略的基础上,建立了求解该模型的柔性禁忌算法.本文随机产生20例算例,将禁忌算法的计算结果与分枝定界法的计算结果进行比较,说明了本算法的可行性.In this paper optimigation an model for the integration of logistics tasks oriented 4th party logistics with time requirements and risk limits. After defining the neighbourhood of basic variable, integration and consolidation, and studying the tacitics of flexible tabu search, a tabu search algorithm for model of integration of logistics is established. This paper randomly generated 20 examples, and compared the computing results of the tabu search algorithm and the branch and bound algorithm, which shows the workable of the tabu search algorithm.

关 键 词：第四方物流 物流作业 多代理人 作业整合 禁忌搜索算法 

分 类 号：F572[经济管理—产业经济]