Skip to main content
SpringerLink
Log in

Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems

  • Conference paper
Book cover Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

Generalized Traveling Salesman Problem (GTSP) is one of the challenging combinatorial optimization problems in a lot of applications. In general, GTSP is more complex than Traveling Salesman Problem (TSP). In this paper, a novel hybrid chromosome genetic algorithm (HCGA), in which the hybrid binary and integer codes are adopted, is proposed as an improvement of generalized chromosome genetic algorithm (GCGA). In order to examine the effectiveness of HCGA, 16 benchmark problems are simulated. The experimental results show that HCGA can perform better than GCGA does in solving GTSP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Henry-Labordere, A.L.: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RAIRO B 2, 43–49 (1969)

    Google Scholar 

  2. Saksena, J.P.: Mathematical model of scheduling clients through welfare agencies. CORS Journal 8, 185–200 (1970)

    MathSciNet  Google Scholar 

  3. Srivastava, S.S.S., Kumar, R.C.G., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS Journal 7, 97–101 (1969)

    MathSciNet  Google Scholar 

  4. Easwaran, M., Pitt, J., Poslad, S.: The agent service brokering problem as a generalized travelling salesman problem. In: Proceedings of the Third Annual Conference on Autononlous Agents, Seattle WA, USA, pp. 414–415 (1999)

    Google Scholar 

  5. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized traveling salesman problem. J. Oper. Res. Soc. 47, 1461–1467 (1996)

    MATH  Google Scholar 

  6. Wu, C.G., Liang, Y.C., Lee, H.P., Lu, C.: Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Physical Review E 70, 016701 (2004)

    Article  Google Scholar 

  7. Fischetti, M., Salazar, J.J., Toth, P.: Branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45(3), 378–394 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Laporte, G., Nobert, Y.: Generalized traveling salesman through n sets of nodes: an integer programming approach. INFOR 21, 61–75 (1983)

    MATH  Google Scholar 

  9. Laporte, G., Mercure, H., Nobert, Y.: Generalized traveling salesman problem through n sets of nodes: the asymmetrical cases. Discrete Appl. Math. 18, 185–197 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Working paper, University of Bologna (1993)

    Google Scholar 

  11. Fischetti, M., Salazar, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks 26, 113–123 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Renaud, J., Boctor, F.F.: An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operational Research 108, 571–584 (1998)

    Article  MATH  Google Scholar 

  13. Noon, C.E., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR 31, 39–44 (1993)

    MATH  Google Scholar 

  14. Lien, Y., Ma, E., Wah, B.W.S.: Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Information Science 74, 177–189 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Dimitrijevic, V., Saric, Z.: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Information Science 102, 105–110 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Reinelt, G.: TSPLIB. A traveling salesman problem library. ORSA Journal on Computing 3(4), 376–384 (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, South China University of Technology, Guangzhou, 510640, P.R. China

    Han Huang

  2. College of Mathematical Science, South China University of Technology, Guangzhou, 510640, P.R. China

    Xiaowei Yang, Zhifeng Hao & Xi Zhao

  3. College of Computer Science and Technology, Jilin University, Changchun, 130012, P.R. China

    Chunguo Wu & Yanchun Liang

Authors
  1. Han Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaowei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhifeng Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chunguo Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yanchun Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xi Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, H., Yang, X., Hao, Z., Wu, C., Liang, Y., Zhao, X. (2005). Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_16

Download citation

  • DOI: https://doi.org/10.1007/11539902_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation