https://github.com/stevenroose/abc-mdgp

For a school assignment, we implemented an Artificial Bee Colony algorithms for solving the Maximally Diverse Grouping Problem in Java.
https://github.com/stevenroose/abc-mdgp

Last synced: about 1 month ago
JSON representation

For a school assignment, we implemented an Artificial Bee Colony algorithms for solving the Maximally Diverse Grouping Problem in Java.

• Host: GitHub
• URL: https://github.com/stevenroose/abc-mdgp
• Owner: stevenroose
• License: apache-2.0
• Created: 2014-03-25T02:37:04.000Z (almost 11 years ago)
• Default Branch: master
• Last Pushed: 2020-02-20T11:09:57.000Z (almost 5 years ago)
• Last Synced: 2024-10-30T20:24:07.585Z (3 months ago)
• Language: Java
• Size: 14.6 KB
• Stars: 3
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
ABC-MDGP

========

For a school assignment, we implemented an Artificial Bee Colony algorithm for solving the Maximally Diverse Grouping Problem in Java.

We implemented the ABC approach explained in "An artificial bee colony algorithm for the maximally diverse grouping problem" from Francisco J. Rodriguez, M. Lozano, C. Garcia-Martinez and Jonathan D. Gonzalez-Barrera in Information Science.

We used the framework created by the [Optsicom Project](http://www.optsicom.es/mdgp/). This library is not open source, so we could only use the binary Java archive provided on their website. The `mdgp_jors_2011.jar` archive is a required dependency for this project. It can be downloadere [here](http://www.optsicom.es/mdgp/mdgp_jors_2011.jar) ([mirror](http://grafo.etsii.urjc.es/optsicom/mdgp/mdgp_jors_2011.jar)).

We do not guarantee that the implementation is completelly correct or that it is efficient is it would be correct.

This implementation is made by Steven Roose and Tim Van Waes.