Routing decisions for Buddhist pilgrimage: an elitist genetic algorithm approach

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.