Pilgrims Services Optimization During Hajj Mega Event Utilizing Heuristic Algorithms

This paper proposes a method to enhance service delivery to pilgrims during one of the most important mega events - Hajj - by identifying optimal routes and cost-effective transportation methods for fulfilling the needs of guests during their stay in holy cities. The problem falls under the Capacitated Vehicle Routing Problem (CVRP) category, aiming to optimize fleet allocation while considering capacity constraints and minimizing transportation costs for a specific customer set. Three algorithms - random, greedy, and multi-search - were employed to determine the best routes for delivering services based on pilgrims' residential locations. Across various test scenarios assessing algorithm performance, the results in most of the cases favored multi-search algorithms, which excelled in discovering the most efficient paths with minimal distances.