Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem

DOI10.1016/j.ejor.2018.10.001zbMath1430.90493OpenAlexW2896066091WikidataQ129160827 ScholiaQ129160827MaRDI QIDQ1755228

Jin-Kao Hao, Xiangjing Lai, Dong Yue

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.001

zbMATH Keywords

combinatorial optimizationmetaheuristicstwo-stage optimizationmultidemand multidimensional knapsack problemsolution-based tabu search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (9)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Exponential extrapolation memory for tabu search ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem ⋮ A logarithmic descent direction algorithm for the quadratic knapsack problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust efficiency measures for linear knapsack problem variants
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• Alternating control tree search for knapsack/covering problems
• Black box scatter search for general classes of binary optimization problems
• A genetic algorithm for the multidimensional knapsack problem
• A note on hashing functions and tabu search algorithms
• Semi-obnoxious location models: A global optimization approach
• Discrete facility location and routing of obnoxious activities.
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Improved results on the 0--1 multidimensional knapsack problem
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• Hashing vectors for tabu search
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• Adaptive memory search for multidemand multidimensional knapsack problems
• Balancing and optimizing a portfolio of R&D projects
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem