| 1 | New Meta-Heuristic for Combinatorial Optimization Problems:Intersection Based Scaling显示文摘Combinatorial optimization problems are found in many application fields such as computer science, engineering and economy. In this paper, a new efficient meta-heuristic, Intersection-Based Scaling (IBS for abbreviation),is proposed and it can be applied to the combinatorial optimization problems. The main idea of IBS is to scale the size of the instance based on the intersection of some local optima, and to simplify the search space by extracting the intersection from the instance, which makes the search more efficient. The combination of IBS with some local search heuristics of different combinatorial optimization problems such as Traveling Salesman Problem (TSP) and Graph Partitioning Problem (GPP) is studied, and comparisons are made with some of the best heuristic algorithms and meta-heuristic algorithms. It is found that it has significantly improved the performance of existing local search heuristics and significantly outperforms the known best algorithms. | PengZou ZhiZhou Ying-YuWan Guo-LiangChen JunGu | 2004 | Journal of Computer Science & Technology2004，19，6： | 5 |
您所在的机构暂未开通此部分的功能，请联系管理员