The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures

Authors:
E. A. Mukhacheva;A. S. Mukhacheva
Affiliations:
Ufa State Aviation Engineering University, Ufa, Russia;Ufa State Aviation Engineering University, Ufa, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 2
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization

A Tabu Search Algorithm with Direct Representation for Strip Packing

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Local search of orthogonal packings using the lower bounds

Automation and Remote Control
Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Orthogonal packing of rectangles in a semi-infinite strip and its representation by block structures, which reduces the problem to a special linear cutting problem, are studied. Schemes for constructing local optimum search methods and deterministic and probabilistic algorithms are designed. The results of a numerical experiment corroborating the effectiveness of new methods are given.