MALLBA: a software library to design efficient optimisation algorithms

International Journal of Innovative Computing and Applications

Volumn 1, Issue 1, 2007, Pages 74-85

  Alba, Enrique ^a   Luque, Gabriel ^a   García Nieto, José ^a   Ordóñez, Guillermo ^b   Leguizamón, Guillermo ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

metaheuristics; optimisation; parallelism; software library

Indexed keywords

EID: 42749087980     PISSN: 1751648X     EISSN: 17516498     Source Type: Journal    
DOI: 10.1504/IJICA.2007.013403     Document Type: Article

References (35)

1. Alba, E., Almeida, F., Blesa, M., Cotta, C., Díaz, M., Dorta, I., Gabarró, J., León, C., Luque, G., Petit, J., Rodríguez, C., Rojas, A. and Xhafa, F. (2006) ‘Efficient parallel LAN/WAN algorithms for optimization. The MALLBA project’, Parallel Computing, Vol. 32, Nos. 5–6, pp.415–440.
2. Alba, E. (Ed) (2005) Parallel Metaheuristics: A New Class of Algorithms, Parallel and Distributed Computing, Wiley.
3. Alba, E., Luque, G. and Troya, J.M. (2004) ‘Parallel LAN/WAN heuristics for optimization’, Parallel Computing, Vol. 30, Nos. 5–6, pp.611–628.
4. Arenas, M.G., Collet, P., Eiben, A.E., Jelasity, M., Merelo, J.J., Paechter, B., Preub, M. and Schoenauer, M. (2002) ‘Aframework for distributed evolutionary algorithms’, in J.J. Merelo, P. Adamidis, H.G. Beyer, J.L. Fernández-Villacañas and H.P. Schwefel (Eds). Seventh International Conference on Parallel Problem Solving from Nature, pp.665–675.
5. Bäck, T., Fogel, D.B. and Michalewicz, Z. (Eds) (1997) Handbook of Evolutionary Computation, Oxford University Press.
6. Bleuler, S., Laumanns, M., Thiele, L. and Zitzler, E. (2003) ‘PISA – a platform and programming language independent interface for search algorithms’, Proceedings of the Conference on Evolutionary Multi-Criterion Optimization (EMO’03), Faro, Portugal, pp.494–508.
7. Cahon, S., Talbi, E-G. and Melab, N. (2003) ‘PARADISEO: a framework for parallel and distributed biologically inspired heuristics’, IPDPS-NIDISC’03, Nize, France, p.144.
8. Cun, B.L. (2001) ‘Bob++ library illustrated by VRP’, European Operational Research Conference (EURO’2001), Rotterdam, p.157.
9. Daida, J.M., Ross, S.J. and Hannan, B.C. (1995) ‘Biological symbiosis as a metaphor for computational hybridization’, in L.J. Eshelman (Ed). Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, pp.328–335.
10. Davis, L. (Ed) (1991) Handbook of Genetic Algorithms, NewYork: Van Nostrand Reinhold.
11. Dorigo, M. and Stützle, T. (2004) Ant Colony Optimization, MIT Press.
12. Eberhart, R. and Shi, Y. (2000) ‘Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization’, Proceedings of the International Congress on Evolutionary Computation, Vol. 1, pp.84–88.
13. Eckstein, J., Phillips, C.A. and Hart, W.E. (2000) ‘PICO: an object-oriented framework for parallel branch and bound’, Technical Report, RUTCOR.
14. Eggermont, J., Eiben, A.E. and van Hemert, J.I. (1999) ‘A comparison of genetic programming variants for data classification’, in D.J. Hand, J.N. Kok and M.R. Berthold (Eds). Advances in Intelligent Data Analysis, Third International Symposium, IDA-99, Vol. 1642, Amsterdam, The Netherlands: Springer-Verlag, pp.281–290.
15. Fink, A., Vo, S. and Woodruff, D. (1999) ‘Building reusable software components for heuristc search’, in P. Kall and H-J. Luthi (Eds). Proceedings of the Operations Research, Belin: Springer, pp.210–219.
16. Gagne, C. and Parizeau, M. (2002) ‘Open BEAGLE: a new C++ evolutionary computation framework’, Proceedings of GECCO 2002, NewYork, NY, USA.
17. Gamma, E., Helm, R., Johnson, R. and Vlissides, J. (1995) Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley.
18. Gaspero, L.D. and Schaerf, A. (2001) ‘EasyLocal++: an object-oriented framework for the flexible design of local search algorithms and metaheuristics’, Forth Metaheuristics International Conference (MIC’2001), pp.287–292.
19. Glover, F. and Laguna, M. (1997) Tabu Search, 2nd edition, Boston: Kluwer.
20. González, J., León, C. and Rodríguez, C. (2004) ‘A distributed divide and conquer skeleton’, Seventh International Conference on Applied Parallel Computing, PARA’04, Vol. 3732 of LNCS, Springer, pp.481–489.
21. IBM (2000) ‘COIN: Common Optimization INterface for operations research’, Available at: http://oss.software.ibm.com/developerworks/opensource/coin/index.html.
22. Johnson, R. and Foote, B. (1988) ‘Designing reusable classes’, Journal of Object-Oriented Programming, Vol. 1, No. 2, pp.22–35.
23. Jones, M., McKeown, G. and Rayward-Smith, V. (2002) Optimization Software Class Libraries, Kluwer Academic Publishers, chapter Distribution, Cooperation, and Hybridization for Combinatorial Optimization, pp.25–58.
24. Kennedy, J. and Eberhart, R. (1995) ‘Particle Swarm Optimization’, Proceedings of the IEEE International Conference on Neural Networks, Vol. 4, Perth, Australia, pp.1942–1948.
25. Kennedy, J. and Eberhart, R. (1997) ‘A discrete binary version of the particle swarm algorithm’, IEEE International Conference on Systems, Man, and Cybernetics (SMC’97), Vol. 5, pp.4104–4109.
26. Khuri, S., Bäck, T. and Heitkötter, J. (1994) ‘An evolutionary approach to combinatorial optimization problems’, Proceedings of the 22nd ACM Computer Science Conference, Phoenix, AZ: ACM Press, pp.66–73.
27. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983) ‘Optimization by simulated annealing’, Science, Vol. 220, pp.671–680.
28. Klohs, K. (1998) ‘Parallel simulated annealing library’, Available at: http://www.uni-paderborn.de/fachbereich/AG/monien/SOFTWARE/PARSA/.
29. Laguna, M. and Martí, R. (2003) Scatter Search. Metodology and Implementations in C, Boston: Kluwer.
30. Levine, D. (1996) ‘PGAPack, parallel genetic algorithm library’, Available at: http://www.mcs.anl.gov/pgapack.html.
31. McPhee, N.F., Hopper, N.J. and Reierson, M.L. (1998) ‘Sutherland: an extensible object-oriented software framework for evolutionary computation’, in J. Koza (Ed). Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA: Morgan Kaufmann, p.241.
32. Tschöke, S. and Polzer, T. (1997) ‘Portable parallel branch-and-bound library’, Available at: http://www.uni-paderborn.de/cs/ag-monien/SOFTWARE/PPBB/introduction.html.
33. Voss, S. and Woodruff, D.L. (Eds) (2002) Optimization Software Class Libraries, Vol. 18 of Operations Research and Computer Science Interfaces, Boston: Kluwer Academic Publishers.
34. Wolpert, D.H. and Macready, W.G. (1997) ‘No free lunch theorems for optimization’, IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp.67–82.
35. The templar framework: http://www2.cmp.uea.ac.uk/˜templar/.