摘要
结合城市货物运输的具体特点及连续选址问题的复杂性,在分析城市货物换装站非约束选址问题特点的基础上,建立该问题的优化数学模型,并构造求解问题的有效遗传算法.算法中设计了基于表上作业法或单纯形法的嵌入式适应值计算方法,并采用确保浮点数编码个体有效性的遗传操作方法.实例计算表明,本文提出的模型与算法能够有效地解决城市货物换装站非约束选址问题.
Considering the characteristics of urban freight transportation and the complexity of the consecutive location selection, the non-restraint location selection problem existing in urban freight transshipping stations is analyzed, on the basis of which an optimized mathematical model to solve the problem is established and the effective genetic algorithm for the model is constructed. In this algorithm, the inlaid fitness function based on the table task or the simplex search is designed, and the genetic operational method ensuring the floating-point coding validity is adopted. Numerical calculation results indicate that the proposed model and algorithm effectively solve the non-restraint location selection problem existing in urban freight transshipping stations.
出处
《华南理工大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2005年第7期92-95,共4页
Journal of South China University of Technology(Natural Science Edition)
关键词
货物运输
换装站
非约束
选址
遗传算法
<Keyword>freight transportation
transshipping station
non-restraint
location selection
genetic algorithm