Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics

Volumn 17, Issue 5, 2011, Pages 487-525

  Gonçalves, José Fernando ^a   Resende, Mauricio G C ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Biased random key genetic algorithms; Combinatorial optimization; Genetic algorithms; Metaheuristics; Random key genetic algorithms

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; METAHEURISTICS; SEQUENCING PROBLEMS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; TEACHING;

COMBINATORIAL MATHEMATICS;

EID: 80053565704     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-010-9143-1     Document Type: Article

References (98)

1. E.H.L. Aarts P.J.M. Van Laarhoven J.K. Lenstra N.L.J. Ulder 1994 A computational study of local search algorithms for job shop scheduling INFORMS J. Comput. 6 118 125 0819.90040 10.1287/ijoc.6.2.118
2. R.M. Aiex S. Binato M.G.C. Resende 2003 Parallel GRASP with path-relinking for job shop scheduling Parallel Comput. 29 393 430 1987222 10.1016/S0167-8191(03)00014-0
3. R. Alvarez-Valdes F. Parreño J.M. Tamarit 2005 A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems J. Oper. Res. Soc. 56 414 425 1104.90040 10.1057/palgrave.jors.2601829 (Pubitemid 40424117)
4. R. Alvarez-Valdes F. Parreño J.M. Tamarit 2007 A tabu search algorithm for a two-dimensional non-guillotine cutting problem Eur. J. Oper. Res. 183 1167 1182 1138.90430 10.1016/j.ejor.2005.11.068 (Pubitemid 47030734)
5. Andrade, D.V., Buriol, L.S., Resende, M.G.C., Thorup, M.: Survivable composite-link IP network design with OSPF routing. In: Proceedings of The Eighth INFORMS Telecommunications Conference (2006)
6. Baar, T., Brucker, P., Knust, S.: Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heurisitics: Advances and Trends in Local Search Paradigms for Optimization, pp. 1-8. Kluwer, Dordrecht (1998)
7. J.C. Bean 1994 Genetic algorithms and random keys for sequencing and optimization ORSA J. Comput. 6 154 160 0807.90060
8. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res., 49-64 (1985) (Pubitemid 15475049)
9. J.E. Beasley 2004 A population heuristic for constrained two-dimensional non-guillotine cutting Eur. J. Oper. Res. 156 601 627 2044857 1056.90011 10.1016/S0377-2217(03)00139-5
10. Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Kluwer Academic, Dordrecht (2002)
11. K. Bouleimen H. Lecocq 2003 A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version Eur. J. Oper. Res. 149 268 281 1993132 1040.90015 10.1016/S0377-2217(02) 00761-0
12. Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M., Johnson, D.S., Karloff, H., Resende, M.G.C., Sen, S.: Node placement for path disjoint monitoring. Technical report, AT&T Labs Research, Shannon Laboratory, Florham Park, NJ 07932, USA (2009)
13. L.S. Buriol M.G.C. Resende C.C. Ribeiro M. Thorup 2005 A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks 46 36 56 2151242 1072.90528 10.1002/net.20070 (Pubitemid 41092975)
14. L.S. Buriol M.G.C. Resende M. Thorup 2007 Survivable IP network design with OSPF routing Networks 49 51 64 2273696 1131.90319 10.1002/net.20141 (Pubitemid 46478316)
15. Buriol, L.S., Hirsch, M.J., Pardalos, P.M., Querido, T., Resende, M.G.C., Ritt, M.: A hybrid genetic algorithm for road congestion minimization. In: Proceedings of the XLI Symposium of the Brazilian Operational Research Society (XLI SBPO), Porto Seguro, Brazil (2009)
16. M.P. Chandrasekharan R. Rajagopalan 1987 ZODIAC-an algorithm for concurrent formation of part-families and machine-cells Int. J. Prod. Res. 25 835 850 0623.90030 10.1080/00207548708919880 (Pubitemid 17598496)
17. C.H. Cheng Y.P. Gupta W.H. Lee K.F. Wong 1998 A TSP-based heuristic for forming machine groups and part families Int. J. Prod. Res. 36 1325 1337 0947.90567 10.1080/002075498193345 (Pubitemid 128553201)
18. Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research, 30-44 (1977)
19. Debels, D., Vanhoucke, M.: A decomposition-based heuristic for the resource-constrained project scheduling problem. Technical report, Ghent University, Faculty of Economics and Business Administration, Belgium (2005)
20. D. Debels B. De Reyck R. Leus M. Vanhoucke 2006 A hybrid scatter search/electromagnetism meta-heuristic for project scheduling Eur. J. Oper. Res. 169 638 653 1079.90051 10.1016/j.ejor.2004.08.020 (Pubitemid 41375712)
21. F. Della Croce R. Tadei G. Volta 1995 A genetic algorithm for the job shop problem Comput. Oper. Res. 22 15 24 0816.90081 10.1016/0305-0548(93)E0015-L
22. C. Dimopoulos N. Mort 2001 A hierarchical clustering methodology based on genetic programming for the solution of simple cell-formation problems Int. J. Prod. Res. 39 1 19 0976.90066 10.1080/00207540150208835 (Pubitemid 35165468)
23. U. Dorndorf E. Pesch 1995 Evolution based learning in a job shop scheduling environment Comput. Oper. Res. 22 25 40 0815.90089 10.1016/0305-0548(93)E0016-M
24. M. Ericsson M.G.C. Resende P.M. Pardalos 2002 A genetic algorithm for the weight setting problem in OSPF routing J. Comb. Optim. 6 299 333 1920213 1068.90092 10.1023/A:1014852026591 (Pubitemid 34474871)
25. Fekete, S., Schepers, J.: A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms, ESA'97, pp. 144-156. Springer, Berlin (1997) (Pubitemid 127119226)
26. Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 353-368 (2004)
27. T.A. Feo M.G.C. Resende 1989 A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett. 8 67 71 995962 0675.90073 10.1016/0167-6377(89)90002-3
28. T.A. Feo M.G.C. Resende 1995 Greedy randomized adaptive search procedures J. Glob. Optim. 6 109 133 1322875 0822.90110 10.1007/BF01096763
29. Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225-251. Prentice-Hall, Englewood Cliffs (1963)
30. K. Fleszar K.S. Hindi 2004 Solving the resource-constrained project scheduling problem by a variable neighbourhood search Eur. J. Oper. Res. 155 402 413 2054701 1045.90028 10.1016/S0377-2217(02)00884-6
31. D. Fontes E. Hadjiconstantinou N. Christofides 2003 Upper bounds for single source uncapacitated minimum concave-cost network flow problems Networks 41 221 228 2003734 1035.90006 10.1002/net.10076
32. D.B.M.M. Fontes J.F. Gonçalves 2007 Heuristic solutions for general concave minimum cost network flow problems Networks 50 67 76 2334570 1119.90067 10.1002/net.20167 (Pubitemid 47235602)
33. D.B.M.M. Fontes E. Hadjiconstantinou N. Christofides 2006 A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems Eur. J. Oper. Res. 174 1205 1219 2251153 1102.90011 10.1016/j.ejor.2005.03.024 (Pubitemid 44093909)
34. B. Fortz M. Thorup 2004 Increasing internet capacity using local search Comput. Optim. Appl. 29 13 48 2093385 1069.90024 10.1023/B:COAP.0000039487. 35027.02 Preliminary short version of this paper published as "Internet Traffic Engineering by Optimizing OSPF weights," in Proc. IEEE INFOCOM 2000, The Conference on Computer Communications
35. Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer Academic, Dordrecht (2003)
36. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
37. J.F. Gonçalves 2007 A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem Eur. J. Oper. Res. 183 1212 1229 1136.90414 10.1016/j.ejor.2005.11.062 (Pubitemid 47030736)
38. J.F. Gonçalves J. Almeida 2002 A hybrid genetic algorithm for assembly line balancing J. Heuristics 8 629 642 10.1023/A:1020377910258 (Pubitemid 35338030)
39. J.F. Gonçalves N.C. Beirão 1999 Um algoritmo genético baseado em chaves aleatórias para sequenciamento de operaçõ es Rev. Desenvolv. Investig. Oper. 19 123 137
40. J.F. Gonçalves M.G.C. Resende 2004 An evolutionary algorithm for manufacturing cell formation Comput. Ind. Eng. 47 247 273 10.1016/j.cie.2004.07. 003
41. Gonçalves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. (2010). doi: 10.1007/s10878-009-9282-1
42. J.F. Gonçalves J.J.M. Mendes M.G.C. Resende 2005 A hybrid genetic algorithm for the job shop scheduling problem Eur. J. Oper. Res. 167 77 95 1075.90028 10.1016/j.ejor.2004.03.012 (Pubitemid 40220004)
43. J.F. Gonçalves J.J.M. Mendes M.G.C. Resende 2008 A genetic algorithm for the resource constrained multi-project scheduling problem Eur. J. Oper. Res. 189 1171 1190 1146.90412 10.1016/j.ejor.2006.06.074 (Pubitemid 351400562)
44. Gonçalves, J.F., Resende, M.G.C., Mendes, J.J.M.: A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. Technical report, AT&T Labs Research J. Heuristics (2009a, to appear)
45. Gonçalves, J.F., Resende, M.G.C., Silva, R.M.A.: Biased versus unbiased random key genetic algorithms: a experimental analysis. Technical report, AT&T Labs Research (2009b)
46. E. Hadjiconstantinou N. Christofides 1995 An exact algorithm for general, orthogonal, two-dimensional knapsack problems Eur. J. Oper. Res. 83 39 56 0903.90124 10.1016/0377-2217(93)E0278-6
47. E. Hadjiconstantinou M. Iori 2007 A hybrid genetic algorithm for the two-dimensional knapsack problem Eur. J. Oper. Res. 183 1150 1166 2343745 1146.90481 10.1016/j.ejor.2005.11.061 (Pubitemid 47030733)
48. E. Hadjiconstantinou M. Iori 2007 A hybrid genetic algorithm for the two-dimensional single large object placement problem Eur. J. Oper. Res. 183 1150 1166 2343745 1146.90481 10.1016/j.ejor.2005.11.061 (Pubitemid 47030733)
49. J.P. Hart A.W. Shogan 1987 Semi-greedy heuristics: an empirical study Oper. Res. Lett. 6 107 114 904831 0615.90082 10.1016/0167-6377(87)90021-6 (Pubitemid 17632868)
50. S. Hartmann 2002 A self-adapting genetic algorithm for project scheduling under resource constraints Nav. Res. Logist. 49 433 448 1918279 1013.90062 10.1002/nav.10029 (Pubitemid 34878877)
51. S. Hartmann 1998 A competitive genetic algorithm for resource-constrained project scheduling Nav. Res. Logist. 45 279 302 1643514 10.1002/(SICI)1520- 6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C
52. M. Hifi 1998 Exact algorithms for the guillotine strip cutting/packing problem Comput. Oper. Res. 25 925 940 1040.90568 10.1016/S0305-0548(98)00008-2
53. T.R. Hoffmann 1990 Assembly line balancing: a set of challenging problems Int. J. Prod. Res. 28 1807 1815 10.1080/00207549008942835
54. T.R. Hoffmann 1992 EUREKA: a hybrid system for assembly line balancing Manag. Sci. 38 39 47 0825.90511 10.1287/mnsc.38.1.39
55. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975)
56. E. Hopper B.C.H. Turton 2001 An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem Eur. J. Oper. Res. 128 34 57 0982.90044 10.1016/S0377-2217(99)00357-4 (Pubitemid 32022961)
57. S. Jakobs 1996 On genetic algorithms for the packing of polygons Eur. J. Oper. Res. 88 165 181 0913.90229 10.1016/0377-2217(94)00166-9 (Pubitemid 126367100)
58. Kochetov, Y., Stolyar, A.: Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies (2003)
59. Kolisch, R.: Project Scheduling Under Resource Constraints: Efficient Heuristics for Several Problem Classes. Physica-Verlag, Heidelburg (1995)
60. R. Kolisch 1996 Serial and parallel resource-constrained project scheduling methods revisited: theory and computation Eur. J. Oper. Res. 90 320 333 0916.90151 10.1016/0377-2217(95)00357-6 (Pubitemid 126652217)
61. R. Kolisch 1996 Efficient priority rules for the resource-constrained project scheduling problem J. Oper. Manag. 14 179 192 10.1016/0272-6963(95) 00032-1 (Pubitemid 126365433)
62. R. Kolisch A. Drexl 1996 Adaptative search for solving hard project scheduling problems Nav. Res. Logist. 43 23 40 0870.90069 10.1002/(SICI)1520- 6750(199602)43:1<23::AID-NAV2>3.0.CO;2-P (Pubitemid 126568742)
63. R. Kolisch A. Sprecher A. Drexl 1995 Characterization and generation of a general class of resource-constrained project scheduling problems Manag. Sci. 41 1693 1703 0870.90070 10.1287/mnsc.41.10.1693
64. K.K. Lai W.M. Chan 1997 An evolutionary algorithm for the rectangular cutting stock problem Int. J. Ind. Eng. 4 130 139 (Pubitemid 127662152)
65. Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1984)
66. V.J. Leon B. Ramamoorthy 1995 Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling OR Spektrum 17 173 182 0842.90062 10.1007/BF01719262
67. T.W. Leung C.K. Chan M.D. Troutt 2003 Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem Eur. J. Oper. Res. 145 530 542 1947212 1011.90033 10.1016/S0377- 2217(02)00218-7 (Pubitemid 35411804)
68. G. Li 1997 Single machine earliness and tardiness scheduling Eur. J. Oper. Res. 96 546 558 0917.90194 10.1016/S0377-2217(96)00062-8 (Pubitemid 127378187)
69. J.J.M. Mendes J.F. Gonçalves M.G.C. Resende 2009 A random key based genetic algorithm for the resource constrained project scheduling problem Comput. Oper. Res. 36 92 109 2577240 1163.90500 10.1016/j.cor.2007.07.001
70. R.H. Möhring A.S. Schulz F. Stork M. Uetz 2003 Solving project scheduling problems by minimum cut computations Manag. Sci. 49 330 350 10.1287/mnsc.49.3.330.12737
71. Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 557-588. Kluwer Academic, Dordrecht (2002)
72. T.F. Noronha C.C. Ribeiro 2006 Routing and wavelength assign by partition coloring Eur. J. Oper. Res. 171 797 810 1116.90073 10.1016/j.ejor.2004.09.007 (Pubitemid 43132947)
73. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. Technical report, AT&T Labs Research, Florham Park, NJ 07932 (2010)
74. E. Nowicki C. Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manag. Sci. 42 797 813 0880.90079 10.1287/mnsc.42.6.797 (Pubitemid 126577322)
75. Oliveira, J.F.: Private communication (2004)
76. G.C. Onwubolu M. Mutingi 2001 A genetic algorithm approach to cellular manufacturing systems Comput. Ind. Eng. 39 125 144 10.1016/S0360-8352(00)00074-7 (Pubitemid 32263385)
77. M. Palpant C. Artigues P. Michelon 2004 LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search Ann. Oper. Res. 131 237 257 2095806 1066.90037 10.1023/B:ANOR.0000039521.26237. 62 (Pubitemid 39187382)
78. Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization. Oxford University Press, Oxford (2002)
79. Reis, R., Ritt, M., Buriol, L.S., Resende, M.G.C.: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Technical report, AT&T Labs Research, Florham Park, NJ 07932. Int. Trans. Oper. Res. (2011, to appear)
80. Schirmer, A., Riesenberg, S.: Case-based reasoning and parameterized random sampling for project scheduling. Technical report, University of Kiel, Germany (1998)
81. Scholl, A.: Data of assembly line balancing problems. Technical Report 16/1993, Schriften zur Quantitativen Betriebswirtschaftslehre, TU Darmstadt (1993)
82. A. Scholl S. Vo 1997 Simple assembly line balancing-Heuristic approaches J. Heuristics 2 217 244 10.1007/BF00127358
83. N. Skorin-Kapov 2007 Routing and wavelength assignment in optical networks using bin packing based algorithms Eur. J. Oper. Res. 177 1167 1179 1109.90015 10.1016/j.ejor.2006.01.003
84. Spears, W.M., DeJong, K.A.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236 (1991)
85. G. Srinivasan 1994 A clustering algorithm for machine cell formation in group technology using minimum spanning trees Int. J. Prod. Res. 32 2149 2158 0897.90116 10.1080/00207549408957064
86. G. Srinivasan T.T. Narendran 1991 GRAFICS-a nonhierarchical clustering algorithm for group technology Int. J. Prod. Res. 29 463 478 10.1080/00207549108930083
87. Storer, R.H., Wu, S.D., Park, I.: Genetic algorithms in problem space for sequencing problems. In: Proceedings of a Joint US-German Conference on Operations Research in Production Planning and Control, pp. 584-597 (1992)
88. F.B. Talbot J.H. Patterson W.V. Gehrlein 1986 A comparative evaluation of heuristic line balancing techniques Manag. Sci. 32 430 454 10.1287/mnsc.32.4. 430 (Pubitemid 16535745)
89. Tormos, P., Lova, A.: Integrating heuristics for resource constrained project scheduling: one step forward. Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia (2003)
90. J.M.S. Valente 2007 Heuristics for the single machine scheduling problem with early and quadratic tardy penalties Eur. J. Ind. Eng. 1 431 448 10.1504/EJIE.2007.015391
91. J.M.S. Valente 2009 Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs Asia-Pac. J. Oper. Res. 26 319 339 2552869 1177.90185 10.1142/S0217595909002225
92. J.M.S. Valente J.F. Gonçalves 2008 A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties Comput. Oper. Res. 35 3696 3713 2586457 1170.90400 10.1016/j.cor.2007.04.006 (Pubitemid 351443070)
93. J.M.S. Valente J.F. Gonçalves R.A.F.S. Alves 2006 A hybrid genetic algorithm for the early/tardy scheduling problem Asia-Pac. J. Oper. Res. 23 393 405 2255591 1103.90050 10.1142/S0217595906000978 (Pubitemid 44448297)
94. Valls, V., Ballestin, J., Quintanilla, M.S.: A hybrid genetic algorithm for the RCPSP. Technical report, Department of Statistics and Operations Research, University of Valencia (2003)
95. V. Valls F. Ballestin M.S. Quintanilla 2004 A population-based approach to the resource-constrained project scheduling problem Ann. Oper. Res. 131 305 324 2095809 1066.90044 10.1023/B:ANOR.0000039524.09792.c9 (Pubitemid 39187385)
96. V. Valls F. Ballestin M.S. Quintanilla 2005 Justification and RCPSP: a technique that pays Eur. J. Oper. Res. 165 375 386 1066.90045 10.1016/j.ejor.2004.04.008 (Pubitemid 40206368)
97. L. Wang D.Z. Zheng 2001 An effective hybrid optimization strategy for job-shop scheduling problems Comput. Oper. Res. 28 585 596 1824630 1017.90048 10.1016/S0305-0548(99)00137-9
98. Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock problems. Oper. Res., 573-586 (1983) (Pubitemid 13576744)