Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem

Discrete Optimization

Volumn 6, Issue 4, 2009, Pages 370-377

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

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

0 1 integer programs; Generalized assignment; Heuristics; Local search; Resource allocation; Variable neighbourhood search; VLSN Search

Indexed keywords

0-1 INTEGER PROGRAMS; GENERALIZED ASSIGNMENT; HEURISTICS; LOCAL SEARCH; VARIABLE NEIGHBOURHOOD SEARCH; VLSN SEARCH;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PLANNING; RESOURCE ALLOCATION; TRAVELING SALESMAN PROBLEM;

HEURISTIC METHODS;

EID: 68349109639     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2009.04.004     Document Type: Article

References (33)

1. Gavish B., and Prikul H. Allocation of databases and processors in a distributed computing system. In: Akoka J. (Ed). Management of Distributed Data Processing (1982), North-Holland Publishing Company, Amsterdam
2. Gavish B., and Prikul H. Computer and database location in distributed computer systems. IEEE Transactions on Computers 35 (1986) 583-590
3. R.A. Murphy, A private fleet model with multi-stop backhaul, Working paper 103, Optimal Decision Systems, Green Bay, WI54306, 1986
4. Pirkul H. An integer programming model for allocation of databases in a distributed computer system. European Journal of Operational Research 26 (1986) 401-411
5. Cattrysse D., and Van Wassenhove L.N. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research 60 (1992) 260-272
6. Osman I.H. Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches. OR Spektrum 17 (1995) 211-225
7. Nauss R.M. Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS Journal on Computing 15 (2003) 249-266
8. Park J.S., Lim B.H., and Lee Y. A Lagrangian dual-based branch-and-bound algorithm for the generalized assignment problems. Management Science 24 (1998) 345-357
9. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841
10. Martello S., and Toth P. An algorithm for the generalized assignment problem. In: Brans J.P. (Ed). Operational Research '81 (1981), North-Holland 589-603
11. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), Wiley, New York
12. Chu P.C., and Beasley J.E. A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24 (1997) 17-23
13. Laguna M., Kelly J.P., González-Velarde J.L., and Glover F. Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research 82 (1995) 176-189
14. H.R. Lourenço, D. Serra, '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, 1998. Available at: http://www.econ.upf.es/deehome/what/wpapers/listwork.html
15. Yagiura M., Ibaraki T., and Glover F. An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing 16 (2004) 133-151
16. Lorena L.A.N., and Narciso M.G. Relaxation heuristic for the generalized assignment problem. European Journal of Operational Research 91 (1996) 600-610
17. Trick M. A linear relaxation heuristic for the generalized assignment problem. Naval Research Logistic 39 (1992) 137-151
18. Cattrysse D., Salomon M., and Van Wassenhove L.N. A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research 72 (1994) 167-174
19. M. Guignard, S. Zhu, A two phase dual algorithm for solving Lagrangian duals in mixed integer programming, Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PA, 1996
20. Gavish B., and Prikul H. Algorithms for the multi-resource generalized assignment problem. Management Science 37 (1991) 695-713
21. Yagiura M., Iwasaki S., Ibaraki T., and Glover F. A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization 1 1 (2004) 87-98
22. OR-Library available at http://people.brunel.ac.uk/mastjjb/jeb/info.html
23. Ahuja R.K., Ergun O., and Punnen A. Very large scale neighborhood search: Theory, algorithms, and applications. In: Gonzalez T. (Ed). Handbook of Approximation Algorithms and Metaheuristics. Computer and Information Science Series vol. 10 (2006), Chapmann and Hall, CRC Press
24. Ahuja R.K., Ergun O., and Punnen A. A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics 23 (2002) 75-102
25. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
26. Mitrovic-Minic S., and Punnen A.P. Very large-scale variable neighborhood search for the generalized assignment problem. Journal of Interdisciplinary Mathematics 11 (2008) 653-670
27. Oncan T., Kabadi S.N., Nair K.P.N., and Punnen A.P. VLSN search algorithm for partitioning problems using matching neighborhoods. Journal of the operational research society 59 (2008) 388-398
28. Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighbor- hoods to improve MIP solutions. Mathematical Programming 102 (2005) 71-90
29. Fischetti M., and Lodi A. Local branching. Mathematical Programming 98 (2003) 23-47
30. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers & Operations Research 34 (2007) 2403-2435
31. Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40 4 (2006) 455-472
32. ILOG ILOG cplex 9.0 User's Manual, 2003
33. Yagiura M., Ibaraki T., and Glover F. A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research 169 (2006) 548-569