Related references
Note: Only part of the references are listed.A biased genetic algorithm hybridized with VNS for the two-dimensional knapsack packing problem with defects
Qiang Luo et al.
APPLIED SOFT COMPUTING (2022)
Binary salp swarm algorithm for discounted {0-1} knapsack problem
Binh Thanh Dang et al.
PLOS ONE (2022)
Group theory-based optimization algorithm for solving knapsack problems
Yichao He et al.
KNOWLEDGE-BASED SYSTEMS (2021)
Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems
Ran Wang et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2021)
A New Moth-Flame Optimization Algorithm for Discounted {0-1} Knapsack Problem
Tung Khac Truong
MATHEMATICAL PROBLEMS IN ENGINEERING (2021)
Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem
Tung Khac Truong
MATHEMATICAL PROBLEMS IN ENGINEERING (2021)
Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm
Congcong Wu et al.
APPLIED INTELLIGENCE (2020)
Monarch butterfly optimization
Gai-Ge Wang et al.
NEURAL COMPUTING & APPLICATIONS (2019)
Ring Theory-Based Evolutionary Algorithm and its application to D{0-1} KP
Yichao He et al.
APPLIED SOFT COMPUTING (2019)
Harris hawks optimization: Algorithm and applications
Ali Asghar Heidari et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)
Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
Gai-Ge Wang
MEMETIC COMPUTING (2018)
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
Yanhong Feng et al.
NEURAL COMPUTING & APPLICATIONS (2018)
A variable neighborhood search heuristic algorithm for production routing problems
Yuzhuo Qiu et al.
APPLIED SOFT COMPUTING (2018)
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
Yan-Hong Feng et al.
IEEE ACCESS (2018)
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
Anis Mjirda et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2017)
Discrete differential evolutions for the discounted {0-1} knapsack problem
Hong Zhu et al.
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION (2017)
Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems
Seyedali Mirjalili et al.
ADVANCES IN ENGINEERING SOFTWARE (2017)
Variable neighborhood search: basics and variants
Pierre Hansen et al.
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2017)
Exact and approximate algorithms for discounted {0-1} knapsack problem
Yi-Chao He et al.
INFORMATION SCIENCES (2016)
SCA: A Sine Cosine Algorithm for solving optimization problems
Seyedali Mirjalili
KNOWLEDGE-BASED SYSTEMS (2016)
On the performances of the flower pollination algorithm - Qualitative and quantitative analyses
Amer Draa
APPLIED SOFT COMPUTING (2015)
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Seyedali Mirjalili
KNOWLEDGE-BASED SYSTEMS (2015)
Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems
R. V. Rao et al.
COMPUTER-AIDED DESIGN (2011)
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
Jakob Puchinger et al.
JOURNAL OF HEURISTICS (2008)
A survey of effective heuristics and their application to a variety of knapsack problems
Christophe Wilbaut et al.
IMA JOURNAL OF MANAGEMENT MATHEMATICS (2008)
Benchmarking optimization software with performance profiles
ED Dolan et al.
MATHEMATICAL PROGRAMMING (2002)
Share Paper
