Skip to main content

Eulerian Cycles

  • Chapter
  • 1260 Accesses

Part of the Natural Computing Series book series (NCS)

Abstract

In this chapter, we analyze stochastic search algorithms on arc routing problems. For such problems, the choice of a good representation is not straightforward, and it has a large impact on the success of stochastic search algorithms. The Eulerian cycle problems is the simplest problem belonging to the wide class of arc routing problems, and we consider this problem as an example of how the choice of the representation influences the runtime of stochastic search algorithms.

Keywords

  • Perfect Match
  • Mutation Operator
  • Search Point
  • Local Operation
  • Adjacency List

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-16544-3_9
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-16544-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Hardcover Book
USD   99.99
Price excludes VAT (USA)

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 Carsten Witt .

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, F., Witt, C. (2010). Eulerian Cycles. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16544-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16543-6

  • Online ISBN: 978-3-642-16544-3

  • eBook Packages: Computer ScienceComputer Science (R0)