基于改进贪婪策略遗传算法0/1背包问题求解  

Solving 0/1 Knapsack Problems with Genetic Algorithm Based on Improvement of Greedy Strategy

作　　者：郝斌斌 孙玮玮[1] 李康[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《交通科技与经济》2015年第1期1-4,共4页Technology & Economy in Areas of Communications

基　　金：国家自然科学基金资助项目(61463026);教育部博士点基金资助项目(20136204120007);甘肃省自然科学基金资助项目(1308RJZA128);甘肃省高校基本科研业务费资助项目(212092-1)

摘　　要：在交通运输领域,背包问题有着广泛的应用。分析背包问题的特点,改进贪婪策略在遗传算法中初始种群的选择方法,将这种方法与自适应遗传算法相结合。实验结果表明:算法在求解速度和求解质量都有明显提高。该方法可为货物装载、运输等问题提供理论依据。In the field of transportation ,the knapsack problem has a wide range of applications .Considering the characteristics of knapsack problem ,there proposes improvement of greedy strategy in the selection of initial population in genetic algorithm ,combining this method with adaptive genetic algorithm .The experimental results show that this algorithm in solving efficiency and quality are improved obviously .The method for goods loading ,transportation problem provides a theoretical basis .

关 键 词：0/1背包 交通运输 贪婪策略 遗传算法 

分 类 号：U116[交通运输工程]