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

Traveling Salesman Problems with Additional Ordering Constraints

In: Operations Research Proceedings 2017

Author

Listed:
  • Achim Hildenbrandt

    (INF 205)

Abstract

In the field of disaster logistics one often faces tasks which can be modeled as a TSP with additional ordering constraints. In this paper we therefore want to consider four different variants of the TSP. In detail we consider the Clustered TSP, the Ordered Clustered TSP, the Precedence Constraint TSP and the Target Visitation Problem. For each of these four problems we discuss IP models and examine the connections between them. We also present a branch-and-cut algorithm which can solve these problems to optimality.

Suggested Citation

  • Achim Hildenbrandt, 2018. "Traveling Salesman Problems with Additional Ordering Constraints," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 221-227, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_31
    DOI: 10.1007/978-3-319-89920-6_31
    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. Achim Hildenbrandt, 2019. "A branch-and-cut algorithm for the target visitation problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 209-242, September.
    2. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.

    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_31. 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.