多配送中心车辆调度问题的DNA计算模型

殷脂; 温蜜

###

DOI:10.3969/j.issn.1006-4729.2014.02.018

上海电力大学学报:2014,30(2):181-184,187

查看/发表评论过刊浏览高级检索 HTML

←前一篇 | 后一篇→

码上扫一扫！

下载全文

多配送中心车辆调度问题的DNA计算模型

殷脂, 温蜜

(上海电力学院计算机科学与技术学院)

Study on the Hierarchical Model for Multi-depot Logistic Vehicle Scheduling Problem

YIN Zhi, WEN Mi

(School of Computer Science and Technology, Shanghai University of Electric Power, Shanghai 200090, China)

摘要

图/表

参考文献

本刊相似文献

All Journals 相似文献

All Journals 引证文献

本文已被：浏览 1045次下载 505次
投稿时间：2013-09-22

中文摘要: 提出了采用聚类分析最短距离分配法将多配送中心车辆调度问题动态地分解为多个单配送中心车辆调度问题进行求解的策略,并设计了求解单配送中心车辆调度问题的DNA计算模型,实现了使用常规的生物分离方法进行最优路径的选择.

中文关键词: DNA计算多配送中心车辆调度问题聚类分析

Abstract:Via shortest distance attribute based cluster analysis,the multi-depot vehicle scheduling problem is broken down into multiple single-depot vehicle scheduling problems.Single-depot vehicle scheduling problems of DNA computing model is designed.DNA sequence is used to represent weight effectively,in order to use the conventional biological separation methods to choose the optimal path.

keywords: DNA sequence multi-depot logistic vehicle scheduling problem cluster analysis

文章编号：20140218 中图分类号： 文献标志码：

基金项目:

作者	单位	E-mail
殷脂	上海电力学院计算机科学与技术学院	yzzhizhi@163.com
温蜜	上海电力学院计算机科学与技术学院

Author Name	Affiliation	E-mail
YIN Zhi	School of Computer Science and Technology, Shanghai University of Electric Power, Shanghai 200090, China	yzzhizhi@163.com
WEN Mi	School of Computer Science and Technology, Shanghai University of Electric Power, Shanghai 200090, China

引用文本：
殷脂,温蜜.多配送中心车辆调度问题的DNA计算模型[J].上海电力大学学报,2014,30(2):181-184,187.
YIN Zhi,WEN Mi.Study on the Hierarchical Model for Multi-depot Logistic Vehicle Scheduling Problem[J].Journal of Shanghai University of Electric Power,2014,30(2):181-184,187.