A filter-and-fan algorithm for the capacitated minimum spanning tree problem

Computers and Industrial Engineering

Volumn 60, Issue 2, 2011, Pages 187-194

  Rego, César ^a   Mathew, Frank ^a  

^a UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Capacitated minimum spanning tree; Compound neighborhoods; Filter and fan; Strategic oscillation; Variable depth neighborhood search

Indexed keywords

CAPACITATED MINIMUM SPANNING TREES; COMPOUND NEIGHBORHOODS; FILTER-AND-FAN; NEIGHBORHOOD SEARCH; STRATEGIC OSCILLATIONS;

COMBINATORIAL OPTIMIZATION; DECISION TREES; HEURISTIC ALGORITHMS;

PARALLEL ARCHITECTURES;

EID: 78951495586     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.10.003     Document Type: Article

References (24)

1. R.K. Ahuja, J.B. Orlin, and D. Sharma Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem Mathematical Programming 91 2001 71 97
2. R.K. Ahuja, J.B. Orlin, and D. Sharma A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem Operations Research Letters 31 2003 185 194
3. A. Amberg, W. Domschke, and S. Voß Capacitated minimum spanning trees: Algorithms using intelligent search Combinatorial Optimization: Theory and Practice 1 1996 9 39
4. A. Amberg, W. Domschke, and S. Voß Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees European Journal of Operational Research 124 2000 360 376
5. J.E. Beasley OR-library: Distributing test problems by electronic mail The Journal of the Operational Research Society 41 11 1990 1069 1072
6. K.M. Chandy, and R.A. Russell The design of multipoint linkages in a teleprocessing tree network IEEE Transactions on Computers 21 1972 1062 1066
7. Dongarra, J.J. (2009). Performance of various computers using standard linear equations software. Report CS-89-85. (Retrieved)
8. L.R. Esau, and K.C. Williams On teleprocessing system design. Part II - A method for approximating the optimal network IBM Systems Journal 5 1966 142 147
9. I. Gamvros, B. Golden, and S. Raghavan The multilevel capacitated minimum spanning tree problem INFORMS Journal on Computing 18 3 2006 348 365 (Pubitemid 44371776)
10. B. Gavish Topological design of centralized computer networks: Formulations and algorithms Networks 12 1982 355 377
11. B. Gavish Topological design telecommunications networks: Local access design methods Annals of Operations Research 33 1991 17 71
12. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 10 1994 1276 1290
13. F. Glover A template for scatter search and path relinking J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers, Artificial evolution. Lecture notes in computer science Vol. 1363 1998 Springer Heidelberg 3 51
14. F. Glover Tabu Search - Part II ORSA Journal on Computing 2 1 1990 4 32
15. L. Gouveia A 2n constraint formulation for the capacitated minimal spanning tree problem Operations Research 43 1995 130 141
16. R. Kawatra, and D. Bricker A multiperiod planning model for the capacitated minimal spanning tree problem European Journal of Operational Research 121 2 2000 412 419
17. A. Kershenbaum, and R. Boorstyn Centralized teleprocessing network design Networks 13 1983 279 293
18. J.G. Klincewicz, H. Luss, and D.C.K. Yan Designing tributary networks with multiple ring families Computers Operations Research 25 12 1998 1145 1157
19. C. Papadimitriou The complexity of the capacitated tree problem Networks 8 1978 217 230
20. R. Patterson, H. Pirkul, and E. Rolland Memory adaptive reasoning for solving the capacitated minimum spanning tree problem Journal of Heuristics 5 1999 159 180
21. Rego, C., Mathew, F., Glover, F. (in press). RAMP for the capacitated minimum spanning tree problem. Annals of Operations Research, doi: 10.1007/s10479-010-0800-4.
22. C. Rego, and F. Glover Local search and metaheuristics for the traveling salesman problem G. Gutin, A. Punnen, The traveling salesman problem and its variations 2002 Kluwer Academic Publishers Boston 309 368
23. Y.M. Sharaiha, M. Gendreau, G. Laporte, and I.H. Osman A tabu search algorithm for the capacitated shortest spanning tree problem Networks 29 1997 161 171 (Pubitemid 127362102)
24. K.A. Woolston, and S.A. Albin The design of centralized networks with reliability and availability constraints Computers and Operations Research 15 3 1988 207 217