A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem

DOI10.1016/j.ins.2018.01.026zbMath1440.90062OpenAlexW2783833771MaRDI QIDQ2195439

Xiangjing Lai, Zhipeng Lü, Jin-Kao Hao, Fred Glover

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.01.026

zbMATH Keywords

combinatorial optimizationmeta-heuristicsmultidimensional knapsack problemsolution-based tabu search

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

A randomized heuristic repair for the multidimensional knapsack problem ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ Tabu search tutorial. A graph drawing application ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ A comparative analysis of two matheuristics by means of merged local optima networks

Uses Software

• Tabu search

Cites Work

• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• Essential particle swarm optimization queen with tabu search for MKP resolution
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• A memetic algorithm for graph coloring
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• A note on hashing functions and tabu search algorithms
• Tutorial on surrogate constraint approaches for optimization in graphs
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Improved results on the 0--1 multidimensional knapsack problem
• A hybrid metaheuristic method for the maximum diversity problem
• Hashing vectors for tabu search
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Surrogate Constraints
• The Theory and Computation of Knapsack Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem