Work

Multilevel Linked Data Structure for the Multidimensional Orthogonal Packing Problem

Year: 2014

Type: article

Abstract: The actual NP-completed orthogonal bin packing problem is considered in the article. In practice a solution of a large number of different practical problems, including problems in logistics and scheduling comes down to the bin packing problem. A decision of an any packing problem is represented as a placement string which contains a sequence of objects selected to pack. The article proposes a new multilevel linked data structure that improves the effectiveness of decoding of the placement string and as a consequence, increases the speed of packing generation. The new data structure is applicable for all multidimensional orthogonal bin packing problems.

Source: Applied Mechanics and Materials

DOI: 10.4028/www.scientific.net/amm.598.387

Authors: Vladislav A. Chekanin, Alexander V. Chekanin

Institution: Moscow State Technological University

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W1993470943

FWCI: 0.962

Cites: 10

Cited by: 9

Related to: 10