A hybrid tabu search/branch & bound approach to solving the generalized assignment problem

European Journal of Operational Research

Volumn 207, Issue 2, 2010, Pages 566-578

  Woodcock, Andrew J ^a   Wilson, John M ^b,c  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^c ABERYSTWYTH UNIVERSITY   (United Kingdom)

Author keywords

Branch and bound; Generalized assignment problem; Integer programming; Tabu search

Indexed keywords

ADD/DROP; BENCHMARK TESTS; BINARY VALUES; BRANCH AND BOUNDS; COMMERCIAL SOFTWARE; COMPUTATIONAL RESULTS; GENERALIZED ASSIGNMENT PROBLEM; GUIDING STRATEGY; HEURISTIC APPROACH; HEURISTIC STRATEGY; HYBRID ALGORITHMS; LINEAR PROGRAMMING RELAXATION; NEW APPROACHES; OPTIMISATIONS; SUB-PROBLEMS;

ALGORITHMS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; TRAVELING SALESMAN PROBLEM;

TABU SEARCH;

EID: 77955560843     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.05.007     Document Type: Article

References (37)

1. M.M. Amini, and M. Racer A rigorous computational comparison of alternative solution methods for the generalised assignment problem Management Science 40 1994 868 890
2. M.M. Amini, and M. Racer A hybrid heuristic for the generalized assignment problem European Journal of Operational Research 87 1995 343 348 (Pubitemid 24819091)
3. J. Bennell, and K.A. Dowsland Hybridising tabu search with optimization techniques for irregular stock cutting Management Science 47 2001 1160 1172 (Pubitemid 34192813)
4. J.A. Blue, and K.P. Bennett Hybrid extreme point tabu search European Journal of Operational Research 106 1998 676 688
5. K. Budenbender, T. Grunert, and H. Sebastian A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem Transportation Science 34 4 2000 364 380 (Pubitemid 32138216)
6. P.C. Chu, and J.E. Beasley A Genetic Algorithm for the generalised assignment problem Computers and Operations Research 27 1997 17 23 (Pubitemid 127417484)
7. E. Danna, E. Rothberg, and C. Le Pape Exploring relaxation induced neighbourhoods to improve MIP solutions Mathematical Programming A 102 2005 71 90 (Pubitemid 40134692)
8. I.R. de Farias Jr., E.L. Johnson, and G.L. Nemhauser A generalized assignment problem with special ordered sets: A polyhedral approach Mathematical Programming A 89 2000 187 203
9. J.A. Diaz, and E. Fernandez A Tabu search heuristic for the generalized assignment problem European Journal of Operational Research 132 2001 22 38 (Pubitemid 32288108)
10. H. Feltl, and G.R. Raidl An improved hybrid genetic algorithm for the generalized assignment problem H.M. Haddad, Proceedings of the 2003 ACM Symposium on Applied Computing 2004 ACM Press 990 995
11. M. Fischetti, and A. Lodi Local branching Mathematical Programming B 98 2003 23 47
12. M.L. Fisher, R. Jaikumar, and L.N. Van Wassenhove A multiplier adjustment method for the generalized assignment problem Management Science 32 1986 1095 1103
13. S. Haddadi, and H. Ouzia Effective algorithm and heuristic for the generalized assignment problem European Journal of Operational Research 153 2004 184 190
14. F. Glover Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 33 549 (Pubitemid 17480188)
15. F. Glover Tabu search-part I ORSA Journal on Computing 1 3 1989 190 205
16. F. Glover Tabu search-part II ORSA Journal on Computing 2 1 1990 4 32
17. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Boston
18. M. Laguna, J.P. Kelly, J.L. Gonzalez-Verlade, and F. Glover Tabu search for the multilevel generalized assignment problem European Journal of Operational Research 82 1995 176 189
19. P. Lisberg, B. Liden, and M. Ronnqvist A hybrid method based on linear programming and tabu search for routing logging trucks Computers and Operations Research 36 2009 1122 1144
20. Lourenco, H.R., Serra, D., 1998. Adaptive approach to heuristics for the generalized assignment problem. Technical Report. Department of Economics and Management, Universitat Pompeu Fabra, Roman Trias Fargas 25-27, 08005 Barcelona, Spana. 〈http://www.econ.upf.es/dechome/what/wpapers/listwork.html〉.
21. R.M. Nauss Solving the generalised assignment problem: An optimizing and heuristic approach INFORMS Journal on Computing 15 3 2003 249 266
22. R.M. Nauss The generalized assignment problem J.K. Karloff, Integer Programming Theory and Practice 2006 CRC Press 39 55
23. I.H. Osman Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches OR Spektrum 17 1995 211 215
24. G. Puchinger, and G. Raidl Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation 2005 Springer pp. 41-53 (Pubitemid 41425240)
25. S. Sahni, and T. Gonzalez P-complete approximation problems Journal of ACM 23 1976 555 565
26. M. Savelsbergh A branch-and-price algorithm for the generalized assignment problem Operations Research 45 1997 831 841 (Pubitemid 127684765)
27. M.A. Trick A linear relaxation heuristic for the generalized assignment problem Naval Research Logistics 39 1992 137 151
28. J.M. Wilson A genetic algorithm for the generalised assignment problem Journal of the Operational Research Society 48 1997 804 809 (Pubitemid 127100185)
29. T.H. Wu, J.Y. Yeh, and Y.R. Syau A tabu search approach to the generalised assignment problem Journal of the Chinese Institute of Industrial Engineers. 21 3 2004 301 311 (Pubitemid 41283583)
30. Xpress-MP, Fair Isaac Ltd., Blisworth, Northamptonshire, United Kingdom.
31. M. Yagiura, and T. Ibaraki Recent metaheuristics for the generalized assignment problem Proceedings of the 12th International Conference on Informatics Research for Development of Knowledge Society Infrastructure (IKS'04) 2004 IEEE (Pubitemid 39043199)
32. M. Yagiura, and T. Ibaraki Generalized assignment problem T.F. Gonzalez, Handbook of Approximation Problems and Metaheuristics 2007 Chapman and Hall/CRC Chapter 48
33. M. Yagiura, T. Yamaguchi, and T. Ibaraki A variable depth search algorithm with branching search for the generalised assignment problem Optimisation Methods & Software 10 1998 419 441 (Pubitemid 129619830)
34. M. Yagiura, T. Yamaguchi, and T. Ibaraki A variable depth search algorithm for the generalized assignment problem S. Voss, S. Martello, I.H. Osman, C. Roucairol, Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization 1999 Kluwer Academic Publishers Boston 459 471
35. Yagiura, M., Ibaraki, T., Glover, F., A path relinking approach for the generalized assignment problem. In: Proceedings of the International Symposium on Scheduling, Japan, June 4-6, 2002, pp. 105-108.
36. M. Yagiura, T. Ibaraki, and F. Glover An ejection chain approach for the generalized assignment problem INFORMS Journal on Computing 16 2 2004 131 151 (Pubitemid 39043199)
37. M. Yagiura, T. Ibaraki, and F. Glover A path relinking approach with ejections chains for the generalized assignment problem European Journal of Operational Research 169 2 2006 548 569 (Pubitemid 41375707)