Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem
In: Parallel Problem Solving from Nature, PPSN XI ISBN: 9783642158438 PPSN (1); (2010)
Online
unknown
Zugriff:
Recent years have witnessed great success of ant based hyper heuristics applying to real world applications. Ant based hyper heuristics intend to explore the heuristic space by traversing the fully connected graph induced by low level heuristics (LLHs). However, existing ant based models treat LLH in an equivalent way, which may lead to imbalance between the intensification and the diversification of the search procedure. Following the definition of meta heuristics, we propose an Ant based Hyper heuristic with SpAce Reduction (AHSAR) to adapt the search over the heuristic space. AHSAR reduces the heuristic space by replacing the fully connected graph with a bipartite graph, which is induced by the Cartesian product of two LLH subsets. With the space reduction, AHSAR enforces consecutive execution of intensification and diversification LLHs. We apply AHSAR to the p-median problem, and experimental results demonstrate that our algorithm outperforms meta heuristics from which LLHs are extracted.
Titel: |
Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem
|
---|---|
Autor/in / Beteiligte Person: | Jiang, He ; Xuan, Jifeng ; Luo, Zhongxuan ; Ren, Zhilei |
Link: | |
Quelle: | Parallel Problem Solving from Nature, PPSN XI ISBN: 9783642158438 PPSN (1); (2010) |
Veröffentlichung: | Springer Berlin Heidelberg, 2010 |
Medientyp: | unknown |
ISBN: | 978-3-642-15843-8 (print) |
DOI: | 10.1007/978-3-642-15844-5_55 |
Schlagwort: |
|
Sonstiges: |
|