SpringerLink
Log in

Routing decisions for Buddhist pilgrimage: an elitist genetic algorithm approach

  • Original article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

Pilgrimage is a historic and inseparable event in Buddhism. The event is significant for Indian tourism and its long-term viability. There are several critical Buddhist pilgrimage-related problems. One such problem is determining the best route decisions to cover main Buddhist sites. This problem has never been mathematically studied. In this paper, we formulate the Buddhist pilgrimage problem as an asymmetric traveling salesman problem. We focus on foreign pilgrims who will travel to India by air. We consider two cases - (i) closed tour in which pilgrims’ port of entry and exit are the same, (ii) open tour in which pilgrims’ port of entry and exit are different. These problems are combinatorial in nature. We propose an elitist genetic algorithm to suggest to pilgrims the best route for which the distance traveled is minimum. To illustrate the proposed approach, we consider fifteen major Buddhist sites and two ports of entry and provide the best pilgrimage decisions for open and closed tour options. The results show that the pilgrims should prefer the port of entry Mumbai in both closed and open tour problems. Also, the open tour decision is the best for the pilgrims, in which the journey starts from Mumbai and finishes at New Delhi.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Adewumi AO, Adeleke OJ (2018) A survey of recent advances in vehicle routing problems. Int J Syst Assur Eng Manage 9(1):155–172

    Article  Google Scholar 

  • Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: A computational study. Princeton University Press, Princeton

    Google Scholar 

  • Bellman RE, Dreyfus SE (2015) Applied dynamic programming. Princeton University Press, New Jersey

    Google Scholar 

  • Brikaaa MG, Ammarc ES, Zhenga Z (2019) Solving Bi-matrix games in tourism planning management under rough interval approach. Int J Math Sci Comput 4:44–62

    Google Scholar 

  • Çakır E, Ulukan Z (2020) A fuzzy linguistic programming for sustainable ecotourism activities. In 2020 10th Annual Computing and Communication Workshop and Conference (CCWC) (pp 0121–0126). IEEE

  • Carpaneto G, Dell’Amico M, Toth P (1995) Exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans Math Softw 21(4):394–409

    Article  MathSciNet  Google Scholar 

  • Chaudhary M (2000) India’s image as a tourist destination – a perspective of foreign tourists. Tour Manage 21(3):293–297

    Article  Google Scholar 

  • Chen JH, Chao KM, and Shah N (2013) Hybrid recommendation system for tourism. In 2013 IEEE 10th International Conference on e-Business Engineering (pp 156–161). IEEE

  • Dantzig G, Fulkerson D, Johnson S (1954) Solutions of a large-scale traveling-salesman problem. Oper Res 2(4):393–410

    MathSciNet  Google Scholar 

  • Deep K, Mebrahtu H, Nagar AK (2018) Novel GA for metropolitan stations of Indian railways when modelled as a TSP. Int J Syst Assur Eng Manage 9(3):639–645

    Article  Google Scholar 

  • Fei W, Li DF (2016) Bilinear programming approach to solve interval bimatrix games in tourism planning management. Int J Fuzzy Syst 18(3):504–510

    Article  MathSciNet  Google Scholar 

  • Fischetti M, Lodi A, Toth P (2002) Exact methods for the asymmetric traveling salesman problem. In: G. Gutin & A.P. Punnen (Eds.), The Traveling Salesman Problem and Its Variations. Boston: Kluwer. pp 168–205

  • Gang P, Iimura I, Tsurusawa H, Nakayama S (2004) Genetic local search based on genetic recombination: A case for traveling salesman problem. Springer-Verlag, Berlin, pp 202–212

    Google Scholar 

  • Geary D (2008) Destination enlightenment: Branding Buddhism and spiritual tourism in Bodhgaya Bihar. Anthropol Today 24(3):11–14

    Article  Google Scholar 

  • Gessesse AA, Mishra R, Acharya MM, Das KN (2020) Genetic algorithm based fuzzy programming approach for multi-objective linear fractional stochastic transportation problem involving four-parameter Burr distribution. Int J Syst Assur Eng Manage 11(1):93–109

    Article  Google Scholar 

  • Gokhale BG (1994) New Light on Early Buddhism. Popular Prakashan Ltd., Mumbai

    Google Scholar 

  • Goldberg DE (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, New York

    Google Scholar 

  • Gutin G, Punnen AP (eds) (2007) The traveling salesman problem and its variations. Springer, New York

    Google Scholar 

  • Holland JH (1975) Adaption in Natural and Artificial Systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  • Hong WC, Dong Y, Chen LY, Wei SY (2011) SVR with hybrid chaotic genetic algorithms for tourism demand forecasting. Appl Soft Comput 11(2):1881–1890

    Article  Google Scholar 

  • Indian Horizons (2010), available at: www.buddhisttoursindia.com/four-scared-buddhist-sitesindia.html (Accessed 12 Jul 2021).

  • Hurley S, Moutinho L, Witt SF (1998) Genetic algorithms for tourism marketing. Ann Tour Res 25(2):498–514

    Article  Google Scholar 

  • Investing in The Buddhist Circuit: Enhancing the spiritual, environmental, social and economic value of the places visited by the Buddha in Bihar and Uttar Pradesh, India, 2014–20018, (2014) available at https://www.ifc.org/wps/wcm/connect/a0b004004618b490804eb99916182e35/Buddhist+Circuit+Tourism+Strategy+Final.pdf?MOD=AJPERES (Accessed 12 Jul 2021)

  • Jana RK, Biswal MP (2004) Stochastic simulation based genetic algorithm for chance constraint programming problems with some discrete random variables. Int J Comput Math 81(12):1455–1463

    Article  MathSciNet  Google Scholar 

  • Jana RK, Mitra SK (2020) Maximizing pleasure in day tours: Utility theory approach. Int J Tour Res. https://doi.org/10.1002/jtr.2424

    Article  Google Scholar 

  • Jana RK, Sharma DK (2010) Genetic algorithm-based fuzzy goal programming for class of chance-constrained programming problems. Int J Comput Math 87(4):733–742

    Article  MathSciNet  Google Scholar 

  • Kang M (2013) Integer programming formulation of finding cheapest ticket combination over multiple tourist attractions. In Information and Communication Technologies in Tourism 2013. Springer, Berlin, Heidelberg pp 131–143

  • Kant A (2009) Branding India: An incredible story, Harper Collins, Noida.

  • Keys CF (1975) Buddhist pilgrimage centers and the twelve-year cycle: Northern Thai moral orders in space and time. Hist Relig 15(1):71–89

    Article  Google Scholar 

  • Kumar RB (2006) Buddhist tourism in India: a conceptualization. In: D.S. Bhardwaj, K.K. Kamra, M. Chaudhary, R.B. Kumar, S.S. Boora, M. Chand, and R.H. Taxak, (Eds), International Tourism: Issues and Challenges, Kanishka, New Delhi, pp 214–23

  • Kumar M, Prashar S, Jana RK (2019) Does international tourism spur international trade and output? Evidence from Wavelet Analysis. Tourism Econ 25(1):22–33

    Article  Google Scholar 

  • Majumdar J, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235:3063–3078

    Article  MathSciNet  Google Scholar 

  • Man SS, Thapar R (2015) Awakening of the Buddhist circuit, available at: www.hvs.com/Jump/?f=3674.pdf&c=7314&rt=2 (Accessed on 12 Jul 2021).

  • Pratt JB (1996. The pilgrimage of Buddhism and Buddhist pilgrimage, Asian Educational Services, New Delhi.

  • Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer-Verlag, Berlin

    Google Scholar 

  • Report on “Tourism Survey for the State of Maharashtra April 2014 to March 2015”, Government of Maharashtra, India, 2015

  • Sakhuja S, Jain V, Kumar S, Chandra C, Ghildayal SK (2016) Genetic algorithm based fuzzy time series tourism demand forecast model. Ind Manag Data Syst 116(3):483–507

    Article  Google Scholar 

  • San CK (2002) Buddhist pilgrimage, Subang Jaya Buddhist Association, Selangor Darul Ehsan.

  • Sharma DK, Jana RK (2009) A hybrid genetic algorithm model for transshipment management decisions. Int J Prod Econ 122(2):703–713

    Article  Google Scholar 

  • Singh RPB (2003) Where the Buddha walked: A companion to the Buddhist places of India. Indica Books, Varanasi

    Google Scholar 

  • Smith M, Kelly C (2006) Holistic tourism: Journeys of the self? Tour Recreat Res 31(1):15–25

    Google Scholar 

  • Trevithick A (2006) The Revival of Buddhist Pilgrimage at Bodh Gaya (1811–1949): Anagarika Dharmapala and the Mahabodhi Temple. Motilal Banarsidass Publishers Pvt. Ltd., New Delhi

    Google Scholar 

  • UN ESCAP (2003) Promotion of Buddhist tourism circuits in selected Asian countries, Escapa Tourism Review No. 24, United Nations, New York, NY.

  • Velednitsky M (2017) Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem. Oper Res Lett 45(4):323–324

    Article  MathSciNet  Google Scholar 

  • Williams HP (2013) Model building in mathematical programming. Wiley, New York

    Google Scholar 

  • Yu SM, Wang J, Wang JQ (2017) An interval type-2 fuzzy likelihood-based MABAC approach and its application in selecting hotels on a tourism website. Int J Fuzzy Syst 19(1):47–61

    Article  MathSciNet  Google Scholar 

  • Zhu, S. (2020). Multi-objective route planning problem for cycle-tourists. Transportation Letters, 1–9

  • Ziaabadi M, Malakootian M, Mehrjerdi MRZ, Jalaee SA, Boshrabadi HM (2017) How to use composite indicator and linear programming model for determine sustainable tourism. J Environ Health Sci Eng 15(1):1–11

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to express their gratitude to the Editor-in-Chief and anonymous reviewers for their valuable suggestions that helped shape this manuscript in the present form.

Funding

We have not received any funding for this research.

Author information

Authors and Affiliations

  1. Operations & Quantitative Methods Area, Indian Institute of Management Raipur, Atal Nagar, Raipur, Chhattisgarh, 493661, India

    Rabin K. Jana

  2. Department of Business, Management & Accounting, University of Maryland Eastern Shore, Princess Anne, MD, 21853, USA

    Dinesh K. Sharma

  3. Finance Area, Institute of Management Technology, Nagpur, Maharashtra, 441502, India

    Subrata K. Mitra

  4. Department of Mathematics, Institute of Engineering & Management, Kolkata, West Bengal, 700091, India

    Bidushi Chakraborty

Authors
  1. Rabin K. Jana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dinesh K. Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subrata K. Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bidushi Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dinesh K. Sharma.

Ethics declarations

Conflict of interest

The authors have disclosed no conflicts of interest.

Human participants and/or animals

The authors declared that there are no studies involving human or animal subjects in this article.

Informed consent

None.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jana, R.K., Sharma, D.K., Mitra, S.K. et al. Routing decisions for Buddhist pilgrimage: an elitist genetic algorithm approach. Int J Syst Assur Eng Manag 15, 609–620 (2024). https://doi.org/10.1007/s13198-021-01400-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-021-01400-8

Keywords

Search

Navigation