IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-00939-6_1.html
   My bibliography  Save this book chapter

A Bicriteria Traveling Salesman Problem with Sequence Priorities

In: Metaheuristics in the Service Industry

Author

Listed:
  • Heinz Schmitz

    (Fachhochschule Trier)

  • Sebastian Niemann

    (Fachhochschule Trier)

Abstract

This paper introduces a bicriteria version of the classical Traveling Salesman Problem (TSP) which is motivated by various applications in the context of service delivery. The additional objective allows to take priorities among locations into account while minimizing the costs of traveling. For this, cities in the input are given in a strict ordering, e.g., due to arrival times of delivery requests. The goal is to compute the set of efficient solutions when both objectives are optimized simultaneously. To the best of our knowledge, this variation of TSP has not been studied before. After making the notion of priorities precise, we present a local-search algorithm to approximate the set of non-dominated solutions.While still being conceptionally easy, our algorithm employs different means of intensification and diversification in a way we call breadth-first local search. We maintain one candidate solution for each possible value of the additional objective in a polynomially-sized archive, and try to improve this set towards the Pareto front. Experimental results with test data from TSPLIB show that this is a reasonable approach to attack the problem.

Suggested Citation

  • Heinz Schmitz & Sebastian Niemann, 2009. "A Bicriteria Traveling Salesman Problem with Sequence Priorities," Lecture Notes in Economics and Mathematical Systems, in: Kenneth Sörensen & Marc Sevaux & Walter Habenicht & Martin Josef Geiger (ed.), Metaheuristics in the Service Industry, chapter 1, pages 1-14, Springer.
    • Handle: RePEc:spr:lnechp:978-3-642-00939-6_1
    DOI: 10.1007/978-3-642-00939-6_1
    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.

    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:lnechp:978-3-642-00939-6_1. 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.