A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
type: Item
instance of: scholarly article
title: A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
zbMATH Open document ID: 1470.90108
DOI: 10.1155/2014/308474
author: Xiaozhuo Qi
author: Yuqiang Luo
author: Jianqiang Dong
author: Ruimin Wang
published in: Abstract and Applied Analysis
publication date: 2019-02-14T00:00:00Z
review text: Summary: The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated). This paper adopts a new quasi-human strategy to study the packing problem of unit equilateral triangles. Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7022135
Wikidata QID: Q59038042
describes a project that uses: Packlib2
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/308474
OpenAlex ID: W2091326295
cites work: A typology of cutting and packing problems
cites work: An improved typology of cutting and packing problems
cites work: Best packing of rods into boxes
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: A general framework for bounds for higher-dimensional orthogonal packing problems.
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
cites work: A maximal-space algorithm for the container loading problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: PERM for solving circle packing problem
cites work: Disk packing in a square: a new global optimization approach
cites work: A heuristic quasi-physical strategy for solving disks packing problem
cites work: Solving container loading problems by block arrangement
cites work: Applying spatial representation techniques to the container packing problem
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
cites work: A population heuristic for constrained two-dimensional non-guillotine cutting
cites work: An effective quasi-human based heuristic for solving the rectangle packing problem
cites work: Computational Science – ICCS 2005
cites work: A heuristic algorithm for solving triangle packing problem
cites work: \(\mathcal H_\infty \) consensus control for multi-agent systems with missing measurements: the finite-horizon case
cites work: Dissipative control for state-saturated discrete time-varying systems with randomly occurring nonlinearities and missing measurements
cites work: State‐saturated H∞ filtering with randomly occurring nonlinearities and packet dropouts: the finite‐horizon case
cites work: Quantised recursive filtering for a class of nonlinear systems with multiplicative noises and missing measurements
cites work: Recursive filtering with random parameter matrices, multiple fading measurements and correlated noises
cites work: Finite-Horizon $H_{\infty} $ Filtering With Missing Measurements and Quantization Effects
description: scientific article; zbMATH DE number 7022135