A metaheuristic based on fusion and fission for partitioning problems

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Bichot, Charles Edmond ^a  

^a ENAC   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRAFFIC CONTROL; ALGORITHMS; FISSION REACTIONS; FUSION REACTIONS; PROBLEM SOLVING; SIMULATED ANNEALING;

APPROXIMATE SOLUTIONS; CLASSICAL ALGORITHMS; METAHEURISTICS; PARTITIONING PROBLEMS;

HEURISTIC METHODS;

EID: 33847097994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639518     Document Type: Conference Paper

References (29)

1. C.-E. Bichot and J.-M. Alliot. A theoretical approach to defining the european core area. Technical report, ENAC - LOG, 2005.
2. C.-E. Bichot, J.-M. Alliot, N. Durand, and P. Brisset. Optimisation par fusion et fission, application au problème du découpage aérien européen. Journal Européen des Systèmes Automatisés, 38(9-10):1141-1173, 2004.
3. C. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein. Experimental study of minimum cut algorithms. In Symposium on Discrete Algorithms, pages 324-333, 1997.
4. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data, clustering. In Proceedings of ICDM 2001, pages 107-114, 2001.
5. W. E. Donath and A. J. Homan. Lower bounds for the partitioning of graphs. IBM J. of Research and Development, 17:420-425, 1973.
6. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B, 26(1):29-41, 1996.
7. F. Ercal, J. Ramanujam, and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitioning. Journal of Parallel, and Distributed Computing, 10(1):35-44, 1990.
8. Federal Aviation Administration (U.S. Department of Transportation). Air Traffic ControL : FAA Order 7110.65K, July 1997.
9. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In 19th ACM Design Automation Conf., pages 175-181, 1982.
10. M. Fielder. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Math. J., 25:619-633, 1975.
11. M. Garey, D. Johnson, and L. Stockmeyer. Some simplified np-complete graph problems. Theoretical Computer Science, 1(3):237-267, 1976.
12. W. A. Greene. Genetic algorithms for partitioning sets. International, Journal on Artificial Intelligence Tools, 10(1-2):225-241, 2001.
13. L. Hagen and A. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design, 11(9):1074-1086, 1992.
14. A. Hallgren. Restructuring european airspace: functional airspace blocks. Skyway, pages 20-22, autumn 2005.
15. B. Hendrickson and R. Leland. Multidimensional spectral load balancing. Technical Report SAND93-0074, Sandia National Laboratories, 1993.
16. B. Hendrickson and R. Leland. The Chaco user's guide. Sandia National Laboratories, 2 edition, 1994.
17. B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. In Supercomputing, 1995.
18. G. Karypis and V. Kumar. MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, 2 edition, 1995.
19. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998.
20. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
21. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 220(4598): 671-680, May 1983.
22. P. Kuntz, P. Layzell, and D. Snyers. A colony of antlike agents for partitioning in vlsi technology. In the Fourth European Conference on Artificial Life, pages 417-424. MIT Press, 1997.
23. A. E. Langham and P. W. Grant. A multilevel k-way partitioning algorithm for finite element meshes using competing ant colonies. In the Genetic and Evolutionary Computation Conf., volume 2, pages 1602-1608, Orlando, Florida, USA, 1999.
24. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430-452, 1990.
25. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
26. H. D. Simon and S.-H. Teng. How good is recursive bisection ? SIAM Journal on Scientific Computing, 18(5):1436-1445, 1997.
27. M. Stoer and F. Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, 1997.
28. E. G. Talbi and P. Bessiere. A parallel genetic algorithm for the graph partitioning problem. In Proceedings of the ACM International Conference on Supercomputing, ACM, Cologne, 1991.
29. Y. Weiss. Segmentation using eigenvectors: A unifying view. In ICCV (2), pages 975-982, 1999.