An effective iterated tabu search for the maximum bisection problem

2017 ◽  
Vol 81 ◽  
pp. 78-89 ◽  
Author(s):  
Fuda Ma ◽  
Jin-Kao Hao ◽  
Yang Wang
2013 ◽  
Vol 225 (2) ◽  
pp. 236-243 ◽  
Author(s):  
Zhanghua Fu ◽  
Wenqi Huang ◽  
Zhipeng Lü

Author(s):  
Gülçin Bektur

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.


2014 ◽  
Vol 20 (2) ◽  
pp. 143-164 ◽  
Author(s):  
Nehme Bilal ◽  
Philippe Galinier ◽  
Francois Guibault

2015 ◽  
Vol 32 (2) ◽  
pp. 368-384 ◽  
Author(s):  
Taoqing Zhou ◽  
Zhipeng Lü ◽  
Yang Wang ◽  
Junwen Ding ◽  
Bo Peng

2008 ◽  
Vol 191 (3) ◽  
pp. 945-956 ◽  
Author(s):  
Jean-François Cordeau ◽  
Gilbert Laporte ◽  
Federico Pasin

Sign in / Sign up

Export Citation Format

Share Document