Vehicle Routing Problem with Uncertain Demands

• 作 者: LixiaRong;YufuNing;
• 机 构: Computer Science and Technology Department,Dezhou University,Shandong Dezhou 253023,China
• 出 处: 第十届中国不确定系统年会、第十四届中国青年信息与管理学者大会
• 发表日期: 2012年期

　　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.