New metaheuristic approaches for the edge-weighted k-cardinality tree problem

Computers and Operations Research

Volumn 32, Issue 6, 2005, Pages 1355-1377

  Blum, Christian ^a   Blesa, Maria J ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Ant Colony Optimization; Combinatorial optimization; Evolutionary computation; k Cardinality tree problem; Metaheuristics; Spanning trees; Tabu search

Indexed keywords

BENCHMARKING; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SIMULATED ANNEALING;

ANT COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; K-CARDINALITY TREE PROBLEMS; METAHEURISTICS; SPANNING TREES; TABU SEARCH;

HEURISTIC PROGRAMMING;

EID: 9544234488     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.11.007     Document Type: Article

References (41)

1. Hamacher HW, Jörnsten K, Maffioli F. Weighted k-cardinality trees. Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
2. Hamacher HW, Jörnsten K. Optimal relinquishment according to the Norwegian petrol law: a combinatorial optimization approach. Technical Report No. 7/93, Norwegian School of Economics and Business Administration, Bergen, Norway, 1993.
3. Foulds LR, Hamacher HW, Wilson J. Integer programming approaches to facilities layout models with forbidden areas. Annals of Operations Research 1998;81:405-17.
4. Foulds LR, Hamacher HW. A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes. Technical Report 1992-3, University of Waikato, Department of Management Science, 1992.
5. Philpott AB, Wormald NC. On the optimal extraction of ore from an open-cast mine. New Zealand: University of Auckland; 1997.
6. Borndörfer R, Ferreira C, Martin A, Matrix decomposition by branch-and-cut. Technical Report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1997.
7. Borndörfer R, Ferreira C, Martin A. Decomposing matrices into blocks. SIAM Journal on Optimization 1998;9(1): 236-69.
8. Cheung SY, Kumar A. Efficient quorumcast routing algorithms. In: Proceedings of INFOCOM'94. Los Alamitos, USA, Silver Spring, MD: IEEE Society Press; 1994.
9. Garg N, Hochbaum D. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica 1997;18(1):111-21.
10. Fischetti M, Hamacher HW, Jörnsten K, Maffioli F. Weighted k-cardinality trees: complexity and polyhedral structure. Networks 1994;24:11-21.
11. Marathe MV, Ravi R, Ravi SS, Rosenkrantz DJ, Sundaram R. Spanning trees short or small. SIAM Journal on Discrete Mathematics 1996;9(2):178-200.
12. Maffioli F. Finding a best subtree of a tree. Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica, Italy, 1991.
13. A. Zelikovsky, D. Lozevanu, Minimal and bounded trees. In: Tezele Cong. XVIII Acad. Romano-Americane, Kishinev, 1993. p. 25-6.
14. Freitag J. Minimal k-cardinality trees. Master's thesis, Department of Mathematics, University of Kaiserslautern, Germany, 1993 [in German].
15. Uehara R. The number of connected components in graphs and its applications. IEICE Technical Report COMP99-10, Natural Science Faculty, Komazawa University, Japan, 1999.
16. Ehrgott M, Freitag J, Hamacher HW, Maffioli F. Heuristics for the k-cardinality tree and subgraph problem. Asia-Pacific Journal of Operational Research 1997;14(1):87-114.
17. Ehrgott M, Freitag J. K_TREE/K_SUBGRAPH: a program package for minimal weighted k-cardinality-trees and subgraphs. European Journal of Operational Research 1996;1(93):214-25.
18. Blum C, Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys 2003;35(3):268-308.
19. Blesa MJ, Moscato P, Xhafa F. A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. In: Proceedings of the Metaheuristics International Conference MIC'2001, vol. 1, Porto, Portugal, July 2001. p. 85-90.
20. Blesa MJ, Xhafa F. A C++ implementation of tabu search for k-cardinality tree problem based on generic programming and component Reuse. In: Net.ObjectDays 2000 Tagungsband, Erfurt, Germany, 2000. p. 648-52. Net.ObjectDays-Forum.
21. Jörnsten K, Loøkketangen A. Tabu search for weighted k-cardinality trees. Asia-Pacific Journal of Operational Research 1997;14(2):9-26.
22. Loøkketangen A. Tabu search-using the search experience to guide the search process. An introduction with examples. AICOM 1995;8(2):78-85.
23. Mladenović N, Urošević D. Variable neighborhood search for the k-cardinality tree problem. In: Proceedings of the Metaheuristics International Conference MIC'2001, vol. 2, 2001. p. 743-7.
24. Blum C. Ant colony optimization for the edge-weighted k-cardinality tree problem. In: Langdon WB, Cantú-Paz E, Mathias K, Roy R, Davis D, Poli R, Balakrishnan K, Honavar V, Rudolph G, Wegener J, Bull L, Potter MA, Schultz AC, Miller JF, Burke E, Jonoska N, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002). San Mateo, CA: Morgan Kaufmann Publishers; 2002. p. 27-34.
25. Blum C, Ehrgott M. Local search algorithms for the k-cardinality tree problem. Discrete Applied Mathematics 2003:128:511-40.
26. MALLBA-Project. www.lsi.upc.es/~mallba/public/library/TabuSearch/ minktree.html, 2001.
27. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 1986;5:533-49.
28. Glover F, Laguna M. Tabu search, Dordrecht: Kluwer Academic Publishers; 1997.
29. Bäck T. Evolutionary algorithms in theory and practice. New York: Oxford University Press; 1996.
30. Fogel DB. An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks 1994;5(1):3-14.
31. Hertz A, Kobler D. A framework for the description of evolutionary algorithms. European Journal of Operational Research 2000;126:1-12.
32. Dorigo M. Optimization, learning and natural algorithms. Ph.D. thesis, DEI, Politecnico di Milano, Italy, 1992, 140pp [in Italian].
33. Dorigo M, Di Caro G, Gambardella LM. Ant algorithms for discrete optimization. Artificial Life 1999;5(2):137-72.
34. Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics-Part B 1996;26(1):29-41.
35. Dorigo M, Gambardella LM. Ant Colony System: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1997;1(1):53-66.
36. Stützle T, Hoos HH. M A X - M I N ant system. Future Generation Computer Systems 2000;16(8):889-914.
37. Blum C, Roli A, Dorigo M. HC-ACO: the hyper-cube framework for ant colony optimization. In: Proceedings of Metaheuristics International Conference MIC'2001. Porto, Portugal, July 2001. p. 399-403.
38. Beasley JE. OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society 1990;41(11): 1069-72.
39. KCTLIB. http://iridia.ulb.ac.be/~cblum/kctlib/, 2003.
40. Cormen T, Leisersoon C, Rivest R. Introduction to algorithms 2nd ed, Cambridge, MA: MIT Press; and New York: McGraw-Hill; 2001.
41. Blum C, Blesa MJ. Metaheuristics for the edge-weighted k-cardinality tree problem. Technical Report TR/IRIDIA/2003-02, IRIDIA, Université Libre de Bruxelles, Belgium, 2003. Also available as technical report LSI-03-1-R, LSI, Universitat Politècnica de Catalunya, Spain.