DIMMA-Implemented Metaheuristics for Finding Shortest Hamiltonian Path Between Iranian Cities Using Sequential DOE Approach for Parameters Tuning

Publisher： IGI Global_journal

E-ISSN： 1947-8291|2|2|74-92

ISSN： 1947-8283

Source： International Journal of Applied Metaheuristic Computing (IJAMC), Vol.2, Iss.2, 2011-04, pp. : 74-92

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

Finding the most vital node of a shortest path

By Nardelli E. Proietti G. Widmayer P.

Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. : 167-177

Elsevier

Access to resources Recommend Favorite

Tracking Deformable Templates Using a Shortest Path Algorithm

By Dubuisson-Jolly M-P. Gupta A.

Computer Vision and Image Understanding, Vol. 81, Iss. 1, 2001-01 ,pp. : 26-45

Academic Press

Access to resources Recommend Favorite

Detecting duplicate biological entities using Shortest Path Edit Distance

By Rudniy Alex Song Min Geller James

International Journal of Data Mining and Bioinformatics, Vol. 4, Iss. 4, 2010-07 ,pp. : 395-410

Inderscience Publishers

Access to resources Recommend Favorite

Optimization and evaluation of shortest path queries

By Chan Edward

The VLDB Journal, Vol. 16, Iss. 3, 2007-07 ,pp. : 343-369

Springer Publishing Company

Access to resources Recommend Favorite

Shortest Path Problems on a Polyhedral Surface

By Cook Atlas Wenk Carola

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 58-77

Springer Publishing Company

Access to resources Recommend Favorite