Comparative Analysis of Metaheuristic Algorithms for Emergency Response Vehicle Routing
Students & Supervisors
Student Authors
Supervisors
Abstract
Emergency Response Vehicle Routing, a vital application of the Vehicle Routing Problem (VRP), presents unique challenges in transportation and logistics, where optimized solutions can dramatically improve response times and resource allocation. To address this complex problem, metaheuristic algorithms play a key role in providing efficient and practical solutions. This research presents a detailed performance evaluation of metaheuristic algorithms applied to Emergency Response Vehicle Routing.
The evaluated algorithms include Genetic Algorithm (GA), Ant Colony Optimization (ACO), Tabu Search (TS), and Simulated Annealing (SA). Their performance is analyzed based on key metrics such as execution time, cache performance, memory utilization, and solution quality. Profiling tools such as gperftools,
Keywords
Publication Details
- Type of Publication: Conference
- Conference Name: 2025 International Conference on Electrical, Computer and Communication Engineering (ECCE)
- Date of Conference: 13/02/2025 - 13/02/2025
- Venue: Chittagong University of Engineering & Technology, Bangladesh
- Organizer: IEEE