A Heuristic Algorithm for Solving Triangle Packing Problem

Table 1

Experimental data.

Example no.	Edge lengths of rectangle containers	Edge lengths of triangles	Graphic outputs	Algorithm results
1	80, 80	(80.0,56.6,56.6)×2; (40.0,40.0,56.7)×4	Figure 8(a)	two triangles left; Utilization: 75.0%; Computing time: 0.008 sec
2	700, 400	225.0, 275.5, 160.0	Figure 8(b)	one triangle left; Utilization: 71.4%; Computing time: 0.006 sec
		166.0, 174.9, 55.0
		278.9, 134.0, 245.0
		229.0, 190.0, 299.0
		108.0, 260.0, 279.7
		296.0, 278.2, 300.4
		167.6, 293.2, 273.5
3	200, 200	(100.0,100.0,100.0)×6	Figure 8(c)	Success!; Utilization: 65.0%; Computing time: 0.005 sec
4	400, 300	166.0, 174.9, 55.0	Figure 8(d)	Success!; Utilization: 96.7%; Computing time: 0.007 sec
		278.9, 134.0, 245.0
		229.0, 190.0, 299.0
		108.0, 260.0, 279.7
		296.0, 278.2, 300.4
		167.6, 293.2, 273.