Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square.

Applied Soft Computing(2018)

引用 21|浏览35
暂无评分
摘要
•A hybrid metaheuristic for the PUCS problem.•A The hybrid metaheuristic can reduce the employment of supplementary neighborhoods considerably.•An effient reduced insert neighborhood for PUCS.•The algorithm improves or matches all the world records of 68 benchmark instances.
更多
查看译文
关键词
Metaheuristic,Tabu search,Variable neighborhood search,Cutting and packing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要