A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
From MaRDI portal
Publication:1652289
DOI10.1016/j.cor.2017.02.004zbMath1458.90534OpenAlexW2587579594MaRDI QIDQ1652289
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.004
variable neighborhood descentiterated local searchgeneralized quadratic multiple knapsack problemperturbation mechanism
Related Items (12)
Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ DILS: constrained clustering through dual iterative local search ⋮ A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem ⋮ Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem ⋮ A decomposition-based algorithm for the double row layout problem ⋮ Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines ⋮ On solving the time window assignment vehicle routing problem via iterated local search ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An ejection chain approach for the quadratic multiple knapsack problem
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Nested simulated annealing approach to periodic routing problem of a retail distribution system
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Generalized quadratic multiple knapsack problem and two solution approaches
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A general heuristic for vehicle routing problems
- The quadratic knapsack problem -- a survey
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Knapsack problems with setups
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Variable neighborhood search
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- A cross entropy algorithm for the Knapsack problem with setups
- Strategic oscillation for the quadratic multiple knapsack problem
- Algorithms for the bounded set-up knapsack problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Iterated local search for the quadratic assignment problem
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
- Quadratic knapsack problems
- Exact Solution of the Quadratic Knapsack Problem
This page was built for publication: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
