A Discrete Inspired Bat Algorithm for Firetruck Dispatch in Emergency Situations
- 30 Downloads
This research considers the case where a large fire has developed beyond the possibility of suppression and resources need to be deployed to reduce the risk to critical assets. Thus, to determine an optimal deployment of the firetrucks to multiple assets in a large area, a mathematical formulation is proposed, focusing on the maximization of the aggregated value of the protected assets that are critically selected, and on the minimization of the dispatch strategy cost. Moreover, the novelty of the presented formulation is the incorporation of the CO2 emissions of the firetrucks in the cost function, and, hence, the formulation of the Green-Prize Collecting Vehicle Routing Problem. Moreover, a hybrid Bat Algorithm (BA) is developed for the optimization of the aforementioned problem, namely the Discrete Inspired Bat Algorithm (DIBA). The effectiveness of the proposed algorithmic approach is demonstrated over computational experiments, in comparison with the results of a commercial exact solver.
KeywordsDiscrete bat algorithm Prize-collecting vehicle routing problem CO2 emissions
This research is co-financed by Greece and the European Union (European Social Fund- ESF) through the Operational Programme “Human Resources Development, Education and Lifelong Learning” in the context of the project “Strengthening Human Resources Research Potential via Doctorate Research” (MIS-5000432), implemented by the State Scholarships Foundation (IKY).
- El Bouzekri, E. I. A., Elhassania, M., & Alaoui, A. E. H. (2013). A hybrid ant colony system for green capacitated vehicle routing problem in sustainable transport. Journal of Theoretical and Applied Information Technology, 54(2), 198–208.Google Scholar
- Martell, D. L. (2007). Fifty years of OR in forestry preface to the special forestry issue of INFOR. INFOR: Information Systems and Operational Research, 45(1), 5–7.Google Scholar
- Osaba, E., Carballedo, R., Yang, X. S., Fister Jr, I., Lopez-Garcia, P., & Del Ser, J. (2018). On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators. In Nature-Inspired Algorithms and Applied Optimization (pp. 69–89). Cham: Springer.Google Scholar
- Osaba, E., Yang, X. S., Fister, I., Jr., Del Ser, J., Lopez-Garcia, P., & Vazquez-Pardavila, A. J. (2019). A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm and Evolutionary Computation, 44, 273–286.CrossRefGoogle Scholar
- Taha, A., Hachimi, M., & Moudden, A. (2017). A discrete Bat Algorithm for the vehicle routing problem with time windows. In 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA) (pp. 65–70). IEEE.Google Scholar
- Tiwari, A., Chang, P. C., Elangovan, G., & Annadurai, S. P. (2015). A hybrid edge recombination approach to solve price collecting vehicle routing problem. In 2015 International Conference on Control, Automation and Robotics (ICCAR) (pp. 200–203). IEEE.Google Scholar
- Van Der Merwe, M., Minas, J., Ozlen, M., & Hearne, J. (2014). The cooperative orienteering problem with time windows. Optimization-online.org.Google Scholar
- Yang, X. S. (2010). A new metaheuristic bat-inspired algorithm. In Nature inspired cooperative strategies for optimization (NICSO 2010) (pp. 65–74). Berlin, Heidelberg: Springer.Google Scholar
- Zhou, Y., Luo, Q., Xie, J., & Zheng, H. (2016). A hybrid bat algorithm with path relinking for the capacitated vehicle routing problem. In Metaheuristics and Optimization in Civil Engineering (pp. 255–276). Cham: Springer.Google Scholar