Phi-functions for 2D objects formed by line segments and circular arcs (Q447557): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: D. Rodríguez-Gómez / rank | |||
Normal rank | |||
Property / review text | |||
Summary: We study the cutting and packing (C\&P) problems in two dimensions by using phi-functions. Our phi-functions describe the layout of given objects; they allow us to construct a mathematical model in which C\&P problems become constrained optimization problems. Here we define (for the first time) a complete class of basic phi-functions which allow us to derive phi-functions for all 2D objects that are formed by linear segments and circular arcs. Our phi-functions support translations and rotations of objects. In order to deal with restrictions on minimal or maximal distances between objects, we also propose adjusted phi-functions. Our phi-functions are expressed by simple linear and quadratic formulas without radicals. The use of radical-free phi-functions allows us to increase efficiency of optimization algorithms. We include several model examples. | |||
Property / review text: Summary: We study the cutting and packing (C\&P) problems in two dimensions by using phi-functions. Our phi-functions describe the layout of given objects; they allow us to construct a mathematical model in which C\&P problems become constrained optimization problems. Here we define (for the first time) a complete class of basic phi-functions which allow us to derive phi-functions for all 2D objects that are formed by linear segments and circular arcs. Our phi-functions support translations and rotations of objects. In order to deal with restrictions on minimal or maximal distances between objects, we also propose adjusted phi-functions. Our phi-functions are expressed by simple linear and quadratic formulas without radicals. The use of radical-free phi-functions allows us to increase efficiency of optimization algorithms. We include several model examples. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6076652 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58698818 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Ipopt / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/346358 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037738411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The geometry of nesting problems: a tutorial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved typology of cutting and packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rotational polygon overlap minimization and compaction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Irregular Packing Using the Line and Arc No-Fit Polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tools of mathematical modeling of arbitrary object packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Phi\)-functions for complex 2D-objects / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mathematical model and efficient algorithms for object packing problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing cylinders and rectangular parallelepipeds with distances between them into a given region / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering a polygonal region by rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:09, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Phi-functions for 2D objects formed by line segments and circular arcs |
scientific article |
Statements
Phi-functions for 2D objects formed by line segments and circular arcs (English)
0 references
4 September 2012
0 references
Summary: We study the cutting and packing (C\&P) problems in two dimensions by using phi-functions. Our phi-functions describe the layout of given objects; they allow us to construct a mathematical model in which C\&P problems become constrained optimization problems. Here we define (for the first time) a complete class of basic phi-functions which allow us to derive phi-functions for all 2D objects that are formed by linear segments and circular arcs. Our phi-functions support translations and rotations of objects. In order to deal with restrictions on minimal or maximal distances between objects, we also propose adjusted phi-functions. Our phi-functions are expressed by simple linear and quadratic formulas without radicals. The use of radical-free phi-functions allows us to increase efficiency of optimization algorithms. We include several model examples.
0 references
0 references
0 references
0 references
0 references
0 references