Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
From MaRDI portal
Publication:2255966
DOI10.1016/j.ejor.2013.07.035zbMath1305.90414OpenAlexW2000151189MaRDI QIDQ2255966
Manuel Lozano, Carlos García-Martínez, Francisco J. Rodriguez
Publication date: 18 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.035
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
Planning personnel retraining: column generation heuristics ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ An ejection chain approach for the quadratic multiple knapsack problem ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ Lagrangian matheuristics for the quadratic multiple knapsack problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem ⋮ Strategic oscillation for the quadratic multiple knapsack problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem ⋮ A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ Scheduling Personnel Retraining: Column Generation Heuristics ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Large-scale pickup and delivery work area design
- Algorithmic aspects for multiple-choice hardware/software partitioning
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Iterated greedy for the maximum diversity problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Approximations of the critical region of the fbietkan statistic
- Note: A local-search heuristic for large set-covering problems
This page was built for publication: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
