An investigation into dynamic yard crane deployment and comparisons between hill-climbing and best-first-search algorithms

Author： Yan Wei Huang Youfang He Junliang

Publisher： Inderscience Publishers

ISSN： 0952-8091

Source： International Journal of Computer Applications in Technology, Vol.32, Iss.4, 2008-11, pp. : 254-264

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Analyzing the Performance of Generalized Hill Climbing Algorithms

By Jacobson Sheldon H. Yücesan Enver

Journal of Heuristics, Vol. 10, Iss. 4, 2004-07 ,pp. : 387-405

Springer Publishing Company

Access to resources Recommend Favorite

The max-min hill-climbing Bayesian network structure learning algorithm

By Tsamardinos Ioannis

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 31-78

Springer Publishing Company

Access to resources Recommend Favorite

Global Optimization Performance Measures for Generalized Hill Climbing Algorithms

By Jacobson Sheldon H. Y¨cesan Enver

Journal of Global Optimization, Vol. 29, Iss. 2, 2004-06 ,pp. : 173-190

Springer Publishing Company

Access to resources Recommend Favorite

A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems

By Wang Hongfeng

Soft Computing, Vol. 13, Iss. 8-9, 2009-07 ,pp. : 763-780

Springer Publishing Company

Access to resources Recommend Favorite

On the best search strategy in parallel branch-and-bound:Best-First Search versus Lazy Depth-First Search

By Clausen J. Perregaard M.

Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite