Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
From MaRDI portal
Publication:1595283
DOI10.1023/A:1009682532542zbMath0969.90079MaRDI QIDQ1595283
Xavier Gandibleux, Arnaud Fréville
Publication date: 4 October 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
Related Items (32)
Objective space division-based hybrid evolutionary algorithm for handing overlapping solutions in combinatorial problems ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ A multi-objective model for environmental investment decision making ⋮ A hybrid meta-heuristic for multi-objective optimization: MOSATS ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia ⋮ Multi-directional local search ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ A survey of recent developments in multiobjective optimization ⋮ Using support vector machines to learn the efficient set in multiple objective discrete optimization ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems ⋮ The influence of the fitness evaluation method on the performance of multiobjective search algorithms ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ 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
This page was built for publication: Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
