Abstract
This chapter is devoted to present a generalized model for scheduling multiple ambulance vehicles from multiple ambulance centers assigned to evacuate COVID-19 patients. The proposed formulation is a multi-objective multiple 0–1 mathematical model as a new application of the multi-objective multiple 0/1 knapsack problem.
The scheduling aims at achieving the best utilization of the time shift as a planning time window. The best utilization of time is evaluated by a compromise between maximizing the number of evacuated people who might be infected with the virus to the isolation hospitals and maximizing the evacuated patients having higher relative priorities measured according to their health status. The complete mathematical model for the problem is formulated including the representation of binary decision variables, the problem constraints, and the multi-objective functions.
The proposed multi-objective multiple ambulances model is applied to an illustrated case study in Great Cairo, Egypt, the case study aims at improving the scheduling of ambulance vehicles in the back-and-forth shuttle movements between patient locations and the available multiple isolation hospitals with multiple ambulance vehicles. The solution procedure is illustrated while two efficient solutions for the case study with different numbers of evacuated patients are obtained. The proposed mathematical model is so general that it can be applied to cases covering the whole Governorates and even the whole country all over the world.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Ahram Gate website (2021) “The link between the patient and the doctor, rescue brigades are heroes inside ambulances”. Retrieved on 9 March 2021 at: https://gate.ahram.org.eg/News/2391717.aspx
Alaya I, Solnon C, Gheira K (2004) Ant algorithm for the multi-dimensional knapsack problem, International Conference on Bioinspired Optimization Methods and their Applications, (BIOMA 2004), 2004, 63–72
Anany L (2003) The design and analysis of algorithms. Pearson Education Inc., New Jersey, p 2003
Basheer GT, Algamal ZY (2019) Nature-inspired optimization algorithms in knapsack problem: a review. Iraqi Journal of Statistical Science 30:1–18
Biglar A (2018a) Applications and solutions of knapsack problem: a literature review. https://doi.org/10.13140/RG.2.2.10921.08807. Retrieved at: file:///C:/Users/Dr%20Said/Downloads/knapsack.pdf
Biglar A (2018b) Some applications of knapsack problem preprint. https://doi.org/10.13140/RG.2.2.15115.39209
Black J (2017) Ambulance services working collaboratively with community partners, Association of Ambulance Chief Executives, 2017. Retrieved on May 15, 2020 at: https://www.kingsfund.org.uk/sites/default/files/2017-11/John%20Black%2031.101.17%20pdf_1.pdf
Boone CM Avery LW, Malone TB (2015) “A research study of ambulance operations and best practice considerations for emergency medical services personnel”, Department of Homeland Security Science & Technology Directorate First Responders Group, March 2015
Captivo ME, Climaco JCN, Figueira JR, Martins EQV, Santos JL (2003) Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput Oper Res 30(12):1865–1886
Carlos AB (2017) Emergency medical service ambulance system planning: history and models. M. Sc. Thesis, University of California, Santa Barbara, December 2017
Chabane B, Basseur M, Hao J (2005) A practical case of the multi-objective knapsack problem: design, modelling, tests and analysis. Springer International Publishing, Switzerland, pp 1–7. https://doi.org/10.1007/978-3-319-19084-623
Chekuri C, Khanna S (2006) A polynomial time approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 2006 35(3):713–728
Cleemput S, Dumon W, Fonseca V, Abdool Karim W, Giovanetti M, Alcantara LC, Deforche K, Oliveira T (2020) Genome Detective Coronavirus Typing Tool for rapid identification and characterization of novel coronavirus genomes, Bioinformatics, btaa145. https://doi.org/10.1093/bioinformatics/btaa145
Da Silva CG, Climaco JCN, Figueira JR (2005) Core problems in the bi-criteria {0,1} knapsack: new developments. Research Report 12, INESC-Coimbra
Da Silva CG, Climaco JCN, Figueira JR (2006) A scatter search method for bi-criteria {0-1}-knapsack problems. Eur J Oper Res 169(2):373–391
Da Silva CG, Climaco JCN, Figueira JR (2007) Integrating partial optimization with scatter search for solving bi-criteria {0-1}-knapsack problems. Eur J Oper Res 177(3):1656–1677
Egypt Independent website (2021) Egyptian ambulance organization transports 150–170 people per day due to coronavirus. Retrieved on March 9, 2021 at: https://egyptindependent.com/egyptian-ambulance-organization-transfers-between-150-170-persons-infected-or-suspected-with-coronavirus-president/
Ehrgott M, Gandibleux X (2000) A survey and annoted bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4):425–460
El-Ghazali T (2009) Metaheuristics from design to implementation. Wiley
Erlebach T, Kellerer H, Pferschy U (2002) Approximating multiobjective knapsack problems. Manag Sci 48(12):1603–1612
El-Qulity SA, Mohamed AW, Bafail AO, Abdelaal RMS (2016) A multistage procedure for optimal distribution of preparatory-year students to faculties and departments: a mixed integer nonlinear goal programming model with enhanced differential evolution algorithm. J Comput Theor Nanosci 13(11):7847–7863
El-Qulity SAH, Mohamed AW (2016a) A generalized National Planning Approach for admission capacity in higher education: a nonlinear integer goal programming model with a novel differential evolution algorithm. Comput Intell Neurosci 2016:5207362. https://doi.org/10.1155/2016/5207362
El-Qulity SAH, Mohamed AW (2016b) A large-scale nonlinear mixed-binary goal programming model to assess candidate locations for solar energy stations: an improved real-binary differential evolution algorithm with a case study. J Comput Theor Nanosci 13(11):7909–7921. https://doi.org/10.1166/JCTN.2016.5791
Fidanova S (2004) Ant colony optimization for multiple knapsack problem and heuristic model. Kluwer Academic Publishers
Fidanova S (2005) Ant colony optimization for multiple knapsack problem and model bias. In: Margenov S, Vulkov LG, Wasniewski J (eds) Numerical analysis and its applications, LNCS, vol 3401. Springer, Berlin Heidelberg, pp 280–287
Fidanova S (2007) Probabilistic model of ant colony optimization for multiple knapsack problem. In: Lirkov I, Margenov S, Wasniewski J (eds) LSSC 2007, LNCS 4818, Berlin, pp 545–552
Gandibleux X, Freville A (2000) Tabu search based procedure for solving the 0−1 multiobjective knapsack problem: the two objectives case. J Heuristics 6(3):361–383
Global Medical System (GMS) (2021) website, Ambulance Services. Retrieved on March 8, 2021 at: https://www.gmshospital.com/services/ambulance/
Gov. UK website (2021) Public Health England COVID-19: guidance for ambulance services, Updated 29 January 2021. Retrieved on March 9, 2021 at: https://www.gov.uk/government/publications/covid-19-guidance-for-ambulance-trusts/covid-19-guidance-for-ambulance-trusts
Groşan C Oltean M, Dumitrescu D (2003a) A new evolutionary algorithm for the multiobjective 0/1 knapsack problem, Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics–ICTAMI 2003, Alba Iulia
Groşan C, Oltean M, Dumitrescu D (2003b) Performance Metrics for Multiobjective Optimization Evolutionary Algorithms, In Proceedings of Conference on Applied and Industrial Mathematics (CAIM), Oradea, 2003
Gunantara N (2018) A review of multi-objective optimization: Methods and its applications, Cogent Engineering (2018), 5: 1502242, Electrical & Electronic Engineering, Review article, https://doi.org/10.1080/23311916.2018.1502242
Hemamalini S, Simon SP (2010) Economic/emission load dispatch using artificial bee colony algorithm. In: ACEEE international journal on electrical and, power engineering, vol 1
Hassan SA, Agrawal P, Ganesh T, Mohamed AW (2020a) “Scheduling Shuttle Ambulance Vehicles for COVID-19 Quarantine Cases. A Multi-objective Multiple 0–1 Knapsack Model with A Novel Discrete Binary Gaining-Sharing knowledge-based Optimization Algorithm”, in Data Science for COVID-19, Computational Perspectives, 1st. Edition, Paper No. 37, Elsevier, Academic Press, April 15, 2021
Hassan SA, Ayman YM, Alnowibet K, Agrawal P, Mohamed AW (2020b) Stochastic travelling advisor problem simulation with a case study: a novel binary gaining-sharing knowledge-based optimization algorithm. Hindawi, Complexity 2020:6692978. https://doi.org/10.1155/2020/6692978
Jansen K (2009) Parameterized approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 2009 39(4):1392–1412
Jansen K (2012) A fast approximation scheme for the multiple knapsack problem. Lect Notes Comput Sci 2012(7147):313–324
Ji J, Huang Z, Liu C, Liu X, Zhong N (2007). An ant colony optimization algorithm for solving the multidimensional knapsack problems, [in:] Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IEEE Computer Society, Los Alamitos, 2007, 10–16
Ke L, Feng Z, Ren Z, Wei X (2010) An ant colony optimization approach for the multi-dimensional knapsack problem. J Heuristics 16(1):65–83
Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems. Springer-Verlag, Berlin
Klamroth K, Wiecek M (2000) Dynamic programming approaches to the multiple criteria knapsack problem. Nav Res Logist 47(1):57–76
Kuchta D, Rynca R (2019) The use of the multiple knapsack problem in strategic management of a private polish university case study. Int J Educ Manag 33(2):335–358
Li J, Li W, Wang H (2015) The multiple knapsack problem with compatible bipartite graphs, The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), Luoyang, China, August 21–24, 2015
Little AD (2019) Ambulance services–optimizing operations, rethinking emergency services for efficiency
Ma X, Yan Y, Liu Q (2018) A multi-objective particle swarm optimization for multiple knapsack problem with strong constraints, 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018. https://doi.org/10.1109/ICIEA.2018.8397892
Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering, structural and multidisciplinary optimization 26 (6), April 2004, pp. 369–395. https://doi.org/10.1007/s00158-003-0368-6
Microsoft webpage (2021) Define and solve a problem by using Solver. Retrieved on March 10, 2021 at: https://support.microsoft.com/en-us/office/define-and-solve-a-problem-by-using-solver-5d1a388f-079d-43ac-a7eb-f63e45925040
Naidu K, Mokhlis H, Bakar AHA (2014) Multiobjective optimization using weighted sum artificial bee Colony algorithm for load frequency control. Electr Power Energy Syst 55:657–667
Raj N, Vitthalpura J (2017) Literature review on implementing binary knapsack problem. IJARIIE 3(5):2395–4396
Render B, Stair RM, Hanna ME (2020) Quantitative analysis for management, 12th. Edition, BEARSON, 2020
Sanders D (2021) The heroism of health workers in the coronavirus crisis, The New York Times website, March 26, 2020. Retrieved on March 8, 2021 at: https://www.nytimes.com/2020/03/26/opinion/letters/coronavirus-health-care.html
Shahrear I, Faizul B, Sohel R (2010) Solving the multidimensional multi-choice knapsack problem with the help of ants. In: Dorigo M et al (eds) ANTS 2010. LNCS 6234, Berlin, pp 312–323
Soylu B, Köksalan M (2009) An evolutionary algorithm for the multi-objective multiple knapsack problem, International Conference on Multiple Criteria Decision Making, MCDM 2009: Cutting-Edge Research Topics on Multiple Criteria Decision Making, pp 1–8
The Lancet website (2020) A novel coronavirus outbreak of global health concern. Retrieved on March 09, 2021 at: https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(20)30185-9/fulltext
Ünal AN (2013) A genetic algorithm for the multiple knapsack problem in dynamic environment, Proceedings of the World Congress on Engineering and Computer Science, 2013, Vol II, WCECS 2013, 23–25 San Francisco, USA
Vickram P, Krishna AS, Srinivas VS (2016) A survey on design paradigms to solve 0/1 knapsack problem. International Journal of Scientific & Engineering Research 7(11):2229–5518
World Health Organization website (2020) Guidance for health workers. Retrieved on March 1, 2021 at: https://www.who.int/emergencies/diseases/novel-coronavirus-2019/technical-guidance/health-workers
Worldometer website (2021) COVID-19 Coronavirus pandemic. Retrieved on April 15, 2020 at: https://www.worldometers.info/coronavirus/#ref-13
Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7:2
Yang X-S (2014) Cuckoo search and firefly algorithm-theory and applications. Springer International Publishing, Switzerland
Yang X-S (2015) Recent advances in swarm intelligence and evolutionary computation. Springer International Publishing, Switzerland
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Hassan, S.A., Mohamed, A.W. (2022). A Generalized Model for Scheduling Multi-Objective Multiple Shuttle Ambulance Vehicles to Evacuate COVID-19 Quarantine Cases. In: Hassan, S.A., Mohamed, A.W., Alnowibet, K.A. (eds) Decision Sciences for COVID-19. International Series in Operations Research & Management Science, vol 320. Springer, Cham. https://doi.org/10.1007/978-3-030-87019-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-87019-5_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87018-8
Online ISBN: 978-3-030-87019-5
eBook Packages: Business and ManagementBusiness and Management (R0)