IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v14y2023i6d10.1007_s13198-023-02161-2.html
   My bibliography  Save this article

A comparative analysis of genetic algorithms on a case study of asymmetric traveling salesman problem

Author

Listed:
  • Amit Raj

    (Central University of Haryana)

  • Parul Punia

    (Central University of Haryana)

  • Pawan Kumar

    (Central University of Haryana)

Abstract

In the present paper, the genetic algorithm and some of its variants i.e. adaptive genetic algorithm, binary-coded genetic algorithm and real-coded genetic algorithm are applied to the Asymmetric Traveling Salesman Problem (ATSP). ATSP is one of the most widely studied combinatorial NP-hard problems of finding the shortest path. The present ATSP is a novel real-life case of the shortest path problem based on the distances between 22 districts of Haryana, India. To solve the above problem, one-point crossover and exchange mutation are applied to compare the performance of these algorithms on different parameters such as the size of the population, the number of iterations, and the rate of crossover. The main objective of this paper is to study the influence of these parameters on ATSP. Numerical results show that the binary genetic algorithm worked better in terms of the size of the population and the number of iterations, while the real-coded genetic algorithm worked better in terms of the rate of crossover. Graphical abstract

Suggested Citation

  • Amit Raj & Parul Punia & Pawan Kumar, 2023. "A comparative analysis of genetic algorithms on a case study of asymmetric traveling salesman problem," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(6), pages 2684-2694, December.
    • Handle: RePEc:spr:ijsaem:v:14:y:2023:i:6:d:10.1007_s13198-023-02161-2
    DOI: 10.1007/s13198-023-02161-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-023-02161-2
    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/s13198-023-02161-2?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.

    References listed on IDEAS

    as
    1. Kai Li & Yongqiang Zhuo & Xiaoqing Luo, 2022. "Optimization method of fuel saving and cost reduction of tugboat main engine based on genetic algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 605-614, March.
    2. M. Bellmore & G. L. Nemhauser, 1968. "The Traveling Salesman Problem: A Survey," Operations Research, INFORMS, vol. 16(3), pages 538-558, June.
    3. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
    4. Nidhi Bansal & Ajay Kumar Singh, 2022. "Valuable survey on scheduling algorithms in the cloud with various publications," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(5), pages 2132-2150, October.
    5. Raj, Saurav & Mahapatra, Sheila & Babu, Rohit & Verma, Sumit, 2023. "Hybrid intelligence strategy for techno-economic reactive power dispatch approach to ensure system security," Chaos, Solitons & Fractals, Elsevier, vol. 170(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rabin K. Jana & Dinesh K. Sharma & Subrata K. Mitra & Bidushi Chakraborty, 2024. "Routing decisions for Buddhist pilgrimage: an elitist genetic algorithm approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(2), pages 609-620, February.
    2. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
    3. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    5. Aura Hernández-Sabaté & Lluís Albarracín & F. Javier Sánchez, 2020. "Graph-Based Problem Explorer: A Software Tool to Support Algorithm Design Learning While Solving the Salesperson Problem," Mathematics, MDPI, vol. 8(9), pages 1-20, September.
    6. Manjulata Badi & Sheila Mahapatra, 2023. "Optimal reactive power management through a hybrid BOA–GWO–PSO algorithm for alleviating congestion," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(4), pages 1437-1456, August.
    7. Delavernhe, Florian & Jaillet, Patrick & Rossi, André & Sevaux, Marc, 2021. "Planning a multi-sensors search for a moving target considering traveling costs," European Journal of Operational Research, Elsevier, vol. 292(2), pages 469-482.
    8. Khan, W. A. & Hayhurst, D. R. & Cannings, C., 1999. "Determination of optimal path under approach and exit constraints," European Journal of Operational Research, Elsevier, vol. 117(2), pages 310-325, September.
    9. Bismark Singh & Lena Oberfichtner & Sergey Ivliev, 2023. "Heuristics for a cash-collection routing problem with a cluster-first route-second approach," Annals of Operations Research, Springer, vol. 322(1), pages 413-440, March.
    10. French, Ben C., 1977. "PART II. The Analysis of Productive Efficiency in Agricultural Marketing: Models, Methods, and Progress," AAEA Monographs, Agricultural and Applied Economics Association, number 337214.
    11. Gharehgozli, Amir Hossein & Yu, Yugang & de Koster, René & Udding, Jan Tijmen, 2014. "An exact method for scheduling a yard crane," European Journal of Operational Research, Elsevier, vol. 235(2), pages 431-447.
    12. Srour, F.J. & Zuidwijk, R.A., 2008. "How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates," ERIM Report Series Research in Management ERS-2008-075-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:ijsaem:v:14:y:2023:i:6:d:10.1007_s13198-023-02161-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.