A Survey of Complex Packing Problems with Behavioral Constraints
Complex packing problems (CPP)are restricted bv varioils behavioral constraints(such as inertia,balance.stability,vibration,electromagnetic field,temperature field)besides conventional requirements of non-overlapping and space utilization emciency.Based on relevant literatures.we present this survey.Firstly the typical examples of CPP are described.Then we introduce solution algorithms of CPP such as heuristic algorithm.graph theory algorithm,simulated annealing algorithm,genetic algorithm,human-computer interaction.Finally we discuss some aspects of prospective development in this area.
pacifing algorithms constraint
Zhiqin Qian Heng Cao Lizong lin
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
539-542
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）