An object-oriented framework for local search heuristics

Proceedings - 26th Technology of Object-Oriented Languages and Systems, TOOLS 1998

Volumn , Issue , 1998, Pages 33-45

  Andreatta, Alexandre A ^a   Carvalho, Sérgio E R ^a   Ribeiro, Celso C ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; OBJECT ORIENTED PROGRAMMING;

COMBINATORIAL PROBLEM; DESIGN PATTERNS; IMPLEMENTATION LANGUAGES; INITIAL SOLUTION; LOCAL SEARCH HEURISTICS; NEIGHBOURHOOD; OBJECT-ORIENTED FRAMEWORKS; SELECTION CRITERIA; SOLUTION METHODS;

LOCAL SEARCH (OPTIMIZATION);

EID: 0004481888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A.A. Andreatta, A framework for the development of local search heuristics with an application to the phylogeny problem (in Portuguese), PhD Dissertation, Computer Science Department, Catholic University of Rio de Janeiro, Rio de Janeiro, 1998.
2. A.A. Andreatta, S.E.R. Carvalho, and C.C. Ribeiro, “A comparative study of heuristics for the computation of phylogenetic trees”, INFORMS Montréal Spring Meeting, Montréal, 1998.
3. R.S. Barr, B.L. Golden, J.P. Kelly, M.G. Resende, and W.R. Stewart, “Designing and reporting on computational experiments with heuristic methods”, Journal oh Heuristics 1 (1995), 1-32.
4. H. Bodlaender, M. Fellows, and T. Warnow, “Two strikes against the perfect phylogeny problem”, in Proceedings of the International Conference on Automata, Languages and Programming (Vienna, 1992), Lecture Notes in Computer Science 577, 273-283, Springer-Verlag, Berlin.
5. T. Feo and M.G. Resende, “Greedy randomized adaptive search procedures”, Journal of Global Optimization 6 (1995), 109-133.
6. J.A. Ferland, A. Hertz, and A. Lavoie, “An object-oriented methodology for solving assignment-type problems with neighborhood search techniques”, Operations Research 44 (1996), 347-359.
7. A. Fink and S. Voss, “Comparing different meta-strategies within a unifying framework for heuristic optimization”, presented in EURO-INFORMS Conference, Barcelona, 1997.
8. L.R. Foulds and R.L. Graham, “The Steiner problem in phylogeny is NP-Complete”, Advances in Applied Mathematics 3 (1982), 43-49.
9. E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design patterns - Elements of reusable object oriented software, Addison Wesley, Reading, 1994.
10. F. Glover, “Tabu search - Part I”, ORSA Journal on Computing 1 (1989), 190-206.
11. F. Glover and M. Laguna, “Tabu search”, Chapter 3 in Modern Heuristic Techniques for Combinatorial Problems (C.R. Reeves, Ed.), 70-150, Blackwell Scientific Publications, 1993.
12. M.G. Resende and C.C. Ribeiro, “A GRASP for graph planarization”, Networks 29 (1997), 173-189.
13. J. Rumbaugh, “OMT: The object model”, Journal of Object Oriented Programming 7 (1995), no. 8, 21-27.
14. D.L. Swofford and G. Olsen, “Phylogeny reconstruction”, in Molecular Systematics (D. M. Hillis and C. Moritz, eds.), 411-501, Sinauer, Sunderland, 1990.
15. D.L. Woodruff, “A class library for heuristic search optimization”, INFORMS Computer Science Technical Section Newsletter, Vol. 18, Number 2, 1997.