Abstract
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Crossover (TX) is introduced and its performance is compared with four previous crossover operators. It is shown that the TX crossover induces a better population diversity. The MA using TX is evaluated on a set of well-known benchmark instances and is compared with several state-of-art MinLA algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Even, G., Feldman, J., Naor, S.: Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. Journal of Graph Algorithms and Applications 5(4), 1–27 (1996)
Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the IJCAI, pp. 162–164. Morgan Kaufmann, San Francisco (1985)
Diaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002)
Even, S., Shiloah, Y.: NP-completeness of several arrangement problems. Technical Report CS0043, Technion, Israel Institute of Technology, Haifa, Israel (1975)
Freisleben, B., Merz, P.: A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proc. Of the 1996 IEEE Int. Conf. On Evolutionary Computation, pp. 616–621. IEEE Press, Los Alamitos (1996)
Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Garey, M., Johnson, D.: Computers and Intractability: A guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Goldberg, D.E., Lingle, R.: Alleles, loci, and the travelling salesman problem. In: Proc. Of an Int. Conference on Genetic Algorithms and their Applications, pp. 154–159. Carnegie Mellon publishers, Pittsburgh (1985)
Grefenstette, J.J.: Incorporating problem specific knowledge into genetic algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, London. Morgan Kaufmann Publishers, San Francisco (1987)
Harper, L.: Optimal assignment of numbers to vertices. Journal of SIAM 12(1), 131–135 (1964)
Hart, W.E., Krasnogor, N., Smith, J.E. (eds.): Recent Advances in Memetic Algorithms and Related Search Technologies. Springer, Heidelberg (2004)
Koren, Y., Harel, D.: A multi-scale algorithm for the linear arrangement problem. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 296–309. Springer, Heidelberg (2002)
Merz, P., Freisleben, B.: Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation 8(1), 61–91 (2000)
Oliver, I., Smith, D., Holland, J.: A study of permutation crossover operators on the travelling salesman problem. In: Proc. Of the 2nd. Int. Conference on Genetic Algorithms, pp. 224–230. Lawrence Erlbaum Associates, Mahwah (1987)
Petit, J.: Layout Problems. PhD thesis, Universitat Politécnica de Catalunya (2001)
Poranen, T.: A genetic hillclimbing algorithm for the optimal linear arrangement problem. Technical report, University of Tampere, Finland (June 2002)
Safro, I., Ron, D., Brandt, A.: Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms (2004) (in press)
Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: The genetic edge recombination operator. In: Proc. Of the 3rd Int. Conf. On Genetic Algorithms, pp. 133–140. Morgan Kaufmann, San Francisco (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodriguez-Tello, E., Hao, JK., Torres-Jimenez, J. (2005). A Comparison of Memetic Recombination Operators for the MinLA Problem. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_62
Download citation
DOI: https://doi.org/10.1007/11579427_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29896-0
Online ISBN: 978-3-540-31653-4
eBook Packages: Computer ScienceComputer Science (R0)