Book ChapterOPEN ACCESS

Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme

  • Liu Y
InTech, (2008)
DOI: 10.5772/5577
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

A Modified Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem.

Cite

CITATION STYLE

APA

Liu, Y.-H. (2008). Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme. In Traveling Salesman Problem. InTech. https://doi.org/10.5772/5577

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