Abstract
Real time allocation of vehicles to incidents in emergency fleets is a challenging optimization problem due to time and location uncertainty in incident appearance. In addition, to ensure high responsiveness and efficiency of emergency vehicle crews, their work shifts need to be well balanced with enough break times. These two aspects are simultaneously taken into consideration in Break Assignment Problem Considering Area Coverage (BAPCAC) proposed by Lujak et al. in [1]. Because of its multiple dimensionality and complex mixed linear integer programming structure, this problem is computationally expensive. In this paper, we test in simulations the performance of the BAPCAC problem and propose a simplification of the model so that it can be solved in close-to real time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lujak, M., Sánchez, A.G., Mier, M.O., Billhardt, H.: An overview of a break assignment problem considering area coverage (2021). https://hal.archives-ouvertes.fr/hal-03104345
Lujak, M., Billhardt, B.: Case study from short term scientific mission “emergency fleet break assignment problem considering area coverage”. In: Handbook What is Industrial Mathematics? Case Studies from MI-NET. Mathematics for Industry Network (MI-NET) COST ACTION TD1409, p. 30 (2019)
Lujak, M.: STSM “Break assignment in emergency fleets”. In: Program & Abstracts Book. ICIAM 2019 Valencia, 9th International Congress on Industrial and Applied Mathematics, Valencia, Spain, July 15–19, p. 40 (2019)
Widl, M., Musliu, N.: The break scheduling problem: complexity results and practical algorithms. Memetic Comput. 6(2), 97–112 (2014). https://doi.org/10.1007/s12293-014-0131-0
Di Gaspero, L., et al.: Automated shift design and break scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning, pp. 109–127. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39304-4_5
Reikk, M., Cordeau, J.-F., Soumis, F.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Sched. 13(1), 49–75 (2010)
Quimper, C.G., Rousseau, L.M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. J. Heuristics 16, 373–392 (2010). https://doi.org/10.1007/s10732-009-9106-6
Robbins, T.R., Harrison, T.P.: A stochastic programming model for scheduling call centers with global Service Level Agreements. Eur. J. Oper. Res. 207, 1608–1619 (2010)
Fei, H., Meskens, N., Chu, C.: A planning and scheduling problem for an operating theatre using an open scheduling strategy. CAIE 58, 221–230 (2010)
Aickelina, U., Dowslandb, K.A.: An indirect genetic algorithm for a nurse-scheduling problem. Comput. Oper. Res. 31, 761–778 (2004)
Church, R., ReVelle, C.: The maximal covering location problem. In: Addison-Wesley Papers of the Regional Science Association (1974)
Gallais, A., Carle, J.: An adaptive localized algorithm for multiple sensor area coverage. In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Niagara Falls, ON, pp. 525–532 (2007)
Brotcorne, L., Laporte, G., Semet, F.: Ambulance location and relocation models. Eur. J. Oper. Res. 147(3), 451–463 (2003)
Gendreau, M., Laporte, G., Semet, F.: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Par. Comp. 27, 1641–1653 (2001)
Gendreau, M., Laporte, G., Semet, F.: The maximal expected coverage relocation problem for emergency vehicles. J. Oper. Res. Soc. 57, 22–28 (2006)
Maxwell, M.S., Restrepo, M., Henderson, S.G., Topaloglu, H.: Approximate dynamic programming for ambulance redeployment. INFORMS J. Comput. 22, 266–281 (2010)
Naoum-Sawaya, J., Elhedhli, S.: A stochastic optimization model for realtime ambulance redeployment. Comput. Oper. Res. 40, 1972–1978 (2013)
Alrifaee, B., Mamaghani, M.G., Abel, D.: Centralized non-convex model predictive control for cooperative collision avoidance of networked vehicles. In: 2014 IEEE ISIC (2014)
Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 384–393 (1975)
Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manage. Sci. 17(2), 97–106 (2012)
Acknowledgment
This work has been partially supported by the “AGRIFLEETS” project ANR-20-CE10-0001 funded by the French National Research Agency (ANR) and by the Spanish MINECO projects RTI2018-095390-BC33 (MCIU/AEI/FEDER, UE) and TIN2017-88476-C2-1-R.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Novak, D., Lujak, M. (2021). Simulation Analysis of the Break Assignment Problem Considering Area Coverage in Emergency Fleets. In: De La Prieta, F., El Bolock, A., Durães, D., Carneiro, J., Lopes, F., Julian, V. (eds) Highlights in Practical Applications of Agents, Multi-Agent Systems, and Social Good. The PAAMS Collection. PAAMS 2021. Communications in Computer and Information Science, vol 1472. Springer, Cham. https://doi.org/10.1007/978-3-030-85710-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-85710-3_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85709-7
Online ISBN: 978-3-030-85710-3
eBook Packages: Computer ScienceComputer Science (R0)