Zobrazeno 1 - 10
of 10 655
pro vyhledávání: '"knapsack problem"'
Publikováno v:
Journal of Humanitarian Logistics and Supply Chain Management, 2024, Vol. 14, Issue 4, pp. 399-418.
Publikováno v:
Jisuanji kexue yu tansuo, Vol 18, Iss 6, Pp 1526-1542 (2024)
The group theory-based optimization algorithm (GTOA) is a discrete evolutionary algorithm designed by group theory methods, which is very suitable for solving combinatorial optimization problems with integer vectors as feasible solutions. In order to
Externí odkaz:
https://doaj.org/article/2170a4740a6a49b58df98008957f5e88
Autor:
Kunal Das, Sahil Zaman, Alex Khan, Arindam Sadhu, Subhasree Bhattacharjee, Faisal Shah Khan, Bikramjit Sarkar
Publikováno v:
IET Quantum Communication, Vol 5, Iss 1, Pp 19-37 (2024)
Abstract SARS‐CoV‐2 epidemic (severe acute respiratory corona virus 2 syndromes) has caused major impacts on a global scale. Several countries, including India, Europe, U.S.A., introduced a full state/nation lockdown to minimise the disease trans
Externí odkaz:
https://doaj.org/article/4f6df21c6bd94e52b9cec1b2c975476d
Publikováno v:
IEEE Access, Vol 12, Pp 148155-148166 (2024)
To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal solution
Externí odkaz:
https://doaj.org/article/1087fe5433af4e8ea1ff057410933306
Publikováno v:
IEEE Access, Vol 12, Pp 139154-139164 (2024)
Complex optimization problems, especially those encountered in real-life scenarios, pose significant challenges due to their multifaceted nature and the involvement of numerous variables. In such contexts, the application of intelligent optimization
Externí odkaz:
https://doaj.org/article/5a370fd18c8e421998a223952ef86c64
Publikováno v:
IEEE Access, Vol 12, Pp 97678-97690 (2024)
Combinatorial optimization has wide applications from industry to natural science. Ising machines bring an emerging computing paradigm for efficiently solving a combinatorial optimization problem by searching a ground state of a given Ising model. Cu
Externí odkaz:
https://doaj.org/article/f58101e1dcf641c88934986210ab27ff
Publikováno v:
IEEE Access, Vol 12, Pp 15493-15508 (2024)
As optimization problems become more complicated and extensive, parameterization becomes complex, resulting in a difficult task requiring significant amounts of time and resources. In this paper we propose a heuristic search algorithm we call MCSA (M
Externí odkaz:
https://doaj.org/article/51cfbed96a7c4e4fb04548682055ff37
Publikováno v:
Mathematics, Vol 12, Iss 22, p 3538 (2024)
The knapsack problem is a typical bi-objective combinatorial optimization issue, wherein maximizing the value of the packed items is achieved concurrently with minimizing the weight of the load. Due to the conflicting objectives of the knapsack probl
Externí odkaz:
https://doaj.org/article/fec40f620af44aa489176292df205f84
Publikováno v:
Algorithms, Vol 17, Iss 11, p 478 (2024)
The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm. This paper proposes an enhance
Externí odkaz:
https://doaj.org/article/cfa97100ccad46ef900d3a84c0f1deda