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

Journal of Interdisciplinary Mathematics

Volumn 11, Issue 5, 2008, Pages 653-670

  Mitrović Minić, Snežana ^a   Punnen, Abrahim P ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Generalized assignment; Heuristics; Local search; Variable neighbourhood search; VLSN algorithms

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; EXPONENTIAL NEIGHBORHOOD; GENERALIZED ASSIGNMENT PROBLEM; GENERALIZED ASSIGNMENTS; HEURISTICS; LOCAL SEARCH; VARIABLE NEIGHBORHOOD SEARCH; VARIABLE NEIGHBOURHOOD SEARCH;

BENCHMARKING;

HEURISTIC ALGORITHMS;

EID: 68349118477     PISSN: 09720502     EISSN: None     Source Type: Journal    
DOI: 10.1080/09720502.2008.10700590     Document Type: Article

References (24)

1. R. K. Ahuja, O. Ergun and A. Punnen (2006), Very large scale neighborhood search: theory, algorithms, and applications, in Handbook of Approximation Algorithms and Metaheuristics, Chapmann and Hall, T. Gonzalez (editor), CRC Press, Computer and Information Science Series, Vol. 10.
2. R. K. Ahuja, O. Ergun and A. Punnen (2002), A survey of very large scale neighborhood search techniques, Discrete Appl. Math., Vol. 23, pp. 75-102.
3. D. Cattrysse, M. Salomon and L. N. Van Wassenhove (1994), A set partitioning heuristic for the generalized assignment problem, European Journal of Operational Research, Vol. 72, pp. 167-174.
4. D. Cattrysse and L. N. Van Wassenhove (1992), A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, Vol. 60, pp. 260-272.
5. P. C. Chu and J. E. Beasley (1997), A genetic algorithm for the generalized assignment problem, Computers and Operations Research, Vol. 24, pp. 17-23.
6. M. Guignard and S. Zhu (1996), A two phase dual algorithm for solving Lagrangian duals in mixed integer programming, Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PA
7. S. Haddadi and H. Ouzia (2001), An effective lagrangian heuristic for the generalized assignment problem, Information Systems and Operational Research, Vol. 39(4), pp. 351-356.
8. S. Haddadi and H. Ouzia (2004), Effective algorithm and heuristic for the generalized assignment problem, European Journal of Operational Research, Vol. 153, pp. 184-190.
9. ILOG (2003), ILOG cplex 9.0 User's Manual.
10. M. Laguna, J. P. Kelly, J. L. Gonzalez-Velarde and F. Glover (1995), Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research, Vol. 82, pp. 176-189.
11. L. A. N. Lorena and M. G. Narciso (1996), Relaxation heuristic for the generalized assignment problem, European Journal of Operational Research, Vol. 91, pp. 600-610.
12. H. R. Lourengo and D. Serra (1998), Adaptive Approach Heuristic for the Generalized Assignment Problem, Technical report: Department of Economics and Management, Universitat Pompeu Fabra, R. Trias Fargas 25-27, 08005 Barcelona, Spain http://www.econ.upf.es/deehome/what/wpapers/listwork.htm
13. S. Martello and P. Toth (1981), An algorithm for the generalized assignment problem, in Operational Research'81, J.P. Brans (editor), North-Holland, pp. 589-603.
14. S. Martello and P. Toth (1990), Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York
15. N. Mladenovic and P. Hansen (1997), Variable neighborhood search, Computers and Operations Research, Vol. 24, pp. 1097-1100.
16. R. M. Nauss (2003), Solving the generalized assignment problem: an optimizing and heuristic approach, INFORMS Journal on Computing, Vol. 15, pp. 249-266.
17. T. Oncan, S. N. Kabadi, K. P. N. Nair and A. P. Punnen (2006), VLSN search algorithm for partitioning problems using matching neighborhoods, Journal of the Operational Research Society (to appear)
18. OR-Library, http://people.brunel.ac.uk/mastjjb/jeb/info.html
19. I. H. Osman (1995), Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches, OR Spektrum, Vol. 17, pp. 211-225.
20. J. S. Park, B. H. Lim and Y. Lee (1998), A Lagrangian dual based branch-and-bound algorithm for the generalized assignment problems, Management Science, Vol. 24, pp. 345-357.
21. M. Savelsbergh (1997), A branch-and-p rice algorithm for the generalized assignment problem, Operations Research, Vol. 45, pp. 831-841.
22. M. Trick (1992), A linear relaxation heuristic for the generalized assignment problem, Naval Research Logistic, Vol. 39, pp. 137-151.
23. M. Yagiura, T. Ibaraki and F. Glover (2004), An ejection chain approach for the generalized assignment problem, INFORMS Journal on Computing, Vol. 16, pp. 133-151.
24. M. Yagiura, T. Ibaraki and G. Glover (2006), A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, Vol. 169, pp. 548-569.