Development of Optimization Software to Solve Practical Packing and Cutting Problems

DOI

10.2991/aiie-15.2015.104How to use a DOI?

Keywords

optimzation software; class library; metaheuristc algorithms; evolutionary algorithms; packing problem

Abstract

The paper describes a developed optimization software intended to solve various practical problems of recourse allocation. In a basis of the software lays a designed class library for solving different recourse allocation problems including packing and cutting problems. Due to belonging of all packing problems to the class of NP-completed problems they cannot be solved in polynomial time depending on their size. To solve such problems are usually used metaheuristic algorithms of multicriteria optimization. The designed class library allows to solve all packing and problems using a variety of metaheuristic algorithms which makes the developed software universal with respect to types of solved problems and algorithms used.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - V.A. Chekanin
AU  - A.V. Chekanin
PY  - 2015/07
DA  - 2015/07
TI  - Development of Optimization Software to Solve Practical Packing and Cutting Problems
BT  - Proceedings of the 2015 International Conference on Artificial Intelligence and Industrial Engineering
PB  - Atlantis Press
SP  - 379
EP  - 382
SN  - 1951-6851
UR  - https://doi.org/10.2991/aiie-15.2015.104
DO  - 10.2991/aiie-15.2015.104
ID  - Chekanin2015/07
ER  -