Skip to main content
  • 2544 Accesses

Abstract

This chapter studies the influence of solution representation, by comparing the genetic programming with the genetic algorithm, which employ tree representation and vector representation, respectively. We show that tree representation can lead to better running time than vector representation, on two classical combinatorial problems.

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

Access this chapter

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
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhi-Hua Zhou .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zhou, ZH., Yu, Y., Qian, C. (2019). Representation. In: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-13-5956-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-5956-9_9

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-5955-2

  • Online ISBN: 978-981-13-5956-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics