A genetics algorithms for optimizing a function over the integer efficient set
Abstract
In this paper, we propose an algorithm called Directional Exploration Genetic Algorithm (DEGA) to resolve a function $\Phi$ over the efficient set of a multi-objective integer linear programming problem (MOILP). DEGA algorithm belongs to evolutionary algorithms, which operate on the decision space by choosing the fastest improving directions that improve the objectives functions and $\Phi$ function. Two variants of this algorithm and a basic version of the genetic algorithm (BVGA) are performed and implemented in Python. Several benchmarks are carried out to evaluate the algorithm's performances and interesting results are obtained and discussed.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).