检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东工业大学应用数学学院,广东广州510520
出 处:《广东工业大学学报》2011年第4期38-44,共7页Journal of Guangdong University of Technology
基 金:广东省自然科学基金资助项目(10251009001000002)
摘 要:在以原有的车辆配送总费用最小化为目标的基础上,兼顾顾客的满意度目标,建立带有时间窗的多物流中心协同配送的车辆路径多目标优化问题的数学模型.对建立的多目标优化问题,采用分区域多目标进化算法思想,构造了利于产生可行解的编码方式,从而提高算法的运行效率.通过算例验证了建立的模型能有效地解决协同物流配送车辆路径问题.To minimize the total cost of vehicle transport and to satisfy customers, it proposed a new mathematical model for multi-objective optimization of Multi-Depot collaborative vehicle routing with time windows in logistics. For the sake of this multi-objective optimization, a multi-objective evolutionary algorithm, based on decomposition, was adopted. In this algorithm, a new encoding method, which was beneficial to producing feasible individual, was presented. The efficiency of the algorithm was improved out. The results show that the proposed model can solve due to the perfect encoding. Finally, a test was carried effectively the problem of collaborative vehicle routing in logistics.
分 类 号:TP183[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.124