文件名称：On metaheuristic algorithms for combinatorial optimization problems
文件大小：288KB
文件格式：PDF
更新时间：2024-07-19 15:20:48
学术 论文
On metaheuristic algorithms for combinatorial optimization problems On Metaheuristic Algorithms for Combinatorial Optimization Problems Mutsunori Yagiura and Toshihide Ibaraki Graduate School of Informatics, Kyoto University, Kyoto, 606-8501 Japan SUMMARY Metaheuristic algorithms are widely recognized as one of the most practical approaches for combinatorial optimization problems. Among representative metaheuris- tics are genetic algorithms, simulated annealing, tabu search, and so on. I