Lagrangian relaxation-based approaches for cooperative location and assignment of emergency responders

Abstract

Efficient fire response and the coordination of various fire vehicles are paramount for delivering optimal services and conducting effective rescue operations. This study explores the challenges of cooperative station location and vehicle assignment, focusing on the synergistic dispatch of fire vehicles from multiple stations. It highlights that the response time of the last arriving vehicle, crucial for forming a complete and effective response unit, is a critical determinant in the overall success of fire rescue operations. The primary objective of the model is to minimize the total system cost, encompassing both the capital investment in fire stations and the potential losses from fire incidents. By employing a Lagrangian relaxation technique, the model effectively simplifies the optimization challenge into more manageable sub-problems, thereby enhancing solution accuracy. The robustness and flexibility of the model were tested through simulations in a hypothetical network and a real-world scenario, using data from urban fire services. The results demonstrate the model’s scalability and adaptability to different network configurations and operational constraints, showcasing its potential to substantially enhance emergency response efficiency and decision-making in urban fire management. This research makes a significant contribution to emergency response management by providing a validated framework that improves the coordination and effectiveness of fire rescue operations, thereby reducing fire damage and enhancing public safety.

Keywords

• Fire Response optimization
• Facility location and assignment problem
• Cooperative responder logistics
• Mixed-integer program
• Lagrangian relaxation