A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem

DOI10.1051/ro/2015011zbMath1333.90112OpenAlexW2049894287MaRDI QIDQ2798113

Ali Nadi Ünal, Gulgun 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

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

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization

Uses Software

• MOTGA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on optimization metaheuristics
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• Scatter search for the 0-1 multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• A genetic algorithm to solve the multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• Genetic algorithms with double strings for 0-1 programming problems
• Iterative patching and the asymmetric traveling salesman problem
• On the performance of a hybrid genetic algorithm in dynamic environments
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Introduction to evolutionary computing

This page was built for publication: A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem