摘要
基于可信性理论,将提出一类带有模糊参数的运输计划机会约束模型.然后,讨论可信性函数的逼近方法并且设计一个基于逼近方法、神经网络和遗传算法的启发式算法来求解这个模糊运输计划机会约束模型.最后,给出一个数值例子来表明所设计算法的实用性和有效性.
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.
出处
《数学的实践与认识》
CSCD
北大核心
2011年第23期90-97,共8页
Mathematics in Practice and Theory
关键词
运输计划
可信性理论
机会约束模型
逼近方法
遗传算法
transportation planning
credibility theory
chance-constrained model
approx-imation approach
genetic algorithm