Abstract
Given an undirected graph, the 0–1 equicut problem consists of finding a partition of the vertex set into two subsets of equal size, such that the number of edges going from one subset to the other is minimized. A classical heuristics for this problem was presented 25 years ago, whereas simulated annealing, genetic algorithms, tabu search and a greedy randomized procedure have been developed in the last 5 years. In this paper we present a new tabu search algorithm and show, thorough extensive computational experiments, that in most cases it beats the other methods.
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
Barahona, F., M. Grötschel, M. Jünger, and G. Reinelt, An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res., 36 (1988) p. 493
Brunetta, L., M. Conforti and G. Rinaldi, A Branch-and-Cut Algorithm for The equicut Problem. Preprint n. 6, 14/02/1994, Dip. di Matematica Pura e Applicata, Università di Padova, (1994).
Conforti, M., M.R. Rao and A. Sassano, The Equipartition Polytope I: formulation, Dimension and Basic Facets. Math. Prog. 49 (1990) p. 49.
Conforti, M., M.R. Rao and A. Sassano, The Equipartition Polytope II: Valid Inequalities and Facets. Math. Prog., 49 (1990) p. 71.
Dell’Amico, M. and M. Trubian, Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operation Research, 41 (1993) p. 231.
Dell’Amico, M. Shop Problems with Two Machines and Time Lags. Oper. Res. to appear (1995).
Dongarra J.J., Performances of Various Computers Using Standard Linear Equations Software. CS-89–85, Computer Science Dep., University of Tennesee, Knoxville (1995).
Dunlop, A.E. and B.W. Kernighan, A Procedure for Placement of Standard-Cell VLSI Circuits. IEEE Trans. on C.A.D., 1 (1985) p. 92.
Garey, M.R. and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. (W.H. Freeman, San Francisco, 1979).
Johnson, D.S., CR. Aragon, L.A. McGeoch and C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Oper. Res. 37 (1989) p. 865.
Kernighan, B.W. and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs. Bell Sys. Tech. J., 49 (1970) p. 291.
Kirkpatric, S., C.D. Gelatt Jr. and M.P. Vecchi, Optimization by Simulated Annealing. Science, 220 (1983) p. 671.
Kirkpatric, S., Optimization by Simulated Annealing: Quantitative Studies. J. Statis. Phys., 34 (1984) p. 975.
Laguna, M., T.A. Feo and H.C. Elrod, A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem. Oper. Res., 42 (1994) p. 677.
Laguna, M., G. Glover, Tabu Search. In: Modern Heuristic Techniques for Combinatorial Problems, ed. C. R. Reeves (Blackwell Scientific Publications, Oxford, 1993).
Pirkul, H. and E. Rolland, New Heuristic Solution Procedures for the Uniform Graph Partitioning Problem: Extensions and Evaluation. Computers and Ops. Res., 21 (1994) p. 895.
Rolland E. and H. Pirkul, Heuristic Solution Procedures for the Graph Partitioning Problem. In: Computer Science and Operations Research: New Developments in Their Interfaces, ed. O. Balci (Pergamon Press, Oxford, 1992).
Rolland E., Pirkul H. and F. Glover, A Tabu Search for Graph Partitioning, Annals of Operations Research, to appear (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Dell’Amico, M., Maffioli, F. (1996). A New Tabu Search Approach to the 0–1 Equicut Problem. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_23
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive