Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Chakir Tajani"'
This paper is about improving the performance of genetic algorithm (GA) to solve the fixed-charge transportation problem (FCTP). Several approaches have been developed, based on adaptation and improvement of genetic operators. We propose a new geneti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6adc6850b713f4f8fdd2caa5ec6247c3
https://zenodo.org/record/8128895
https://zenodo.org/record/8128895
Publikováno v:
Annals of the West University of Timisoara: Mathematics and Computer Science, Vol 55, Iss 1, Pp 129-147 (2017)
In this work, we are interested in a class of problems of great importance in many areas of industry and engineering. It is the invese problem for the biharmonic equation. It consists to complete the missing data on the inaccessible part from the mea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09d74c09d6f3a7eeb3a9c4996f64bd17
https://doi.org/10.1515/awutm-2017-0010
https://doi.org/10.1515/awutm-2017-0010
Publikováno v:
International Journal of Open Problems in Computer Science and Mathematics. 10:38-53
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cab9d4edea6581b0d06351becee278a6
https://doi.org/10.12816/0041835
https://doi.org/10.12816/0041835
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030119270
We are interested in improving the performance of genetic algorithm (GA) to solve a combinatirial optimization problem. Several approaches have been developed based on the adaptation and improvement of different standard genetic operators. However, G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99024e354bef9a42d4d2d50e40f33f60
https://doi.org/10.1007/978-3-030-11928-7_82
https://doi.org/10.1007/978-3-030-11928-7_82
Publikováno v:
International Journal of Open Problems in Computer Science and Mathematics. 9:42-55
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e14a09aeb4ecf1ead2e31445c70f659c
https://doi.org/10.12816/0041838
https://doi.org/10.12816/0041838
Publikováno v:
American Journal of Computational Mathematics. :88-94
This paper is interested at the Cauchy problem for Laplace’s equation, which is to recover both Dirichlet and Neumann conditions on the inaccessible part of the boundary (inner part) of an annular domain from the over specified conditions on the ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b218f2d7b3adf6e57a096e1929aea5c
https://doi.org/10.4236/ajcm.2012.22012
https://doi.org/10.4236/ajcm.2012.22012
Publikováno v:
International Journal of Electrical and Computer Engineering (IJECE). 8:5351
In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cedcda550c09f9b309599d2d422b4f39
https://doi.org/10.11591/ijece.v8i6.pp5351-5358
https://doi.org/10.11591/ijece.v8i6.pp5351-5358
Autor:
Jaafar Abouchabaka, Chakir Tajani
This work concerns the use of the iterative algorithm (KMF algorithm) proposed by Kozlov, Mazya and Fomin to solve the Cauchy problem for Laplaces equation. This problem consists to recovering the lacking data on some part of the boundary using the o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c01bf60ceefd3521c200eb1a79e39a50
http://arxiv.org/abs/1405.3235
http://arxiv.org/abs/1405.3235