摘要
车辆路径问题是现代物流配送管理的一项重要内容,运输路径的合理选取,可以加快企业对客户需求的响应速度,提高服务质量,降低运营成本。本文在综合考虑企业运输成本最小化和客户满意度最大化的基础上,针对不确定配送时间的随机车辆路径问题,建立随机机会规划模型。最后通过实例对模型求解,结果表明该算法能取得更好的优化结果和更快的收敛速度。
Vehicle routing problem（VRP）is an important content of modem logistics and distribution management. choosing the proper distribution route would be accelerating the response speed of customer demand, improving the service quality and reducing the services of the operation cost.This paper based on various factors of enterprise distribution cost minimization and customer satisfaction maximization,To studay stochastic vehicle routing problems with uncertain travel time,a stochastic programming model was formulated.Result demonstrated that the proposed algorith obtained betterresults with hiher converfrence gneed
出处
《信息技术与信息化》
2013年第5期117-121,共5页
Information Technology and Informatization
基金
甘肃省自然科学基金(1010RJZA074)
甘肃省高等学校基本科研业务项目(甘财教[2011]181)
关键词
随机配送时间
遗传算法
机会约束模型
Random delivery time Genetic algorithms Chance-constrained programming model
