作者: Zhilei Ren , He Jiang , Jifeng Xuan , Zhongxuan Luo
DOI: 10.1007/978-3-642-15844-5_55
关键词:
摘要: Recent years have witnessed great success of ant based hyper heuristics applying to real world applications. Ant intend explore the heuristic space by traversing fully connected graph induced low level (LLHs). However, existing models treat LLH in an equivalent way, which may lead imbalance between intensification and diversification search procedure. Following definition meta heuristics, we propose Hyper with SpAce Reduction (AHSAR) adapt over space. AHSAR reduces replacing a bipartite graph, is Cartesian product two subsets. With reduction, enforces consecutive execution LLHs. We apply p-median problem, experimental results demonstrate that our algorithm outperforms from LLHs are extracted.