MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

DOI10.1016/j.cor.2006.02.008zbMath1127.90059OpenAlexW2087628118WikidataQ57664323 ScholiaQ57664323MaRDI QIDQ883311

Maria João Alves, Marla Almeida

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/5482

zbMATH Keywords

genetic algorithmsknapsack problemmultiple objective programmingmultiobjective Chebyshev genetic algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (21)

The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Cross entropy for multiobjective combinatorial optimization problems with linear relaxations ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ Multi-directional local search ⋮ A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Lorenz dominance based algorithms to solve a practical multiobjective problem ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ Bi-objective ant colony optimization approach to optimize production and maintenance scheduling ⋮ A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem ⋮ Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems ⋮ MOTGA ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
• An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization
• Efficiency of interactive multi-objective simulated annealing through a case study
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multi-objective meta-heuristics: An overview of the current state-of-the-art
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem