A refined evaluation function for the MinLA problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4293 LNAI, Issue , 2006, Pages 392-403

  Rodriguez Tello, Eduardo ^a   Hao, Jin Kao ^a   Torres Jimenez, Jose ^b  

^a UNIVERSITÉ D'ANGERS   (France)

^b UNIVERSIDAD AUTÓNOMA DE GUERRERO   (Mexico)

Author keywords

Evaluation function; Genetic algorithms; Heuristics; Linear arrangement

Indexed keywords

FUNCTION EVALUATION; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

LINEAR ARRANGEMENTS; MEMETIC ALGORITHM (MA); STEEPEST DESCENT (SD);

ARTIFICIAL INTELLIGENCE;

EID: 33845931163     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11925231_37     Document Type: Conference Paper

References (14)

1. I. Charon and O. Hudry. The noising method: A new method for combinatorial optimization. Operations Research Letters, 14(3):133-137, 1993.
2. J. Diaz, J. Petit, and M. Serna. A survey of graph layout problems. ACM Comput. Surv., 34(3):313-356, 2002.
3. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
4. M. Garey and D. Johnson. Computers and Intractability: A guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
5. D. E. Goldberg and R. Lingle. Alleles, loci, and the travelling salesman problem. In Proc. of ICGA'85, pages 154-159. Carnegie Mellon publishers, 1985.
6. J. Gu and X. Huang. Efficient local search with search space smoothing: A case study of the traveling salesman problem (TSP), IEEE Transactions on Systems, Man, and Cybernetics, 24:728-735, 1994.
7. L. Harper. Optimal assignment of numbers to vertices, Journal of SIAM, 12(1):131-135, 1964.
8. D. Johnson, C. Aragon, L. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378-406, 1991.
9. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proc. Of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 819-830. IEEE Press, 1994.
10. Y. Koren and D. Harel. A multi-scale algorithm for the linear arrangement problem. Lecture Notes in Computer Science, 2573:293-306, 2002.
11. Y. Lai and K. Williams. A survey of solved problems and applications on bandwidth, edgosum, and profile of graphs. Graph Theory, 31:75-94, 1999.
12. J. Petit. Layout Problems. PhD thesis, Universitat Politécnica de Catahmya, 2001.
13. E. Rodriguez-Tello, J.-K. Hao, and J. Torres-Jimenez. Memetic algorithms for the MinLA problem. Lecture Notes in Computer Science, 3871:73-84, 2006.
14. I. Safro, D. Ron, and A. Brandt. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms, 2004. in press.