An ejection chain approach for the generalized assignment problem

INFORMS Journal on Computing

Volumn 16, Issue 2, 2004, Pages 133-151

  Yagiura, Mutsunori ^a   Ibaraki, Toshihide ^a   Glover, Fred ^b  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Adaptive parameter adjustment; Ejection chain; Generalized assignment problem; Local search; Metaheuristics; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; SET THEORY; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM;

ADAPTIVE PARAMETER ADJUSTMENT; EJECTION CHAINS; GENERALIZED ASSIGNMENT PROBLEMS; LOCAL SEARCH; METAHEURISTICS; TABU SEARCH;

PROBLEM SOLVING;

EID: 3142537983     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0036     Document Type: Article

References (36)

1. Amini, M. M., M. Racer. 1995. A hybrid heuristic for the generalized assignment problem. Eur. J. Oper. Res. 87 343-348.
2. Berge, C. 1962. The Theory of Graphs and Its Applications. Methuen, London, and Wiley, New York. (Translated by A. Doig.)
3. Bertsekas, D. P. 1995. Nonlinear Programming. Athena Scientific, Belmont, MA.
4. Cattrysse, D. G., M. Salomon, L. N. Van Wassenhove. 1994. A set partitioning heuristic for the generalized assignment problem. Eur. J. Oper. Res. 72 167-174.
5. Chu, P. C., J. E. Beasley. 1997. A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. 24 17-23.
6. Dongarra, J. J. 1999. Performance of various computers using standard linear equations software. Technical report. Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301, and Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN 37831. http://www.netlib.org/benchmark/performance.ps.
7. Edmonds, J. 1965. Maximum matching and a polyhedron with 0, 1-vertices. J. Res. National Bureau of Standards 69B 125-130.
8. Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
9. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
10. Glover, F. 1990. Tabu search - A tutorial. Interfaces 20(1) 74-94.
11. Glover, F. 1997. Ejection chain moves for generalized assignment problems. Manuscript. Leeds School of Business, University of Colorado, Boulder, CO.
12. Held, M., R. M. Karp. 1971. The traveling salesman problem and minimum spanning trees: Part II. Math. Programming 1 6-25.
13. Johnson, D. S. 1990. Local optimization and the traveling salesman problem. M. S. Paterson, ed. Automata, Languages and Programming, Lecture Notes in Computer Science, No. 443. Springer-Verlag, Berlin, 446-461.
14. Kernighan, B. W., S. Lin. 1970. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 291-307.
15. Laguna, M., J. P. Kelly, J. L. González-Velarde, F. Glover. 1995. Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. 82 176-189.
16. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 498-516.
17. Lorena, L. A. N., M. G. Narciso. 1996. Relaxation heuristics for a generalized assignment problem. Eur. J. Oper. Res. 91 600-610.
18. Lourenço, H. R., D. Serra. 2002. Adaptive search heuristics for the generalized assignment problem. Mathware Soft Comput. 9 209-234.
19. Lourenço, H. R., M. Zwijnenburg. 1996. Combining the large-step optimization with tabu-search: Application to the job-shop scheduling problem. I. H. Osman, J. P. Kelly, eds. Meta-Heuristics: Theory & Applications. Kluwer Academic Publishers, Boston, MA, 661-675.
20. Martello, S., P. Toth. 1981. An algorithm for the generalized assignment problem. Proc. Ninth IFORS Internat. Conf. on Operational Res.. Hamburg, Germany, July 1981. North-Holland, Amsterdam, The Netherlands, 589-603.
21. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester, U.K.
22. Martin, O., S. W. Otto, E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Complex Systems 5 299-326.
23. Martin, O., S. W. Otto, E. W. Felten. 1992. Large-step Markov chains for the TSP incorporating local search heuristic. Oper. Res. Lett. 11 219-224.
24. Nauss, R. M. 2003. Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS J. Comput. 15(3) 249-266.
25. Nonobe, K., T. Ibaraki. 1998. A tabu search approach to the CSP (constraint satisfaction problem) as a general problem solver. Eur. J. Oper. Res. 106 599-623.
26. Osman, I. H. 1995. Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches. OR Spektrum 17 211-225.
27. Pesch, E., F. Glover. 1997. TSP ejection chains. Discrete Appl. Math. 76 165-181.
28. Racer, M., M. M. Amini. 1994. A robust heuristic for the generalized assignment problem. Ann. Oper. Res. 50 487-503.
29. Rego, C. 1998a. Relaxed tours and path ejections for the traveling salesman problem. Eur. J. Oper. Res. 106 522-538.
30. Rego, C. 1998b. A subpath ejection chain method for the vehicle routing problem. Management Sci. 44 1447-1459.
31. Rego, C., C. Roucairol. 1996. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. I. H. Osman, J. P. Kelly, eds. Meta-Heuristics: Theory & Applications. Kluwer Academic Publishers, Boston, MA, 661-675.
32. Sahni, S., T. Gonzalez. 1976. P-complete approximation problems. J. Association Comput. Machinery 23 555-565.
33. Savelsbergh, M. 1997. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45 831-841.
34. Trick, M. A. 1992. A linear relaxation heuristic for the generalized assignment problem. Naval Res. Logist. 39 137-151.
35. Yagiura, M., T. Yamaguchi, T. Ibaraki. 1998. A variable depth search algorithm with branching search for the generalized assignment problem. Optim. Methods Software 10 419-441.
36. Yagiura, M., T. Yamaguchi, T. Ibaraki. 1999. A variable depth search algorithm for the generalized assignment problem. S. Voß, S. Martello, I. H. Osman, C. Roucairol, eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, MA, 459-471.