Theoretical Convergence Analysis of a General Division–deletion Algorithm for Solving Global Search Problems

2006 ◽  
Vol 37 (1) ◽  
pp. 27-45 ◽  
Author(s):  
X. Yang ◽  
M. Sun
Keyword(s):  
Convergence Analysis ◽  
Global Search ◽  
Search Problems ◽  
Deletion Algorithm

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

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.

Convergence Analysis and Comparison of Evolutionary Algorithms Based on Relation Model

2011 ◽  
Vol 34 (5) ◽  
pp. 801-811 ◽  
Author(s):  
Han HUANG ◽  
Zhi-Yong LIN ◽  
Zhi-Feng HAO ◽  
Yu-Shan ZHANG ◽  
Xue-Qiang LI
Keyword(s):  
Evolutionary Algorithms ◽  
Convergence Analysis ◽  
Relation Model
Sign in / Sign up

Export Citation Format

Share Document