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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights 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)