An efficient memetic algorithm for the graph partitioning problem

DOI10.1007/s10479-011-0983-3zbMath1233.90271OpenAlexW1999993900MaRDI QIDQ763098

Philippe Galinier, Zied Boujbel, Michael Coutinho Fernandes

Publication date: 9 March 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0983-3

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Heuristic search to the capacitated clustering problem ⋮ A three-phased local search approach for the clique partitioning problem ⋮ Reinforcement learning based tabu search for the minimum load coloring problem ⋮ An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ Tabu search for the cyclic bandwidth problem ⋮ Memetic search for the max-bisection problem ⋮ A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ Local search for constrained graph clustering in biological networks ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ ILP-Based Local Search for Graph Partitioning ⋮ A variable neighborhood search approach for the vertex bisection problem ⋮ Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ Unnamed Item ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand ⋮ A hybrid metaheuristic method for the maximum diversity problem

Uses Software

• Bubble-FOS/C
• DibaP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Multilevel refinement for combinatorial optimisation problems
• Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Hybrid evolutionary algorithms for graph coloring
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu Search—Part I
• An Efficient Heuristic Procedure for Partitioning Graphs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Integer Programming and Combinatorial Optimization