C. Blum and A. Roli, Metaheuristics in combinatorial optimization, ACM Computing Surveys, vol.35, issue.3, pp.268-308, 2003.
DOI : 10.1145/937503.937505

URL : https://hal.archives-ouvertes.fr/hal-01224683

L. Bianchi, M. Dorigo, L. Gambardella, and W. Gutjahr, A survey on metaheuristics for stochastic combinatorial optimization, Natural Computing, vol.10, issue.6, 2006.
DOI : 10.1007/s11047-008-9098-4

A. Eiben and M. Jelasity, A critical note on experimental research methodology in EC, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), pp.585-587, 2002.
DOI : 10.1109/CEC.2002.1006991

E. Taillard, A statistical test for comparing success rates, Proc.of the 5 th Metaheuristics Int. Conf, 2003.

M. Birattari and M. Dorigo, How to assess and report the performance of a stochastic algorithm on a benchmark problem: mean or best result on a number of runs?, Optimization Letters, vol.7, issue.2, 2007.
DOI : 10.1007/s11590-006-0011-8

D. Shilane, J. Martikainen, S. Dudoit, and S. Ovaska, A general framework for statistical performance comparison of evolutionary computation algorithms, Proc. of the 24 th IASTED Conf. on Artificial Intelligence and Applications, pp.7-12, 2006.
DOI : 10.1016/j.ins.2008.03.007

R. Barr, B. Golden, J. Kelly, M. Resende, and W. Stewart, Designing and reporting on computational experiments with heuristic methods, Journal of Heuristics, vol.43, issue.4, pp.9-32, 1995.
DOI : 10.1007/BF02430363

M. Coffin and M. Saltzman, Statistical Analysis of Computational Tests of Algorithms and Heuristics, INFORMS Journal on Computing, vol.12, issue.1, pp.24-44, 2000.
DOI : 10.1287/ijoc.

R. Rardin and R. Uzsoy, Experimental evaluation of heuristic optimization algorithms: A tutorial, Journal of Heuristics, vol.7, issue.3, pp.261-304, 2001.
DOI : 10.1023/A:1011319115230

J. Hooker, Testing heuristics: We have it all wrong, Journal of Heuristics, vol.6, issue.1, pp.33-42, 1995.
DOI : 10.1007/BF02430364

P. Kuntz, B. Pinaud, and R. Lehn, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm, Journal of Heuristics, vol.11, issue.2, pp.23-36, 2006.
DOI : 10.1007/s10732-006-4296-7

URL : https://hal.archives-ouvertes.fr/inria-00335904

D. H. Wolpert and W. G. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893

Y. C. Ho and D. L. Pepyne, Simple Explanation of the No-Free-Lunch Theorem and Its Implications, Journal of Optimization Theory and Applications, vol.91, issue.3, pp.549-570, 2002.
DOI : 10.1023/A:1021251113462

P. Kuntz, B. Pinaud, and R. Lehn, Elements for the Description of Fitness Landscapes Associated with Local Operators for Layered Drawings of Directed Graphs, Metaheuristics: Computer Decision-Making, pp.405-420, 2004.
DOI : 10.1007/978-1-4757-4137-7_19

URL : https://hal.archives-ouvertes.fr/inria-00335923

E. Taillard, Few guidelines for analyzing methods, Tutorial, 6 th Metaheuristics Int. Conf, 2005.

G. Di-battista, P. Eades, R. Tamassia, and I. Tollis, Graph drawing ? Algorithms for the visualization of graphs, 1999.

J. Warfield, Crossing Theory and Hierarchy Mapping, IEEE Transactions on Systems, Man, and Cybernetics, vol.7, issue.7, pp.505-523, 1977.
DOI : 10.1109/TSMC.1977.4309760

M. Carpano, Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.10, issue.11, pp.705-715, 1980.
DOI : 10.1109/TSMC.1980.4308390

K. Sugiyama, S. Tagawa, and M. Toda, Methods for Visual Understanding of Hierarchical System Structures, IEEE Transactions on Systems, Man, and Cybernetics, vol.11, issue.2, pp.109-125, 1981.
DOI : 10.1109/TSMC.1981.4308636

P. Eades and K. Sugiyama, How to draw a directed graph, [Proceedings] 1989 IEEE Workshop on Visual Languages, pp.424-437, 1990.
DOI : 10.1109/WVL.1989.77035

H. Purchase, Effective information visualisation: a study of graph drawing aesthetics and algorithms, Interacting with Computers, vol.13, issue.2, pp.147-162, 2000.
DOI : 10.1016/S0953-5438(00)00032-1

M. Garey and D. Johnson, Crossing Number is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.4, issue.3, pp.312-316, 1983.
DOI : 10.1137/0604033

P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs, Algorithmica, vol.7, issue.2, pp.379-403, 1994.
DOI : 10.1007/BF01187020

E. Gansner, S. North, and K. Vo, DAG???a program that draws directed graphs, Software -Practice and Experience, pp.1047-1062, 1988.
DOI : 10.1002/spe.4380181104

L. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis et al., A browser for directed graphs, Software -Practice and Experience, pp.61-76, 1987.
DOI : 10.1002/spe.4380170107

M. Laguna, R. Marti, and V. Valls, Arc crossing minimization in hierarchical digraphs with tabu search, Computers & Operations Research, vol.24, issue.12, pp.1175-1186, 1997.
DOI : 10.1016/S0305-0548(96)00083-4

R. Marti, Arc crossing minimization in graphs with GRASP, IIE Transactions, vol.2, issue.10, pp.913-919, 2001.
DOI : 10.1007/BF02125456

E. Makinen and M. Sieranta, Genetic algorithms for drawing bipartite graphs, International Journal of Computer Mathematics, vol.17, issue.3-4, pp.157-166, 1994.
DOI : 10.1111/j.1749-6632.1970.tb56499.x

A. G. Tettamanzi, Drawing graphs with evolutionay algorithms, Proc. of Conf. on Adaptative Computing in Design and Manufacture, ACDM, pp.325-338, 1998.
DOI : 10.1007/978-1-4471-1589-2_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Utech, J. Branke, H. Schmeck, and P. Eades, An evolutionary algorithm for drawing directed graphs, Proc. of the Int. Conf. on Imaging Science, Systems and Technology, pp.154-160, 1998.

D. Goldberg, Genetic algorithms in search, optimization and machine learning, 1989.

D. Whitley and N. Yoo, Modeling Simple Genetic Algorithms for Permutation Problems, Fundations of Genetic Algorithms III, 1995.
DOI : 10.1016/B978-1-55860-356-1.50013-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

I. Herman, G. Melançon, and M. Marshall, Graph visualization and navigation in information visualization: A survey, IEEE Transactions on Visualization and Computer Graphics, vol.6, issue.1, pp.24-43, 2000.
DOI : 10.1109/2945.841119

T. Jones, Evolutionary Algorithms, Fitness Landscapes and Search, 1995.

C. Fonlupt, D. Robilliard, P. Preux, and E. Talbi, Advances and Trends in Local Serach Paradigms for Optimization, ch. Fitness Landscapes and Performance of Metaheuristics, pp.345-358, 1999.

C. Reidys and P. Stadler, Combinatorial Landscapes, SIAM Review, vol.44, issue.1, pp.3-54, 2002.
DOI : 10.1137/S0036144501395952

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Kallel, B. Naudts, and C. Reeve, Properties of Fitness Functions and Search Landscapes, Theoretical Aspects of Evolutionary computing, pp.175-206, 2001.
DOI : 10.1007/978-3-662-04448-3_8

T. Jones and S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, Proc. of the Sixth Conf. on Genetic Algorithms, pp.184-192, 1995.