摘要
针对公路枢纽规划,建立了一类容量受限型设施定位问题的数学模型,给出了求解该模型的遗传算法。对模型目标函数、约束条件的构成和限制进行了分析,建立了简洁、合理的关系式。站场的容量受限使得模型更能反映实际情况,优化后的总费用也比随机建站的费用大大缩减。鉴于该问题属于NP-hard问题,采用符号编码方式的遗传算法,合理体现了问题的特点并使得问题规模得到有效控制。通过某城市公路枢纽规划的实际应用,表明提出的模型和算法实用可行。
Based on the actual characteristic of highway hub plan, a mathematical model is built for solving a type of constrained facility location problem （CFLP）. Some analysis of objective function and constraint condition are performed, and some relational expressions are given. The limit of the hub capability makes the model and the optimization results reasonable. Because of the NP-hard nature of the solution space, a genetic algorithm using symbolic coding is proposed. Symbolic coding method makes the model scale decrescent and reflect its characteristics. The model is applied to a government-funded traffic project. The results indicate that this method is efficient and effective. 3 tabs, 3 figs, 8 refs.
出处
《长安大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2006年第6期65-68,共4页
Journal of Chang’an University(Natural Science Edition)
基金
国家自然科学基金项目(60134010)
关键词
交通工程
公路枢纽
设施定位
整数规划
遗传算法
traffic engineering
highway hub
facility location
integer programming
genetic algorithms
