An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics

DOI10.1016/j.amc.2015.08.018zbMath1410.90273MaRDI QIDQ670759

George Mavrotas, José Rui Figueira, Kostas Florios

Publication date: 20 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.08.018

zbMATH Keywords

combinatorial optimization; metaheuristics; branch-and-bound; multi-objective programming; evolutionary computations; multi-dimensional knapsack problems

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Approximate and exact merging of knapsack constraints with cover inequalities, Cooperative multiobjective optimization with bounds on objective functions

Uses Software

• PISA
• MEMOTS
• Knapsack
• MOEA/D
• SPEA2
• emoa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-directional local search
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• The three-dimensional knapsack problem with balancing constraints
• Multicriteria 0-1 knapsack problems with \(k\)-min objectives
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• The core concept for the Multidimensional Knapsack problem
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Core Problems in Knapsack Algorithms
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• The Multidimensional Knapsack Problem: Structure and Algorithms
• An Algorithm for Large Zero-One Knapsack Problems
• Multicriteria Optimization
• Discrete-Variable Extremum Problems
• MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization