The Optimal Solution of TSP Using the New Mixture Initialization and Sequential Transformation Method in Genetic Algorithm

  • Kang R
  • Jung C
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

TSP is a problem finding out the shortest distance out of possible courses where one starts a certain city and turns back to a starting city, visiting every city only once among N cities. This paper proposes the new method using both population initialization and...

Cite

CITATION STYLE

APA

Kang, R.-G., & Jung, C.-Y. (2006). The Optimal Solution of TSP Using the New Mixture Initialization and Sequential Transformation Method in Genetic Algorithm (pp. 1181–1185). https://doi.org/10.1007/978-3-540-36668-3_157

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free