@techreport{TD:7M7QJG,
	att_abstract={{This paper addresses a constrained two-dimensional (2D), non-guillotine restricted, packing problem, where a fixed set of small rectangles has to be paced into a larger stock rectangle so as to maximize the value of the rectangles packed. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization. The approach is tested on a set of instances taken from the literature and compared with other approaches. The experimental results validate the quality of the solutions and the effectiveness of the proposed algorithm. }},
	att_authors={mr5626},
	att_categories={},
	att_copyright={{}},
	att_copyright_notice={{}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={packing, non-guillotine cutting, cutting, genetic algorithm, 2-dimensional packing, heuristic},
	att_techdoc={true},
	att_techdoc_key={TD:7M7QJG},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:7M7QJG_DS1_2010-08-18T16:06:58.242Z.pdf},
	author={Mauricio Resende and José Gonçalves},
	institution={{}},
	month={December},
	title={{A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem}},
	year=2008,
}