Open access peer-reviewed chapter

Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm

By Yingzi Wei and Kanfeng Gu

Published: November 1st 2008

DOI: 10.5772/6342

Downloaded: 2899

© 2008 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided the original is properly cited and derivative works building on this content are distributed under the same license.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Yingzi Wei and Kanfeng Gu (November 1st 2008). Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm, Greedy Algorithms, Witold Bednorz, IntechOpen, DOI: 10.5772/6342. Available from:

chapter statistics

2899total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules

By Yuxiong He, and Wen-Jing Hsu

Related Book

First chapter

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

By Rajesh Matai, Surya Singh and Murari Lal Mittal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us