Vehicle Routing Problem with Uncertain Demands

摘要：

　　This paper provides the chanceconstrained programming model of vehicle routing problem with uncertain demands.In the model, the demands of customers are assumed uncertainty variables, the object is to minimize the total travel distance.Taking the advantage of uncertainty theory, the model can be solved by hybrid intelligent algorithm.At last, to illustrate the effective of the model and algorithm, a numerical example is provided.

关键词： Uncertain variable Chance-constrained programming Vehicle routing problem Hybrid intelligent algorithm

作者: Lixia Rong Yufu Ning

作者单位: Computer Science and Technology Department,Dezhou University,Shandong Dezhou 253023,China

会议类型: 国内会议

会议名称: 第十届中国不确定系统年会、第十四届中国青年信息与管理学者大会

会议地点: 银川

会议语种:英文

页码: 273-277

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）