Abstract
This paper introduces a refined evaluation function, called Φ, for the Minimum Linear Arrangement problem (MinLA). Compared with the classical evaluation function (LA), Φ integrates additional information contained in an arrangement to distinguish arrangements with the same LA value. The main characteristics of Φ are analyzed and its practical usefulness is assessed within both a Steepest Descent (SD) algorithm and a Memetic Algorithm (MA). Experiments show that the use of Φ allows to boost the performance of SD and MA, leading to the improvement on some previous best known solutions.
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
Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters 14(3), 133–137 (1993)
Diaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313–356 (2002)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)
Garey, M., Johnson, D.: Computers and Intractability: A guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Goldberg, D.E., Lingle, R.: Alleles, loci, and the travelling salesman problem. In: Proc. of ICGA 1985, pp. 154–159. Carnegie Mellon publishers (1985)
Gu, J., Huang, X.: 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)
Harper, L.: Optimal assignment of numbers to vertices. Journal of SIAM 12(1), 131–135 (1964)
Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research 39(3), 378–406 (1991)
Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. In: Proc. Of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 819–830. IEEE Press, Los Alamitos (1994)
Koren, Y., Harel, D.: A multi-scale algorithm for the linear arrangement problem. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 293–306. Springer, Heidelberg (2002)
Lai, Y., Williams, K.: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. Graph Theory 31, 75–94 (1999)
Petit, J.: Layout Problems. PhD thesis, Universitat Politécnica de Catalunya (2001)
Rodriguez-Tello, E., Hao, J.-K., Torres-Jimenez, J.: Memetic algorithms for the MinLA problem. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 73–84. Springer, Heidelberg (2006)
Safro, I., Ron, D., Brandt, A.: Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms (in press, 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodriguez-Tello, E., Hao, JK., Torres-Jimenez, J. (2006). A Refined Evaluation Function for the MinLA Problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_37
Download citation
DOI: https://doi.org/10.1007/11925231_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)