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.018MaRDI QIDQ670759zbMATH OpenOpenAlexFDO

Authors George Mavrotas, Kostas Florios, José Rui Figueira

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 optimizationmetaheuristicsmulti-objective programmingbranch-and-boundevolutionary computationsmulti-dimensional knapsack problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• The core concept for the Multidimensional Knapsack problem
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Cites work

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

Cited in

(6)

• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
• Cooperative multiobjective optimization with bounds on objective functions
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• Approximate and exact merging of knapsack constraints with cover inequalities
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study

Describes a project that uses

Uses Software

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

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

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