Local search of orthogonal packings using the lower bounds

Authors:
V. M. Kartak;M. A. Mesyagutov;E. A. Mukhacheva;A. S. Filippova
Affiliations:
Ufa State Technical University of Aviation, Ufa, Russia;Ufa State Technical University of Aviation, Ufa, Russia;Ufa State Technical University of Aviation, Ufa, Russia;Ufa State Technical University of Aviation, Ufa, Russia
Venue:
Automation and Remote Control
Year:
2009

Citing 6
Cited 1

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Recent advances on two-dimensional bin packing problems

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

Automation and Remote Control
Comparison of Certain Evolutionary Algorithms

Automation and Remote Control
Sufficient Conditions for the Integer Round-Up Property to Be Violated for the Linear Cutting Stock Problem

Automation and Remote Control
Design of rectangular packings using decoders of block structure

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

Consideration was given to the problem of packing the rectangular half-infinite strip. It was suggested to solve it using a one-point evolutionary algorithm with search of the best solution in the neighborhood of the local lower bound. Proposed was an algorithm to construct this neighborhood including the packings obtained by solving a special problem of one-dimensional cutting. Its solution was shown to be the local lower bound in the considered neighborhood. An improved global lower bound was proposed. The results of numerical modeling were presented. The record value obtained was compared with the global bounds.