A New Hyperheuristic Algorithm for Cross-Domain Search Problems

Author(s):  
Andreas Lehrbaum ◽  
Nysret Musliu
Keyword(s):  
2011 ◽  
Author(s):  
N. Langerock ◽  
E. Vergauwe ◽  
P. Barrouillet

2004 ◽  
Author(s):  
Candice C. Morey ◽  
Nelson Cowan
Keyword(s):  

Author(s):  
Jeffrey L. Adler

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.


2013 ◽  
Vol 33 (9) ◽  
pp. 2511-2515 ◽  
Author(s):  
Zhiyu REN ◽  
Xingyuan CHEN ◽  
Dibin SHAN

2013 ◽  
Vol 32 (6) ◽  
pp. 1766-1768
Author(s):  
Guo-wei WANG ◽  
Man-jun XUE
Keyword(s):  

2013 ◽  
Author(s):  
Gary Luck
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document