IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_45.html
   My bibliography  Save this book chapter

On a Technique for Finding Running Tracks of Specific Length in a Road Network

In: Operations Research Proceedings 2017

Author

Listed:
  • David Willems

    (University of Koblenz-Landau)

  • Oliver Zehner

    (University of Koblenz-Landau)

  • Stefan Ruzika

    (TU Kaiserslautern)

Abstract

Inner-city sports events such as skate nights, company races or bicycle races often take place on circular courses. Regular streets are blocked for normal traffic and only released for the active participants of the event. Often, the participants start and end at the same point. We present an algorithm to find running tracks of prespecified length in a general road network. This constitutes a simplification tool in the decision making process of finding adequate running tracks as the algorithm returns a number of possibilities from which organizers are able to choose the track that meets most requirements desired by the organizer. The returned solutions can further be used as input to additional (mulicriteria) optimization problems as, for example, finding tracks that do not exceed a given limit on the altitude difference or that avoid street turns that are to sharp.

Suggested Citation

  • David Willems & Oliver Zehner & Stefan Ruzika, 2018. "On a Technique for Finding Running Tracks of Specific Length in a Road Network," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 333-338, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_45
    DOI: 10.1007/978-3-319-89920-6_45
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. R. Lewis & P. Corcoran, 2022. "Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks," Journal of Heuristics, Springer, vol. 28(3), pages 259-285, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-89920-6_45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.