A heuristic algorithm for solving triangle packing problem

DOI10.1155/2013/686845zbMath1417.90154OpenAlexW2137649307WikidataQ58921735 ScholiaQ58921735MaRDI QIDQ2312258

Jianqiang Dong, Shuai Liu, Yuqiang Luo, Xiaozhuo Qi, Rui-Min Wang

Publication date: 5 July 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/686845

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Algorithms in computer science (68W99)

Related Items (1)

A new quasi-human algorithm for solving the packing problem of unit equilateral triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Tighter bounds of the First Fit algorithm for the bin-packing problem
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Compaction and separation algorithms for non-convex polygons and their applications

This page was built for publication: A heuristic algorithm for solving triangle packing problem