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

A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem

Author

Listed:
  • Chiranjit Changdar
  • G.S. Mahapatra
  • Rajat Kumar Pal

Abstract

This paper presents an advanced ant colony optimisation approach to solve sub-tour constant travelling salesman problem (SCTSP) with time limit in fuzzy environment. In SCTSP, there is a set of sub-tours (two cities for each sub-tour). A traveller must complete his/her tour with predetermined sequence of distinct sub-tours. In this proposed model, the total time of travel must not exceed a predetermined time limit, i.e., the salesman should maintain a maximum time limit to complete his/her tour. In this paper, we present a modified form of the basic ACO algorithm, obtained by introducing a new operation known as restoring operation for solving the problem. In restoring operation, the low-quality path/solution given by any ant is replaced by a nearest better solution. The proposed problem is solved by considering fuzzy travel costs and time. Fuzzy credibility measure and graded mean integration method are used to obtain optimal decision. Computational results with different datasets are presented for illustration.

Suggested Citation

  • Chiranjit Changdar & G.S. Mahapatra & Rajat Kumar Pal, 2017. "A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 11(3), pages 310-331.
    • Handle: RePEc:ids:ijmore:v:11:y:2017:i:3:p:310-331
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87204
    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:11:y:2017:i:3:p:310-331. 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.