Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2024.0007
A genetics algorithms for optimizing a function over the integer efficient set
Ali Zaidi
orcid.org/0000-0002-1101-5617
; Laboratory of Multiple Criteria Decision and Operations Research (AMCD and RO), Faculty of Mathematics, USTHB University, Bab-Ezzouar, BP32 El-Alia, 16122, Algiers, Algeria
Djamal Chaabane
; Laboratory of Multiple Criteria Decision and Operations Research (AMCD and RO), Faculty of Mathematics, USTHB University, Bab-Ezzouar, BP32 El-Alia, 16122, Algiers, Algeria
Larbi Asli
; LaMOS Laboratory, Faculty of Exact Sciences, University of Bejaia, Algeria
Lamine Idir
; Centre for Research in Amazigh Language and Culture (CRLCA), Algeria
Saida Matoub
; Centre for Research in Amazigh Language and Culture (CRLCA), Algeria
Sažetak
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.
Ključne riječi
DEGA Algorithms; efficient set; genetic algorithms; optimization over the efficient set
Hrčak ID:
317485
URI
Datum izdavanja:
27.5.2024.
Posjeta: 0 *