Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Soukaina Laabadi"'
Publikováno v:
Foundations of Computing and Decision Sciences. 47:247-269
The growing need for profit maximization and cost minimization has made the optimization field very attractive to both researchers and practitioners. In fact, many authors were interested in this field and they have developed a large number of optimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::078213d250ffb2014f0fb79881c8629a
https://doi.org/10.2478/fcds-2022-0014
https://doi.org/10.2478/fcds-2022-0014
Publikováno v:
Procedia Computer Science. 167:809-818
This work aims to propose a binary version of a new metaheuristic in order to solve the two-dimensional bin packing problem (2D-BPP) which is a NP-hard optimization problem in a strong sense. Various metaheuristics are dedicated to solve 2D-BPP, howe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::945236052340275f055697913a7c6c22
https://doi.org/10.1016/j.procs.2020.03.420
https://doi.org/10.1016/j.procs.2020.03.420
Publikováno v:
American Journal of Operations Research. :395-439
The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, telecommunications and other fields. In the 0/1 MKP, a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef2f8b846a5e443da51391f00c407fe9
https://doi.org/10.4236/ajor.2018.85023
https://doi.org/10.4236/ajor.2018.85023
Publikováno v:
Engineering Computations.
Purpose The purpose of this paper is to provide an improved genetic algorithm to solve 0/1 multidimensional knapsack problem (0/1 MKP), by proposing new selection and crossover operators that cooperate to explore the search space. Design/methodology/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c324b863ede4371b0138d5e970b472b
https://doi.org/10.1108/ec-01-2019-0021
https://doi.org/10.1108/ec-01-2019-0021
Publikováno v:
KI 2019: Advances in Artificial Intelligence ISBN: 9783030301781
KI
KI
The two-dimensional bin packing problem (2D-BPP) consists of packing, without overlapping, a set of rectangular items with different sizes into smallest number of rectangular containers, called “bins”, having identical dimensions. According to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f1576cea0b3aa699ea9c7ae0142da01
https://doi.org/10.1007/978-3-030-30179-8_17
https://doi.org/10.1007/978-3-030-30179-8_17
Autor:
Soukaina Laabadi
Publikováno v:
GOL
Given a set of items, the Bin-Packing problem is to find the smallest number of boxes called “bins” for an optimal packing of items. In this paper, we discuss a special case of Bin-Packing, when the objects have size and fragility. We cite the fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e84c4f809112406b3530a3c058ce180
https://doi.org/10.1109/gol.2016.7731722
https://doi.org/10.1109/gol.2016.7731722