IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v29y2023i4d10.1007_s10732-023-09516-9.html
   My bibliography  Save this article

A matheuristic approach for the family traveling salesman problem

Author

Listed:
  • Abtin Nourmohammadzadeh

    (University of Hamburg)

  • Malek Sarhani

    (Al Akhawayn University in Ifrane)

  • Stefan Voß

    (University of Hamburg)

Abstract

In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay.

Suggested Citation

  • Abtin Nourmohammadzadeh & Malek Sarhani & Stefan Voß, 2023. "A matheuristic approach for the family traveling salesman problem," Journal of Heuristics, Springer, vol. 29(4), pages 435-460, December.
    • Handle: RePEc:spr:joheur:v:29:y:2023:i:4:d:10.1007_s10732-023-09516-9
    DOI: 10.1007/s10732-023-09516-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-023-09516-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-023-09516-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:joheur:v:29:y:2023:i:4:d:10.1007_s10732-023-09516-9. 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.