IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v26y2016i4p398-421.html
   My bibliography  Save this article

A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter

Author

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

Abstract

In this paper, we have presented a solid travelling salesman problem (STSP) with introduction of time-window and constraints. In STSP, a traveller can avail different conveyance for travelling. Also as constraint, a risk factor is there joining a path between two cities. During a tour, the traveller must ensure that the entire risk of the tour is within a prearranged risk level. Costs, time, and risk factor of travel using different conveyances are dissimilar and interval in nature. Finding a complete tour with minimum cost is the goal of the problem, where risk and time-window constraints are also to be satisfied. The standard genetic algorithm (GA) is modified by adding three features, namely refinement, immigration, and refreshing population, and thus a modified GA is devised to solve the intended problem. The efficiency of the algorithm is tested by using some model datasets from TSPLIB and some existing benchmark test functions.

Suggested Citation

  • Chiranjit Changdar & G.S. Mahapatra & Rajat Kumar Pal, 2016. "A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 26(4), pages 398-421.
    • Handle: RePEc:ids:ijores:v:26:y:2016:i:4:p:398-421
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=77688
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Khalid Mekamcha & Mehdi Souier & Hakim Nadhir Bessenouci & Mohammed Bennekrouf, 2021. "Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case," Operational Research, Springer, vol. 21(3), pages 1641-1661, September.
    2. Balasundaram Baranidharan & Ieva Meidute-Kavaliauskiene & Ghanshaym S. Mahapatra & Renata Činčikaitė, 2022. "Assessing the Sustainability of the Prepandemic Impact on Fuzzy Traveling Sellers Problem with a New Fermatean Fuzzy Scoring Function," Sustainability, MDPI, vol. 14(24), pages 1-17, December.

    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:ijores:v:26:y:2016:i:4:p:398-421. 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=170 .

    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.