A biased random-key genetic algorithm for routing and wavelength assignment

Journal of Global Optimization

Volumn 50, Issue 3, 2011, Pages 503-518

  Noronha, Thiago F ^a   Resende, Mauricio G C ^b   Ribeiro, Celso C ^c  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Genetic algorithm; Optical networks; Random keys; Routing; Wavelength assignment

Indexed keywords

COMPUTATIONAL RESULTS; EVOLUTIONARY FRAMEWORK; LIGHT PATH; NP-HARD; RANDOM KEYS; ROUTING; ROUTING AND WAVELENGTH ASSIGNMENT; STATE-OF-THE-ART ALGORITHMS; WAVELENGTH ASSIGNMENT; WAVELENGTH DIVISION MULTIPLEXING OPTICAL NETWORKS;

FIBER OPTIC NETWORKS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MULTIPLEXING; MULTIPLEXING EQUIPMENT;

WAVELENGTH;

EID: 80051669142     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9608-7     Document Type: Article

References (29)

1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343-373 (2002) (Pubitemid 34536965)
2. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: a Perl program to create time-to-target plots. Optim. Lett. 1, 355-366 (2007) (Pubitemid 47519609)
3. Bannerjee, D., Mukherjee, B.: Practical approach for routing and wavelength assignment in large wavelength routed optical networks. IEEE J. Sel. Areas Commun. 14, 903-908 (1995) (Pubitemid 126550956)
4. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 2, 154-160 (1994)
5. Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46, 36-56 (2005)
6. Buriol, L.S., Resende, M.G.C., Thorup, M.: Survivable IP network design with OSPF routing. Networks 49, 51-64 (2007) (Pubitemid 46478316)
7. Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A functional classification of routing and wavelength assignment schemes in DWD Mnetworks: static case. In: Proceedings of the 7th International Conference on Optical Communication and Networks, pp. 1109-1115. Paris (2000)
8. Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299-333 (2002) (Pubitemid 34474871)
9. Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255, 33-50 (2001) (Pubitemid 32680440)
10. Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C.: A branch-and-cut algorithm for partition coloring. Networks 55, 194-204 (2010)
11. Gonçalves, J.F., Mendes, J.J.M., Resende, M.G.C.: Ahybrid genetic algorithmfor the job shop scheduling problem. Eur. J. Oper. Res. 167, 77-95 (2005) (Pubitemid 40220004)
12. Gonçalves, J.F., Mendes, J.J.M., Resende, M.G.C.: A genetic algorithm for the resource constrained multi-project scheduling problem. Eur. J. Oper. Res. 189, 1171-1190 (2008) (Pubitemid 351400562)
13. Gonçalves, J.F., Mendes, J.J.M., Resende, M.G.C.: Arandomkey based genetic algorithmfor the resource constrained project scheduling problems. Comput. Oper. Res. 36, 92-109 (2009)
14. Gonçalves, J.F., Resende, M.G.C.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247-273 (2004)
15. Gonçalves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. Technical report, AT& T Labs Research. Florham Park, NJ, To appear in J. of Heuristics (2009)
16. Hertz, A., deWerra, D.: Using tabu search techniques for graph coloring. Computing 39, 345-351 (1987) (Pubitemid 18562739)
17. Hyytia, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31-40. Copenhagen (1998)
18. Jaumard, B.: Network and traffic data sets for optical network optimization. Online publication in http://users.encs.concordia.ca/~bjaumard/ CRC-Chair/Research/Optical-Networks/Optical-Networks-Data.htm, last visited on April 1st (2010)
19. Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the RWA problem for symmetrical systems. In: Handbook for Optimization in Telecommunications, pp. 637-677. Springer Science + Business Media (2006)
20. Jaumard, B., Meyer, C., Thiongane, B.: On column generation formulations for the RWA problem. Discrete Appl. Math. 157, 1291-1308 (2009)
21. Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge (1996)
22. Li,G., Simha,R.: The partition coloring problemand its application towavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks. Dallas (2000)
23. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 5, 211-213 (2002) (Pubitemid 34720935)
24. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: Efficient implementation of heuristics for routing and wavelength assignment. In: McGeoch, C.C. (ed.) Proceedings of the 7th International Workshop on Experimental Algorithms, volume 5038 of Lecture Notes in Computer Science, pp. 169-180. Springer, Provincetown, Mass (2008)
25. Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171, 797-810 (2006) (Pubitemid 43132947)
26. Schrage, L.: A more portable Fortran random number generator. ACM Trans. Math. Softw. 5, 132-138 (1979) (Pubitemid 9472315)
27. Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167-1179 (2007)
28. Spears, W., de Jong, K.: On the virtues of parameterized uniform crossover. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236. San Mateo, Morgan Kaufman (1991)
29. Zang, H., Jue, J.P., Mukherjee, B.: A review of routing and wavelength assignment approaches for wave-length-routed optical WDM networks. Opt. Netw. Mag. 1, 47-60 (2000)