On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
From MaRDI portal
Publication:1876139
DOI10.1016/j.ejor.2003.06.015zbMath1067.90077OpenAlexW2036842679MaRDI QIDQ1876139
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.015
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization ⋮ MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem ⋮ Differential evolution with improved sub-route reversal repair mechanism for multiobjective urban transit routing problem ⋮ Lorenz dominance based algorithms to solve a practical multiobjective problem ⋮ An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Interactive multiple objective optimization: Survey. I: Continuous case
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Solving generalized goal programming problems using a visual interactive approach
- A multiple criteria method for choosing among discrete alternatives
- An aspiration-level interactive model for multiple criteria decision making
- InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem
- General local search methods
- The ``Light Beam Search approach. -- An overview of methodology and applications
- Metaheuristics: A bibliography
- Using metaheuristics in multiobjective resource constrained project scheduling
- Efficiency of interactive multi-objective simulated annealing through a case study
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes
- Genetic local search for multi-objective combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
