Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ines Alaya"'
Publikováno v:
Evolutionary Intelligence. 15:2077-2088
The traveling salesman problem (TSP) is a typical problem in combinatorial optimization. The unique objective of the traditional TSP is to minimize the tour distance. When more than one objective is taken into account to be optimized simultaneously,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c5f7bc92aee40282a9417de69fa7831
https://doi.org/10.1007/s12065-021-00613-x
https://doi.org/10.1007/s12065-021-00613-x
Publikováno v:
Engineering Optimization. 54:524-538
Competition among companies leads to a race in order to improve the management system of their production with respect to the delivery time. In the last few decades, the optimization of production ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6f05195d3d75e6a7e761af51f2806c1
https://doi.org/10.1080/0305215x.2021.1884243
https://doi.org/10.1080/0305215x.2021.1884243
Publikováno v:
Evolutionary Intelligence. 12:253-272
The multiobjective multidimensional knapsack problem (MOMKP) is an extension of the multiobjective knapsack problem that consists in selecting a subset of items in order to maximize m objective functions. The MOMKP creates an additional difficulty th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d01122b6aff0c74adac81aabe02da299
https://doi.org/10.1007/s12065-019-00222-9
https://doi.org/10.1007/s12065-019-00222-9
Publikováno v:
ICSOFT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53c6e617f116ed686edf8a3b5bd3d5a1
https://doi.org/10.5220/0010517504650472
https://doi.org/10.5220/0010517504650472
Publikováno v:
ICSOFT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e50bc6fed6e67ef2469ab899df9a334e
https://doi.org/10.5220/0009831803190327
https://doi.org/10.5220/0009831803190327
Publikováno v:
ICSOFT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c8c898fbf95af5573e307b7208918f0
https://doi.org/10.5220/0009831303070318
https://doi.org/10.5220/0009831303070318
Publikováno v:
GECCO (Companion)
The Traveling Thief Problem (TTP) is a new problem recently proposed in the literature. The TTP combines two well-known optimization problems: the knapsack problem (KP) and the travelling salesman problem (TSP). In this paper, new hybrid ant colony a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6b28504f459622eec6f6dcf19c8a84a
https://doi.org/10.1145/3319619.3326785
https://doi.org/10.1145/3319619.3326785
Publikováno v:
Advances in Science, Technology and Engineering Systems, Vol 3, Iss 6 (2018)
Metaheuristic hybridization has recently been widely studied and discussed in many research works as it allows benefiting from the strengths of metaheuristics by combining adequately the different algorithms. MMACS is a new hybrid ant colony optimiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8b25cdb07c5bc0bae5d08d78cbac9cc
https://astesj.com/v03/i06/p01/
https://astesj.com/v03/i06/p01/
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319936406
ICSOFT (Selected Papers)
ICSOFT (Selected Papers)
Multiobjective optimization has grown to become an active research area since almost all real-world problems have multiple, usually conflicting, objectives. In this paper, we focus on the multiobjective knapsack problem, we solve instances with two,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2562f2ee16e065d27b4fd1d32cdbed72
https://doi.org/10.1007/978-3-319-93641-3_10
https://doi.org/10.1007/978-3-319-93641-3_10
