Very large-scale variable neighborhood search for the generalized assignment problem

2008 ◽  
Vol 11 (5) ◽  
pp. 653-670 ◽  
Author(s):  
Snežana Mitrović-Minić ◽  
Abrahim P. Punnen
Keyword(s):  
Assignment Problem ◽  
Large Scale ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Generalized Assignment Problem ◽  
Generalized Assignment ◽  
Scale Variable

scholarly journals A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

2019 ◽  
Vol 10 (1) ◽  
pp. 37-46
Author(s):  
Gülçin Bektur
Keyword(s):  
Tabu Search ◽  
Assignment Problem ◽  
Large Scale ◽  
Search Algorithm ◽  
Maximum Load ◽  
Mixed Integer ◽  
Generalized Assignment Problem ◽  
Generalized Assignment ◽  
Iterated Tabu Search ◽  
Resource Agent

In this study, a multi-resource agent bottleneck generalized assignment problem (MRBGAP) is addressed. In the bottleneck generalized assignment problem (BGAP), more than one job can be assigned to an agent, and the objective function is to minimize the maximum load over all agents. In this problem, multiple resources are considered and the capacity of the agents is dependent on these resources and it has minimum two indices. In addition, agent qualifications are taken into account. In other words, not every job can be assignable to every agent. The problem is defined by considering the problem of assigning jobs to employees in a firm. BGAP has been shown to be NP- hard. Consequently, a multi-start iterated tabu search (MITS) algorithm has been proposed for the solution of large-scale problems. The results of the proposed algorithm are compared by the results of the tabu search (TS) algorithm and mixed integer linear programming (MILP) model.

Sign in / Sign up

Export Citation Format

Share Document