Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kevin Tole"'
Publikováno v:
Tehnički Vjesnik, Vol 28, Iss 5, Pp 1647-1653 (2021)
In this study, we used a particle swarm optimization (PSO) algorithm to address a variation of the non-deterministic polynomial-time NP-hard traveling tournament problem, which determines the optimal schedule for a double round-robin tournament, for
Externí odkaz:
https://doaj.org/article/2525075ed1f649c78ab7807f921a20cf
Publikováno v:
Computers & Industrial Engineering. 176:109004
Publikováno v:
Computers & Operations Research. 144:105826
We introduce a new bin packing problem, termed the circle bin packing problem with circular items (CBPP-CI). The problem involves packing all the circular items into multiple identical circle bins as compact as possible with the objective of minimizi
Publikováno v:
Computers & Operations Research. 127:105140
We address a new packing problem variant known as the 2D circle bin packing problem (2D-CBPP), which involves packing circles into multiple square bins as densely as possible so as to minimize the number of bins used. To this end, we propose an adapt