首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有时间窗车辆调度问题优化研究
引用本文:任春玉,韦超.有时间窗车辆调度问题优化研究[J].哈尔滨商业大学学报(自然科学版),2007,23(2):209-211.
作者姓名:任春玉  韦超
作者单位:黑龙江大学,信息科学与技术学院,哈尔滨,150080
基金项目:黑龙江省科技攻关项目(GB05D202-3)
摘    要:电子商务物流企业将面临的是多批次、小批量、时间要求高、需求个性化的现代化市场.此时,配送车辆类型的选择、运输时间考虑、人员和车辆日常使用费用和加班费用、配送成本与配送线路选择,这些与传统的车辆调度有很大的差别,而且关系复杂、难以精确估算.因此,考虑电子商务环境下的物流配送特殊性,将传统车辆调度模型进行修改,为降低配送成本,将目标函数改为基于费用最小,即考虑到正常和加班的车辆行驶费用、车辆等待费用和人员费用等,同时,为提高配送服务质量和提高市场竞争力,将时间窗设为硬时间窗.由于车辆调度问题是NP难问题,采用改进遗传算法进行优化求解.

关 键 词:电子商务  物流配送  有时间窗车辆调度问题  改进遗传算法
文章编号:1672-0946(2007)02-0209-03
收稿时间:2006-04-22
修稿时间:2006-04-22

Research on vehicle routing problem with time windows of optimization for electronic commerce
REN Chun-yu,WEI Chao.Research on vehicle routing problem with time windows of optimization for electronic commerce[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2007,23(2):209-211.
Authors:REN Chun-yu  WEI Chao
Institution:School of Information Science and Technology, Heilongjiang University, Harbin 150080, China
Abstract:Logistics company of electronic commerce will face with modern market of multiple batches,small volume,high time requirement and individuation demand.There are big differences from traditional vehicle scheduling in selecting distribution vehicle types,considering transportation time,routine personnel and vehicle utilizing expense,overtime expense,selecting distribution cost and route.Considering the specialties of logistics distribution under electronic commerce,the traditional vehicle scheduling model is modified in order to reduce the distribution cost,objective function is modified based on minimum expense,namely,considering routine and overtime expense,vehicle waiting expense,personnel expenses and so on.At the same time,in order to improve the distribution service quality and market competition,time windows is set to hard time window.For vehicle scheduling problem is NP puzzle,get the optimization solution through adopting improved genetic algorithm.
Keywords:electronic commerce  logistics distribution  vehicle routing problem with windows  improved genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号