Solving knapsack problem by estimation of distribution algorithm

被引:0
|
作者
机构
[1] Gao, Shang
来源
Gao, S. (gaoshang@sohu.com) | 1600年 / Central South University of Technology卷 / 44期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Modeling and solving of knapsack problem with setup based on evolutionary algorithm
    He, Yichao
    Wang, Jinghong
    Liu, Xuejing
    Wang, Xizhao
    Ouyang, Haibin
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2024, 219 : 378 - 403
  • [22] An new algorithm of solving 0-1 knapsack problem
    Tuo Shou-Heng
    2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 1, 2011, : 543 - 546
  • [23] Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm
    Mkaouar, Arij
    Htiouech, Skander
    Chabchoub, Habib
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [24] An enhanced two phase estimation of distribution algorithm for solving scheduling problem
    Hao, Xinchang
    Tian, Jing
    Ding, Hui
    Zhao, Keheng
    Gen, Mitsuo
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2023, 18 (03) : 217 - 224
  • [25] Improved simulated annealing algorithm solving for 0/1 knapsack problem
    Liu, Aizhen
    Wang, Jiazhen
    Han, Guodong
    Wang, Suzhen
    Wen, Jiafu
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, 2006, : 1159 - +
  • [26] A surface-based DNA algorithm for the solving binary knapsack problem
    Darehmiraki, Majid
    Nehi, Hasan Mishmast
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (02) : 1991 - 1994
  • [27] Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem
    Rezoug, Abdellah
    Boughaci, Dalila
    Badr-El-Den, Mohamed
    PROGRESS IN ARTIFICIAL INTELLIGENCE-BK, 2015, 9273 : 298 - 304
  • [28] An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem
    Meng, Tao
    Pan, Quan-Ke
    APPLIED SOFT COMPUTING, 2017, 50 : 79 - 93
  • [29] Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm
    Anand J. Kulkarni
    Hinna Shabir
    International Journal of Machine Learning and Cybernetics, 2016, 7 : 427 - 441
  • [30] Improved simulated annealing algorithm solving for 0/1 knapsack problem
    Liu, Aizhen
    Gao, Xiufeng
    Wang, Jiazhen
    Wang, Feng
    Chen, Liyun
    Proceedings of 2006 International Conference on Artificial Intelligence: 50 YEARS' ACHIEVEMENTS, FUTURE DIRECTIONS AND SOCIAL IMPACTS, 2006, : 628 - 631