A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem

DOI10.1051/RO/2015011MaRDI QIDQ2798113zbMATH OpenOpenAlexFDO

Authors Ali Nadi Ünal, Gülgün Kayakutlu

Publication date 1 April 2016

Published in RAIRO. Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2015011

zbMATH Keywords

combinatorial optimizationdynamic environmentsmultidimensional Knapsack problempartheno-genetic algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• A genetic algorithm to solve the multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm

Cites work

• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A genetic algorithm based on new mutation methods for solving 0/1 knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• A genetic algorithm to solve the multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A survey on optimization metaheuristics
• Genetic algorithms with double strings for 0-1 programming problems
• scientific article; zbMATH DE number 732335 (Why is no real title available?)
• scientific article; zbMATH DE number 1131224 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• Introduction to evolutionary computing
• Iterative patching and the asymmetric traveling salesman problem
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• On the performance of a hybrid genetic algorithm in dynamic environments
• Scatter search for the 0-1 multidimensional knapsack problem

Cited in

(4)

• A genetic algorithm to solve the multidimensional knapsack problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A multiagent-based evolutionary algorithm for dynamic knapsack problem
• Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

Describes a project that uses

Uses Software

• MOTGA

This page was built for publication: A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798113)