R. M. Aiex, M. G. Resende, and C. C. Ribeiro, Probability distribution of solution time in GRASP: An experimental investigation, Journal of Heuristics, vol.8, p.343373, 2002.

R. M. Aiex, M. G. Resende, and C. C. Ribeiro, TTT plots: a perl program to create time-to-target plots, Optimization Letters, vol.1, issue.4, p.355366, 2007.
DOI : 10.1007/s11590-006-0031-4

A. C. Alvim, F. Glover, and C. C. Ribeiro, A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem, Journal of Heuristics, vol.10, issue.2, p.205229, 2004.
DOI : 10.1023/B:HEUR.0000026267.44673.ed

D. Banerjee and B. Mukherjee, Practical approaches for routing and wavelength assignment in large all-optical wavelength routed networks, Proceedings IEEE Infocom 94, p.110119, 1994.

D. Banerjee and B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications, vol.14, issue.5, p.903908, 1996.
DOI : 10.1109/49.510913

N. Banerjee and S. Sharan, A evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks, International Conference on Intelligent Sensing and Information Processing, 2004. Proceedings of, p.1318, 2004.
DOI : 10.1109/ICISIP.2004.1287616

S. Baroni and P. Bayvel, Wavelength requirements in arbitrarily connected wavelength-routed optical networks, Journal of Lightwave Technology, vol.15, issue.2, p.242251, 1997.
DOI : 10.1109/50.554330

M. S. Borella, J. P. Jue, D. Banerjee, and B. Mukherjee, Optical components for WDM lightwave networks, Proceedings of the IEEE, vol.85, issue.8, p.12741307, 1997.
DOI : 10.1109/5.622506

D. Brelaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, p.251256, 1979.
DOI : 10.1145/359094.359101

I. Chlamtac, A. Ganz, and G. Karmi, Lightpath communications: an approach to high bandwidth optical WAN's, IEEE Transactions on Communications, vol.40, issue.7, p.11711182, 1992.
DOI : 10.1109/26.153361

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2003.

S. Corteel, D. Gardy, M. Valencia-pabon, D. Bath, and A. Denise, The permutation-path coloring problem on trees, Theoretical Computer Science, vol.297, issue.1-3, p.119143, 2003.
DOI : 10.1016/S0304-3975(02)00635-7

R. Dutta and G. N. Rouskas, Trac grooming in WDM networks: Past and future

T. Erlebach and K. Jansen, The complexity of path coloring and call scheduling, Theoretical Computer Science, vol.255, issue.1-2, p.3350, 2001.
DOI : 10.1016/S0304-3975(99)00152-8

P. Festa, P. M. Pardalos, M. G. Resende, and C. C. Ribeiro, Randomized heuristics for the Max-Cut problem, Optimization Methods and Software, vol.25, issue.6, p.10331058, 2002.
DOI : 10.1080/1055678021000090033

T. Fischer, K. Bauer, and P. Merz, Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm, Memetic Computing, vol.18, issue.10, p.101123, 2009.
DOI : 10.1007/s12293-008-0006-3

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

P. C. Gilmore and R. E. Gomory, A Linear Programming Approach to the Cutting-Stock Problem, Operations Research, vol.9, issue.6, p.849859, 1961.
DOI : 10.1287/opre.9.6.849

F. Glover, Future paths for integer programming and links to articial intelligence, Computers and Operations Research, vol.13, issue.5, p.533549, 1986.

F. Glover and M. Laguna, Tabu search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

G. Huiban, O problema da reconguração nas redes WDM multibras, Programa de Pós-Graduação em Ciência da Computação, 2006.

B. Jaumard, C. Meyer, and B. Thiongane, ILP formulations and optimal solutions for the RWA problem, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., 2004.
DOI : 10.1109/GLOCOM.2004.1378328

B. Jaumard, C. Meyer, and B. Thiongane, ILP formulations for the RWA problem for symmetrical systems, 2006.

B. Jaumard, C. Meyer, and B. Thiongane, Comparison of ILP formulations for the RWA problem, Optical Switching and Networking, vol.4, issue.3-4, p.157172, 2007.
DOI : 10.1016/j.osn.2007.05.002

B. Jaumard, C. Meyer, and B. Thiongane, On column generation formulations for the RWA problem, Discrete Applied Mathematics, vol.157, issue.6, p.12911308, 2009.
DOI : 10.1016/j.dam.2008.08.033

Z. K. Júnior, Planejamento de topologia virtual com combinação de tráfegos em redes Ópticas multiplexadas por divisão de comprimentos de onda, Programa de Pós-Graduação em Ciência da Computação, 2005.

E. G. Coman-jr, J. Csirik, and G. Woeginger, Bin packing theory, 2002.

