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

2016 ◽  
Vol 66 ◽  
pp. 199-214 ◽  
Author(s):  
Jin Qin ◽  
Xianhao Xu ◽  
Qinghua Wu ◽  
T.C.E. Cheng
Keyword(s):  
Tabu Search ◽  
Knapsack Problem ◽  
Local Searches ◽  
Multiple Knapsack Problem ◽  
Multiple Knapsack

Ant Colony Optimization and Multiple Knapsack Problem

2007 ◽  
pp. 498-509 ◽  
Author(s):  
S. Fidanova
Keyword(s):  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Combinatorial Optimization Problem ◽  
Ant Colony ◽  
Multiple Knapsack Problem ◽  
Constraint Problem ◽  
Multiple Knapsack ◽  
Ant Colony Optimization Algorithms

The ant colony optimization algorithms and their applications on the multiple knapsack problem (MKP) are introduced. The MKP is a hard combinatorial optimization problem with wide application. Problems from different industrial fields can be interpreted as a knapsack problem including financial and other management. The MKP is represented by a graph, and solutions are represented by paths through the graph. Two pheromone models are compared: pheromone on nodes and pheromone on arcs of the graph. The MKP is a constraint problem which provides possibilities to use varied heuristic information. The purpose of the chapter is to compare a variety of heuristic and pheromone models and different variants of ACO algorithms on MKP.

Sign in / Sign up

Export Citation Format

Share Document