基于可信性理论的运输机会约束模型  

Transportation Chance-constrained Model Based on Credibility Theory

作　　者：吴长刚[1] 袁国强[2,3] 

机构地区：[1]河北农业大学理学院,河北保定071001 [2]河北金融学院基础部,河北保定071051 [3]河北省科技金融重点实验室,河北保定071051

出　　处：《数学的实践与认识》2011年第23期90-97,共8页Mathematics in Practice and Theory

摘　　要：基于可信性理论,将提出一类带有模糊参数的运输计划机会约束模型.然后,讨论可信性函数的逼近方法并且设计一个基于逼近方法、神经网络和遗传算法的启发式算法来求解这个模糊运输计划机会约束模型.最后,给出一个数值例子来表明所设计算法的实用性和有效性.Based on credibility theory, this paper will present a class of transportation planning chance-constrained model with fuzzy parameters. Then it deals with approxima- tion approach and designs a huristic algorithm, which combines approximation approach, nural network and genetic algorithm, to solve this fuzzy transportation planning chanceconstrained model. Finally, it gives a numerical example to show the practicality and effectiveness of the designed algorithm.

关 键 词：运输计划 可信性理论 机会约束模型 逼近方法 遗传算法 

分 类 号：U11[交通运输工程] O242.1[理学—计算数学]