E. G. Coman-jr, M. R. Garey, and D. S. Johnson, Bin packing approximation algorithms: A survey, 1996.

J. Kleinberg and A. Kumar, Wavelength Conversion in Optical Networks, Journal of Algorithms, vol.38, issue.1, p.2550, 2001.
DOI : 10.1006/jagm.2000.1137

J. M. Kleinberg, Approximation algorithms for disjoint paths problems, 1996.

R. M. Krishnaswamy and K. N. Sivarajan, Algorithms for routing and wavelength assignment based on solutions of LP-relaxations, IEEE Communications Letters, vol.5, issue.10, p.435437, 2001.
DOI : 10.1109/4234.957386

R. M. Krishnaswamy and K. N. Sivarajan, Design of logical topologies: A linear formulation for wavelength-routed optical networks with no wavelength changers, IEEE/ACM Transactions on Networking, vol.9, issue.2, p.186198, 2001.

K. Lee, K. Kang, T. Lee, and S. Park, Optimal routing and wavelength assignment in WDM ring networks, IEEE Journal on Selected Areas in Communications, vol.18, issue.10, p.21462154, 2000.

K. Lee, K. Kang, T. Lee, and S. Park, An Optimization Approach to Routing and Wavelength Assignment in WDM All-Optical Mesh Networks without Wavelength Conversion, ETRI Journal, vol.24, issue.2, p.131141, 2002.
DOI : 10.4218/etrij.02.0402.0206

G. Li and R. Simha, The partition coloring problem and its application to wavelength routing and assignment, Proceedings of the First Workshop on Optical Networks, p.119, 2000.

H. R. Lourenço, O. Martin, and T. Stuetzle, Iterated Local Search, 2002.
DOI : 10.1007/0-306-48056-5_11

P. Manohar, D. Manjunath, and R. K. Shevgaonkar, Routing and wavelength assignment in optical networks from edge disjoint path algorithms, IEEE Communications Letters, vol.6, issue.5, p.211213, 2002.
DOI : 10.1109/4234.1001667

A. X. Martins, M. C. De-souza, M. J. Souza, and T. A. Toolo, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, Journal of Heuristics, vol.112, issue.2, p.133151, 2009.
DOI : 10.1007/s10732-008-9079-x

N. Mladenovic and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, p.10971100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2
URL : https://hal.archives-ouvertes.fr/hal-00979295

T. F. Noronha, M. G. Resende, and C. C. Ribeiro, Ecient implementation of heuristics for routing and wavelength assignment, Lecture Notes in Computer Science, vol.5038, p.169180, 2008.

T. F. Noronha, M. G. Resende, and C. C. Ribeiro, A biased random-key genetic algorithm for routing and wavelength assignment, Journal of Global Optimization, vol.1, issue.3, p.503518, 2011.
DOI : 10.1007/s10898-010-9608-7

T. F. Noronha and C. C. Ribeiro, Routing and wavelength assignment by partition colouring, European Journal of Operational Research, vol.171, issue.3, p.797810, 2006.
DOI : 10.1016/j.ejor.2004.09.007

R. Ramaswami and K. N. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE/ACM Transactions on Networking, vol.3, issue.5, p.489501, 1995.

R. Ramaswami and K. N. Sivarajan, Design of logical topologies for wavelengthrouted optical networks, IEEE Journal on Selected Areas in Communications, vol.14, issue.5, p.840851, 1996.

M. G. Resende and C. C. Ribeiro, A GRASP with pathrelinking for private virtual circuit routing, p.104114, 2003.

A. R. Sharafat and O. R. Ma-'rouzi, The Most Congested Cutset: Deriving a Tight Lower Bound for the Chromatic Number in the RWA Problem, IEEE Communications Letters, vol.8, issue.7, p.473475, 2004.
DOI : 10.1109/LCOMM.2004.832765

N. Skorin-kapov, Routing and wavelength assignment in optical networks using bin packing based algorithms, European Journal of Operational Research, vol.177, issue.2, p.11671179, 2007.
DOI : 10.1016/j.ejor.2006.01.003

W. Spears and K. Dejong, On the virtues of parameterized uniform crossover, Proceedings of the Fourth International Conference on Genetic Algorithms, p.230236, 1991.

E. Uchoa, T. A. Toolo, M. C. De-souza, A. X. Martins, and R. Fukasawa, Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem, Networks, vol.112, issue.1, 2011.
DOI : 10.1002/net.20485

D. West, Introduction to Graph Theory, 1996.

G. Wilfong and P. Winkler, Ring routing and wavelength translation, Proceedings on the 9th annual ACM-SIAM Symposium on Discrete Algorithms, p.333341, 1998.

H. Zang, J. P. Jue, and B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, Optical Network Magazine, vol.1, p.4760, 2000.