EasyLocal++: An object-oriented framework for the flexible design of local-search algorithms

Software - Practice and Experience

Volumn 33, Issue 8, 2003, Pages 733-765

  Di Gaspero, Luca ^a   Schaerf, Andrea ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b NONE

Author keywords

(Meta )heuristics; Algorithms design and implementation; Analysis of algorithms; Local search

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; OPTIMIZATION; PROBLEM SOLVING;

LOCAL-SEARCH ALGORITHMS;

OBJECT ORIENTED PROGRAMMING;

EID: 0038267933     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.524     Document Type: Article

References (38)

1. Mehlhorn K, Näher S, Seel M, Uhrig C. The LEDA User Manual Version 4.0. Max Plank Institute: Saarbrücken, 1999.
2. Gamma E, Helm R, Johnson R, Vlissides J. Design Patterns, Elements of Reusable Object-Oriented Software. Addison-Wesley: Reading, MA, 1994.
3. Di Gaspero L, Schaerf A. Writing local search algorithms using EASYLOCAL++. Optimization Software Class Libraries (Operations Research/Computer Science Interfaces Series), Voß S, Woodruff DL (eds.). Kluwer: Boston, MA, 2002.
4. Voß S, Woodruff DL (eds.). Writing local search algorithms using EASYLOCAL++. Optimization Software Class Libraries (Operations Research/Computer Science Interfaces Series). Kluwer: Boston, MA, 2002.
5. Voß S, Martello S, Osman IH, Roucairol C (eds.). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer: Boston, MA, 1999.
6. Glover F, Laguna M. Tabu Search. Kluwer: Boston, MA, 1997.
7. Ramalhino Lourenço H, Martin O, Stützle T. Applying iterated local search to the permutation flow shop problem. Handbook of Metaheuristics, Glover F, Kochenberger G (eds.). Kluwer: Boston, MA, 2002.
8. Schaerf A. Local search techniques for large high-school timetabling problems. IEEE Transactions on Systems, Man and Cybernetics 1999; 29(4):368-377.
9. Booch G, Rumbaugh J, Jacobson I. The Unified Modeling Language User Guide. Addison-Wesley: Reading, MA, 1999.
10. Garey MR, Johnson DS. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company: San Francisco, CA, 1979.
11. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994; 40(10):1276-1290.
12. Donnoly C, Stallman R. Bison, the YACC-compatible Parser Generator. Free Software Foundation, Cambridge, MA, 1995. http://www.math.utah.edu/docs/info/bison.toc.html.
13. Paxson V. Flex, Version 2.5, A Fast Scanner Generator. The Regents of the University of California, Berkeley, CA, 1995. http://www.math.utah.edu/docs/info/flex.toc.html.
14. Johnson DS, Trick MA (eds.). Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26). American Mathematical Society: Providence, RI, 1996.
15. Johnson DS, Aragon CR, McGeoch LA, Schevon C. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research 1991; 39(3):378-406.
16. Vaessens R, Aarts E, Lenstra JK. A local search template. Computers and Operational Research 1998; 25(11):969-979.
17. Andreatta AA, Carvalho SER, Ribeiro CC. A framework for the development of local search heuristics for combinatorial optimization problems. Proceedings of the 2nd Metaheuristics International Conference, Sophia-Antipolis, France, 1997. INRIA, 1997.
18. Michel L, van Hentenryck P. Localizer: A modeling language for local search. Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Schloss Hagenberg, Austria (Lecture Notes in Computer Science, vol. 1330). Springer: Berlin, 1997; 238-252.
19. Laburthe F, Caseau Y. SALSA: A language for search algorithms. Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP-98), Pisa, Italy (Lecture Notes in Computer Science, vol. 1152). Springer: Berlin, 1998; 310-324.
20. Musser DR, Derge GJ, Saini A, Stepanov A. STL Tutorial and Reference Guide (2nd edn). Addison-Wesley: Reading, MA, 2001.
21. ILOG. ILOG Optimization Suite - White Paper, 1998. http://www.ilog.com.
22. De Backer B, Furnon V, Shaw P. An object model for meta-heuristic search in constraint programming. Workshop On Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'99), Ferrara, Italy, 1999. University of Ferrara, 1999.
23. Laurent M, Van Hentenryck P. Localizer++: An open library for local search. Technical Report CS-01-02, Brown University, Providence, RI, 2001.
24. de Bruin A, Kindervater GAP, Trienekens HWJM, van der Goot RA, van Ginkel W. An object oriented approach to generic branch and bound. Technical Report EUR-FEW-CS-96-10, Erasmus University, Rotterdam, The Netherlands, 1996.
25. Ferland JA, Hertz A, Lavoie A. An object-oriented methodology for solving assignment type problems with neighborhood search techniques. Operations Research 1996; 44(2):347-359.
26. Fleurent C, Ferland JA. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26), Johnson DS, Trick MA (eds.). American Mathematical Society: Providence, RI, 1996; 619-652.
27. Voudouris C, Dome R. HSF: A generic framework to easily design meta-heuristic methods. Proceedings of the 4th Metaheuristics International Conference (MIC-01), Porto, Portugal, 2001. University of Porto, 2001; 423-428.
28. Fink A, Voß S. HotFrame: A heuristic optimization framework. Optimization Software Class Libraries (Operations Research/Computer Science Interfaces Series), Voß S, Woodruff DL (eds.). Kluwer: Boston, MA, 2002; 81-154.
29. Fink A, Voß S, Woodruff DL. Building reusable software components for heuristic search. Proceedings of Operations Research 1998 (OR98), Zürich, Switzerland, Kall P, Lüthi H-J (eds.). Springer: Berlin, 1999; 210-219.
30. Andreatta AA, Carvalho SER, Ribeiro CC. A framework for local search heuristics for combinatorial optimization problems. Optimization Software Class Libraries (Operations Research/Computer Science Interfaces Series), Voß S, Woodruff DL (eds.). Kluwer: Boston, MA, 2002.
31. Voudouris C, Dorne R. Integrating heuristic search and one-way constraints in the iopt toolkit. Optimization Software Class Libraries (Operations Research/Computer Science Interfaces Series), Voß S, Woodruff DL (eds.). Kluwer: Boston, MA, 2002; 177-191.
32. Jünger M, Thienel S. The ABACUS system for branch-and-ct-and-price algorithms in integer programming and combinatorial optimization. Software - Practice and Experience 2000; 30:1325-1352.
33. Smith DR. KIDS: A semi-automatic program development system. IEEE Transactions on Software Engineering 1990; 16(9):1024-1043.
34. Schaerf A, Cadoli M, Lenzerini M. LOCAL++: A C++ framework for local search algorithms. Software - Practice and Experience 2000; 30(3):233-257.
35. Hansen P, Mladenović N. An introduction to variable neighbourhood search. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Voß S, Martello S, Osman IH, Roucairol C (eds.). Kluwer: Boston, MA, 1999; 433-458.
36. Crainic TG, Toulouse M, Gendreau M. Toward a taxonomy of parallel tabu search heuristics. INFORMS Journal of Computing 1997; 9(1);61-72.
37. Verhoeven MGA, Aarts EHL. Parallel local search. Journal of Heuristics 1995; 1:43-65.
38. Schappert A, Sommerland P, Pree W. Automated framework development. Proceedings of the 1995 Symposium on Software Reusability (ACM Software Engineering Notes) 1995; 20:123-127.