IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v17y2020i2p153-169.html
   My bibliography  Save this article

Maximal covering salesman problems with average travelling cost constrains

Author

Listed:
  • Mostafa Dastmardi
  • Mohammad Mohammadi
  • Bahman Naderi

Abstract

We study the maximal covering salesman problem with the average travelling cost constraints (MCSPATCC) where the objective is to find a subset of customers with their tour so that the number of covered demand points is maximised. This paper presents a mathematical model to select a profitable subset of demand points to be covered. We also propose an effective heuristic algorithm with three elimination methods to remove unprofitable demand points. The proposed algorithm is based on the genetic algorithm (GA) hybridised with different local search strategies to solve this problem. Parameters of the algorithm are analysed for calibration by the Taguchi method. Extensive computational experiments, on a set of standard problems, have indicated the effectiveness of our algorithm.

Suggested Citation

  • Mostafa Dastmardi & Mohammad Mohammadi & Bahman Naderi, 2020. "Maximal covering salesman problems with average travelling cost constrains," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 17(2), pages 153-169.
    • Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:153-169
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=109693
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijmore:v:17:y:2020:i:2:p:153-169. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.