Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem

DOI10.1016/j.cor.2015.08.002zbMath1349.90720OpenAlexW2206877504MaRDI QIDQ342188

Jin Qin, Qinghua Wu, Xian-Hao Xu, Cheng, T. C. Edwin

Publication date: 17 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2015.08.002

zbMATH Keywords

tabu searchinfeasible local searchthe quadratic multiple knapsack problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items

Learning-driven feasible and infeasible tabu search for airport gate assignment, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Solving generalized polynomial problem by using new affine relaxed technique, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Lagrangian matheuristics for the quadratic multiple knapsack problem, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, A hybrid evolutionary search for the generalized quadratic multiple knapsack problem, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, A branch-and-bound algorithm for the quadratic multiple knapsack problem, Learning-based multi-objective evolutionary algorithm for batching decision problem

Uses Software

• Knapsack
• MULKNAP

Cites Work

• A tabu search algorithm for the multi-period inspector scheduling problem
• Memetic search for the max-bisection problem
• The freight allocation problem with lane cost balancing constraint
• The case for strategic oscillation
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• On classes of functions for which no free lunch results hold
• Exact methods for the knapsack problem and its generalizations
• An exact algorithm for large multiple knapsack problems
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• Multi-neighborhood tabu search for the maximum weight clique problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Strategic oscillation for the quadratic multiple knapsack problem
• Balancing assembly lines with tabu search
• Exact Solution of the Quadratic Knapsack Problem
• Handbook of metaheuristics
• A dynamic tabu search for large-scale generalized assignment problems