Differential evolution algorithms for the generalized assignment problem

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 2606-2613

  Tasgetiren, M Fatih ^a   Suganthan, P N ^b   Chua, Tay Jin ^c   Al Hajri, Abdullah ^a  

^a SULTAN QABOOS UNIVERSITY   (Oman)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK SUITES; CAPACITY CONSTRAINTS; COMPUTATIONAL RESULTS; CONTINUOUS DOMAIN; CONTINUOUS OPTIMIZATION; DIFFERENTIAL EVOLUTION ALGORITHMS; DISCRETE DOMAINS; DISCRETE OPTIMIZATION PROBLEMS; DISCRETE SPACES; FEASIBLE SOLUTION; GENERALIZED ASSIGNMENT PROBLEM; LOCAL SEARCH; MINIMUM COST; SOLUTION QUALITY; SPEED-UP METHOD; VARIABLE NEIGHBORHOOD SEARCH;

HEURISTIC ALGORITHMS; TRAVELING SALESMAN PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 70450092380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983269     Document Type: Conference Paper

References (56)

1. M.M. Amini, M. Racer, A rigorous computational comparison of alternative solution methods for the generalized assignment problem, Management Science 40 (1994) 868-890.
2. Baker, B.M., Sheasby, J.E., 1999. Extensions to the generalized assignment heuristic for vehicle routing. European Journal of Operational Research 119, 147-157.
3. Balachandran, V., 1976. An integer generalized transportation model for optimal job assignment in computer networks. Operations Research 24 (4), 742-759.
4. Camerini, P.M., Fratta, L., Maffioli, F., 1975. On improving relaxation methods by modified gradient techniques. Mathematical Programming 3, 26-34.
5. Cario, M.C., Clifford, J.J., Hill, R.R., Yang, J., Yang, K., Reilly, C.H., 2002. An investigation of the relationship between problem characteristics and algorithm performance: A case study of the generalized assignment problems. IIE Transactions on Operations Engineering 34 (3), 297-312.
6. Cattrysse, D.G., Wassenhove, L.N.V., 1992. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research 60, 260-272.
7. Cattrysse, D.G., Salomon, M., Wassenhove, L.N.V., 1994. A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research 72, 167-174.
8. Charon, I., Hudry, O., 1993. The noising method: A new method for combinatorial optimization. Operations Research Letters 14, 133-137.
9. Chu, P.C., Beasley, J.E., 1997. A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24, 17-23. Available from: http://mscmga.ms.ic.ac.uk/jeb/orlib/gapinfo.html.
10. Codenotti, B., Manzini, G., Margara, L., Resta, G., 1996. Perturbation: An efficient technique for the solution of very large instances of the Euclidean TSP. INFORMS Journal on Computing 8, 125-133.
11. Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, Y., Semet, F., 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512-522.
12. Diaz, J.A., Fernandez, E., 2001. A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research 132, 22-38.
13. Farias, I.R. De, Nemhauser, G.L., 2001. A family of inequalities for the generalized assignment polytope. Operations Research Letters 29, 49-51.
14. Fisher, M.L., 1981. The Lagrangian relaxation method for solving integer programming problems. Management Science 27, 1-18.
15. Fisher, M.L., Jaikumar, R., 1981. A generalized assignment heuristic for vehicle routing. Networks 11, 109-124.
16. Fisher, M.L., Jaikumar, R., Wassenhove, L.N.V., 1986. A multiplier adjustment method for the generalized assignment problem. Management Science 32, 1095-1103.
17. Gottlieb, E.S., Rao, M.R., 1990. The generalized assignment problem: Valid inequalities and facets. Mathematical Programming 46, 31-52.
18. Haddadi, S., 1999. Lagrangian decomposition based heuristic for the generalized assignment problem. INFOR 37, 392-402.
19. Haddadi, S., Ouzia, H., 2001. An effective Lagrangian heuristic for the generalized assignment problem. INFOR 39, 351-356.
20. Haddadi, S., Ouzia, H., 2004. Effective algorithm and heuristic for the generalized assignment problem. European Journal of Operational Research 153, 184-190.
21. Higgins, A.J., 2001. A dynamic tabu search for large-scale generalized assignment problems. Computers and Operations Research 28 (10), 1039-1048.
22. Laguna, M., Kelly, J.P., González Velarde, J.L., Glover, F., 1995. Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research 82, 176-189.
23. Martello, S., Toth, P., 1981. An algorithm for the generalized assignment problem. In: Brans, J.P. (Ed.), Operational Research, IFORS. North-Holland, Amsterdam, pp. 589-603.
24. Naphade, K.S., Wu, D., Storer, R.H., 1997. Problem space search algorithms for resource constrained project scheduling. The Annals of Operations Research 70, 307-326.
25. Narciso, M.G., Lorena, L.A.N., 1999. Lagrangian/surrogate relaxation for generalized assignment problems. European Journal of Operational Research 114 (1), 165-177.
26. Nauss, R.M., 2003. Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS Journal of Computing 15 (3), 249-266.
27. Nauss, R.M., 2006. The generalized assignment problem. In: Karlof, J.K. (Ed.), Integer Programming: Theory and Practice. CRC Press, Boca Raton, FL, pp. 39-55.
28. Osman, I.H., 1995. Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches. OR Spektrum 17, 211-225.
29. Reinfeld, N.V., Vogel, W.R., 1958. Mathematical Programming. Prentice-Hall, Englewood Cliffs, NJ.
30. Romeijn, H.E., Romero-Morales, D.M., 2000. A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics 103, 209-235.
31. Ross, G.T., Soland, R.M., 1975. A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8, 91-103.
32. Ross, G.T., Soland, R.M., 1977. Modeling facility location problems as generalized assignment problems. Management Science 24 (3), 345-357.
33. Savelsbergh, M., 1997. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (6), 831-841.
34. Silver, E.A., 2004. An overview of heuristic solution methods. Journal of the Operational Research Society 55 (9), 936-956.
35. Storer, R.H., Wu, S.D., Vaccari, R., 1992. New search spaces for sequencing problems with application to job shop scheduling. Management Science 38, 1495-1509.
36. Storer, R.H., Wu, S.D., Vaccari, R., 1995. Problem and heuristic space search strategies for job shop scheduling. ORSA Journal on Computing 7, 458-487.
37. Storer, R.H., Flanders, S.W., Wu, S.D., 1996. Problem space local search for number partitioning. The Annals of Operations Research 63, 465-487.
38. Trick, M.A., 1992. A linear relaxation heuristic for the generalized assignment problem. Naval Research Logistics 39, 137-152.
39. Wilson, J.M., 1997. A simple dual algorithm for the generalized assignment problem. Journal of Heuristics 2 (4), 303-311.
40. Yagiura, M., Ibaraki, T., in press. Generalized assignment problem. In: Gonzalez, T.F. (Ed.), Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC in the Computer and Information Science Series.
41. Yagiura, M., Yamaguchi, T., Ibaraki, T., 1998. A variable depth search algorithm with branching search for the generalized assignment problem. Optimization Methods and Software 10, 419-441.
42. Yagiura, M., Ibaraki, T., Glover, F., 2004. An ejection chain approach for the generalized assignment problem. INFORMS Journal of Computing 16 (2), 133-151.
43. Yagiura, M., Ibaraki, T., Glover, F., 2006. A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research 169, 548-569.
44. R. Storn and K. V. Price, "Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces, " J. Global Opt., vol.11, no.4, pp. 341-359, Dec. 1997.
45. K. V. Price, R. M. Storn, and J. A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization. Berlin, Germany: Springer-Verlag, 2005.
46. D. Corne., M. Dorigo., and F.Glover. (eds.) "Part Two: Differential Evolution, " New Ideas in Optimization, McGraw-Hill, pp. 77-158, 1999.
47. J. Lampinen. "A Bibliography of Differential Evolution Algorithm, " Technical Report, Lappeenranta University of Technology, Department of Information Technology, Laboratory of Information Processing., 2001.
48. B. V. Babu and G. C. Onwubolu. (eds.) . "New Optimization Techniques in Engineering", Springer Verlag, 2004.
49. M. Fatih Tasgetiren, Quan-Ke Pan, Y-C Liang, A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times, Computers and Operations Research (2008), doi: 10.1016/j.cor.2008.06.007.
50. Quan-Ke Pan, M. Fatih Tasgetiren, Yun-Chia Liang, "A Discrete differential evolution algorithm for the permutation flowshop scheduling problem", Computers & Industrial Engineering (2008), doi: 10.1016/j.cie.2008.03.003.
51. N. Mladenovic, P. Hansen, Variable neighborhood search, Computers and Operations Research 24 (1997) 1097-1100.
52. Tasgetiren M. F., Yun-Chia Liang, Sevkli M., Gencyilmaz G, Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in Permutation Flowshop Sequencing Problem, European Journal of Operational Research, Vol.177, No.3, pp. 1930- 1947, 2007.
53. Coello Carlos A. Coello. (2002) "Theoretical and Numerical Constraint-Handling Techniques Used with Evolutionary Algorithms: A Survey of the State of the Art", Comput. Methods Appl. Mech. Engrg., 191(11-12), pp. 1245-1287.
54. Smith A. E and Tate D. M. (1993) "Genetic Optimization Using a Penalty Function", Proc. of the Fifth International Conference on genetic Algorithms, S. Forrest (Ed), Morgan Kaufmann, pp.499-503.
55. L. Davis, Applying adaptive algorithms to epistatic domains. Proceeding of the international joint conference on artificial intelligence, 1985, p. 162-164.
56. Chakraborty U K, (2008) (ed.) Advances in Differential Evolution. Berlin: Springer, 2008.