| Abstract: |  This work focuses on multi-agent solution of bin packing problem. Firstly the architecture of multi-agent solver with three types of agents is defined and from this rchitecture an abstract algorithm is generated. The actual optimization process consists of three parts: allocation, delegation and negotiation. The proposed model was
applied to the solution of one-dimensional, two-dimensional and three-dimensional version of bin packing problem. No additional restrictions were taken into account. Various optimization techniques have been used in the negotiations - from simple heuristics through the application of exact algorithms to ILP optimization of related sub-problems. The results demonstrate that some implementations are able to compete with the best current solutions either by the quality of solutions, or by computation time.
|
|---|