Packing ellipses in an optimized convex polygon
Packing ellipses in an optimized convex polygon
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
Packing ellipses with arbitrary orientation into a convex polygonal container which has a given shape is considered. The objective is to find a minimum scaling (homothetic) coefficient for the polygon still containing a given collection of ellipses. New phi-functions and quasi phi-functions to describe non-overlapping and containment constraints are introduced. The packing problem is then stated as a continuous nonlinear programming problem. A solution approach is proposed combining a new starting point algorithm and a new modification of the LOFRT procedure (J Glob Optim 65(2):283–307,
2016
) to search for locally optimal solutions. Computational results are provided to demonstrate the efficiency of our approach. The computational results are presented for new problem instances, as well as for instances presented in the recent paper (
http://www.optimization-online.org/DB_FILE/2016/03/5348.pdf
,
2016
)....
Alternative Titles
Full title
Packing ellipses in an optimized convex polygon
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2217187347
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2217187347
Other Identifiers
ISSN
0925-5001
E-ISSN
1573-2916
DOI
10.1007/s10898-019-00777-y
