Abstract
One significant problem of optimization which occurs in many real applications is that of graph partitioning. It consist of obtaining a partition of the vertices of a graph into a given number of roughly equal parts, whilst ensuring that the number of edges connecting vertices of different sub-graphs is minimized. In the single-objective (traditional) graph partitioning model the imbalance is considered a constraint. However, in same applications it is necessary to extend this model to its multi-objective formulation, where the imbalance is also an objective to minimize. This paper try to solve this problem in the multi-objective way by using a population version of the SMOSA algorithm in combination with a diversity preservation method proposed in the SPEA2 algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Teresco, J.D.: Hierarchical Partitioning and Dynamic Load Balancing for Scienti fic Computation. Tech. Report CS-04-04, Williams College, Dept. Comp. Science (2004)
Walshaw, C., Cross, M., Everett., M.G.: Mesh Partitioning and Load-Balancing for Distributed Memory Parallel Systems. In: Topping, B.H.V. (ed.) Parallel & Distributed Processing for Computational Mechanics: Systems and Tools, pp. 110–123
Gil, C., Ortega, J., Montoya, M.G.: Parallel VLSI Test in a Shared Memory Multiprocessors. Concurrency: Practice and Experience 12(5), 311–326 (2000)
Aleta, A., Codina, J.M., Sanchez, J., Gonzalez, A.: Graph-Partitioning Based Instruction Scheduling for Clustered Processors. In: Proc. of 34th Annual International Symposium on Microarchitecture, pp. 150–159 (2001)
Mobasher, B., Jain, N., Han, E.H., Srivastava, J.: Web Mining: Pattern Discovery from World Wide Web Transactions. Tech. Report TR-96-050, Department of Computer Science, University of Minnesota, Minneapolis (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1979)
Serafini, P.: Simulated Annealing for Multi-objective Optimization Problems. In: Tzeng, G.H., Wen, U.P., Yu, P.L. (eds.) Multiple Criteria Decision Making: Expand and Enrich the Domains of Thinking and Application, Springer, Heidelberg (1993)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Performance of the Strength Pareto Evolutionary Algorithm. Tech. Report 103, Computer Engineering and Communication Networks Lab (TIK), Zurich (2001)
Chamberlain, B.L.: Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations. Tech. Report UW-CSE-98-10-03, Univ. of Washington (1998)
Karypis, G., Kumar, V.: METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Version 4.0. Department of Computer Science Department, University of Minnesota (1998)
Walshaw, C.: JOSTLE–Graph Partitioning Software, http://staffweb.cms.gre.ac.uk/~c.walshaw/jostle/
Selvakkumaran, N., Karypis, G.: Multi-objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. In: Proc. of International Conference on Computer Aided Design, pp. 726–733 (2003)
Rummler, A., Apetrei, A.: Graph Partitioning Revised-a Multiobjective Perspective. In: Proc. of 6th World MultiConference On Systemics, Cybernetics and Informatics (2002)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publisher, Reading (1989)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271 (1999)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics 21(6), 1087–1092 (1953)
Goehring, T., Saad, Y.: Heuristic Algorithms for Automatic Graph Partitioning. Tech. Report, Department of Computer Science, University of Minnesota (1995)
Graph Partitioning Archive, http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/
Czyzak, P., Jaszkiewicz, A.: Pareto Simulated Annealing-A Metaheuristic Technique For Multiple-Objective Combinatorial Optimization. Journal of Multi-Criteria Decision Analysis 7, 34–47 (1998)
Baños, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel Heuristic Algorithm for Graph Partitioning. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 143–153. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baños, R., Gil, C., Montoya, M.G., Ortega, J. (2004). A New Pareto-Based Algorithm for Multi-objective Graph Partitioning. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_78
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive