检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用研究》2009年第6期2070-2073,2078,共5页Application Research of Computers
基 金:国家自然科学基金资助项目(70271022);高等学校博士学科专项科研基金资助项目(20030613016)
摘 要:针对在现有邮路运输的基础上加载一体化物流项目后的邮政物流车辆调度与路径选择优化问题,建立了基于硬时间窗、车辆混合搭载、往返归集的多目标邮政物流车辆路径问题数学模型,以四川邮政雅芳一体化混合物流2008年5月的数据为例,利用自适应的多态蚁群算法对带时间约束多目标混合邮政物流VRP进行了求解。结果表明多态蚁群算法可以求解多目标邮政物流VRP,能提高收敛速度和寻优性能。According to the post logistic vehicle scheduling and routing optimization problem on basis of the post transportation as well as the integration post logistical project, established the model of multi-objective post logistics VRP on basis of the hard time windows, mixed loading, and round-trip collection. Used the adaptive polymorphic ant colony algorithm to solve the multiobjective post logistic VRPTW, by which took YaFang integrated post with logistics services in May 2008 by Sichuan post as an example. The results demonstrate that PACA can solve the multi-objective post logistics VRP, and also improve the astringency velocity and the optimizing property.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229