首页 | 本学科首页   官方微博 | 高级检索  
     

序列多指派问题的优化模型及其遗传算法
引用本文:鄢东姝.序列多指派问题的优化模型及其遗传算法[J].吉林建筑工程学院学报,2008,25(4):99-102.
作者姓名:鄢东姝
作者单位:吉林建筑工程学院基础科学部,长春,130021
摘    要:序列多指派问题是经济管理中提出的新问题.笔者首先给出该问题的组合优化模型。然后引入该模型的两个改进方案。并将模型简化为仅含T个线性约束的0—1规划问题.传统优化方法难于求解该问题。因而笔者给出针对该问题的遗传算法.数值结果表明,我们提出的优化模型和遗传算法对求解序列多指派问题是切实有效的.

关 键 词:整数规划  遗传算法  序列多指派  启发武

An Optimization Model of Sequential Multi - Assignment Problem and Its Genetic Algorithm
YAN Dong-shu.An Optimization Model of Sequential Multi - Assignment Problem and Its Genetic Algorithm[J].Journal of Jilin Architectural and Civil Engineering,2008,25(4):99-102.
Authors:YAN Dong-shu
Affiliation:YAN Dong-shu ( Department of Basic Science, Jilin Architectural and Civil Engineering Institute, Changchun 130021 )
Abstract:Sequential multi-assignment is a new problem arising from economic management.We first provide a combinatorial optimization model for it.Then we suggest two modifications to reduce the model to 0-1 integer programming with T linear constraints.It is hard for traditional optimization method to solve this problem.Therefore,we provide a problem-specific genetic algorithm for it.Numerical results show that our optimization model and genetic algorithm is effective for sequential multi-assignment problem.
Keywords:integer programming  genetic algorithm  sequential multi-assignment  heuristics
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号