Standard

A Knapsack Problem for Rectangles under Center-of-Gravity Constraints. / Shperling, S. M.; Kochetov, Yu A.

In: Journal of Applied and Industrial Mathematics, Vol. 16, No. 3, 05.2022, p. 563-571.

Research output: Contribution to journal › Article › peer-review

Harvard

Shperling, SM & Kochetov, YA 2022, 'A Knapsack Problem for Rectangles under Center-of-Gravity Constraints', Journal of Applied and Industrial Mathematics, vol. 16, no. 3, pp. 563-571. https://doi.org/10.1134/S199047892203019X

APA

Shperling, S. M., & Kochetov, Y. A. (2022). A Knapsack Problem for Rectangles under Center-of-Gravity Constraints. Journal of Applied and Industrial Mathematics, 16(3), 563-571. https://doi.org/10.1134/S199047892203019X

Vancouver

Shperling SM, Kochetov YA. A Knapsack Problem for Rectangles under Center-of-Gravity Constraints. Journal of Applied and Industrial Mathematics. 2022 May;16(3):563-571. doi: 10.1134/S199047892203019X

Author

Shperling, S. M. ; Kochetov, Yu A. / A Knapsack Problem for Rectangles under Center-of-Gravity Constraints. In: Journal of Applied and Industrial Mathematics. 2022 ; Vol. 16, No. 3. pp. 563-571.

BibTeX

@article{12bde74955ca4c46800e60541790ad6a,
title = "A Knapsack Problem for Rectangles under Center-of-Gravity Constraints",
abstract = "We have a set of rectangles with predefined widths, lengths, and masses and a knapsack ofknown width and length. Our goal is to select a subset of items and find their packing into theknapsack without overlapping so as to minimize the total empty space in the knapsack. Thedeviation of the center of gravity of the items from the knapsack geometric center must not exceedsome threshold along both axes. We use item permutations to represent solutions and the skylineheuristic as a decoding procedure. The center-of-gravity constraint is relaxed and included intothe objective function with penalty. To find the best permutation, we apply the simulatedannealing algorithm with swap neighborhood and a special rule for returning into the feasibledomain. Computational results for test instances with known optimal solutions are discussed.",
keywords = "2D packing, center-of-gravity constraint, local search, skyline heuristic",
author = "Shperling, {S. M.} and Kochetov, {Yu A.}",
note = "Funding Information: The work was carried out within the framework of the state assignment for Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, project no. FWNF–2022–0019. Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",
year = "2022",
month = may,
doi = "10.1134/S199047892203019X",
language = "English",
volume = "16",
pages = "563--571",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

RIS

TY - JOUR

T1 - A Knapsack Problem for Rectangles under Center-of-Gravity Constraints

AU - Shperling, S. M.

AU - Kochetov, Yu A.

N1 - Funding Information: The work was carried out within the framework of the state assignment for Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, project no. FWNF–2022–0019. Publisher Copyright: © 2022, Pleiades Publishing, Ltd.

PY - 2022/5

Y1 - 2022/5

N2 - We have a set of rectangles with predefined widths, lengths, and masses and a knapsack ofknown width and length. Our goal is to select a subset of items and find their packing into theknapsack without overlapping so as to minimize the total empty space in the knapsack. Thedeviation of the center of gravity of the items from the knapsack geometric center must not exceedsome threshold along both axes. We use item permutations to represent solutions and the skylineheuristic as a decoding procedure. The center-of-gravity constraint is relaxed and included intothe objective function with penalty. To find the best permutation, we apply the simulatedannealing algorithm with swap neighborhood and a special rule for returning into the feasibledomain. Computational results for test instances with known optimal solutions are discussed.

AB - We have a set of rectangles with predefined widths, lengths, and masses and a knapsack ofknown width and length. Our goal is to select a subset of items and find their packing into theknapsack without overlapping so as to minimize the total empty space in the knapsack. Thedeviation of the center of gravity of the items from the knapsack geometric center must not exceedsome threshold along both axes. We use item permutations to represent solutions and the skylineheuristic as a decoding procedure. The center-of-gravity constraint is relaxed and included intothe objective function with penalty. To find the best permutation, we apply the simulatedannealing algorithm with swap neighborhood and a special rule for returning into the feasibledomain. Computational results for test instances with known optimal solutions are discussed.

KW - 2D packing

KW - center-of-gravity constraint

KW - local search

KW - skyline heuristic

UR - http://www.scopus.com/inward/record.url?scp=85144227929&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/616d0a4c-743f-31c8-9167-b937c4f06ab5/

U2 - 10.1134/S199047892203019X

DO - 10.1134/S199047892203019X

M3 - Article

AN - SCOPUS:85144227929

VL - 16

SP - 563

EP - 571

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 3

ER -

ID: 41152787