Adaptive simulated annealing with greedy search for the circle bin packing problem
Year of publication: |
2022
|
---|---|
Authors: | Yuan, Yong ; Tole, Kevin ; Ni, Fei ; He, Kun ; Xiong, Zhengda ; Liu, Jinfa |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 144.2022, p. 1-12
|
Subject: | Adaptive simulated annealing | Greedy search | Heuristics | Packing | Tangent occupying action | Heuristik | Packproblem | Packing problem | Simulation | Theorie | Theory | Operations Research | Operations research | Algorithmus | Algorithm |
-
A hybrid evolutionary algorithm for the two-dimensional packing problem
Kierkosz, Igor, (2014)
-
A beam search approach to solve the convex irregular bin packing problem with guillotine cuts
Bennell, J.A., (2018)
-
An adaptive selection approach for the 2D rectangle packing area minimization problem
Wei, Lijun, (2018)
- More ...
-
Adaptive large neighborhood search for solving the circle bin packing problem
He, Kun, (2021)
-
Bennett, Hayley, (2017)
-
The impact of government income transfers on tobacco and alcohol use : evidence from China
Myerson, Rebecca, (2020)
- More ...