Skip to main content
SpringerLink
Log in

A Travelling Disinfection-Man Problem (TDP) for COVID-19: A Nonlinear Binary Constrained Gaining-Sharing Knowledge-Based Optimization Algorithm

  • Chapter
  • First Online:
Intelligent Data Analysis for COVID-19 Pandemic

Part of the book series: Algorithms for Intelligent Systems ((AIS))

Abstract

An improved scheduling the disinfection process of the new coronavirus (COVID-19) is introduced. The scheduling aims at achieving the best utilization of the available day time, which is calculated as the total disinfection time minus the total loss travelling time. In this regard, a new application problem is presented, which is called a travelling disinfection-man problem (TDP). The new problem (TDP) in network optimization resemble somehow the famous travelling salesman problems (TSP) but with basic distinct variations where a disinfection group is likely to select a route to reach a subset of predetermined places to be disinfected with the most utilization of the available day working hours. A nonlinear binary model is introduced with a detailed real application case study involving the improving the scheduling of coronavirus disinfection process for five contaminated faculties in Ain Shams University in Cairo, and the case study is solved using a novel discrete binary gaining-sharing knowledge-based optimization algorithm (DBGSK).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cleemput, S., Dumon, W., Fonseca, V., Abdool Karim, W., Giovanetti, M., Alcantara, L. C., Deforche, K., & de Oliveira, T. (2020, 28 February). Genome detective coronavirus typing tool for rapid identification and characterization of novel coronavirus genomes. Bioinformatics, btaa145. Retrieved at: https://doi.org/10.1093/bioinformatics/btaa145

  2. The Lancet website (2020). A novel coronavirus outbreak of global health concern, retrieved on March 30, 2020. https://www.thelancet.com/journals/lancet/article/PIIS0140-6736(20)30185-9/fulltext

  3. World Health Organization (WHO) website. (2020a). Novel coronavirus (2019-nCoV) situation report–7, Data as reported by 27 January 2020.

    Google Scholar 

  4. Guan, W., Ni, Z., Hu, Y., Liang, W., Ou, C., He, J., Liu, L., Shan, H., Lei, C., Hui, D. S. C., Du, B., & Li, L. (2020, February 28) Clinical characteristics of coronavirus disease 2019 in China. The New England Journal of Medicine. https://doi.org/10.1056/NEJMoa2002032. https://doi.org/10.1056/NEJMoa200203

  5. Wikimedia Commons website. (2020). Retrieved on April 3, 2020. https://commons.wikimedia.org/wiki/File:COVID-19_Outbreak_World_Map.svg

  6. Ministry of Health and Population (Egypt). (2020). Retrieved on 31 March 2020. https://m.facebook.com/story.php?story_fbid=146349830248971&id=113432613540693

  7. Centers for Decease Control and Prevention (CDC) website. (2020a). COVID-19 travel recommendations by country. Retrieved on April 3, 2020. https://www.cdc.gov/coronavirus/2019-ncov/travelers/map-and-travel-notices.html

  8. Worldometer website. (2020a). COVID-19 Coronavirus pandemic. Retrieved on April 3, 2020. https://www.worldometers.info/coronavirus/#ref-13

  9. Worldometer website (2020b). Coronavirus cases. Retrieved on April 1, 2020. https://www.worldometers.info/coronavirus/coronavirus-cases/#total-cases

  10. Zhao, S., Lin, Q., Ran, J., Musa, S. S., Yang, G., Wang, W., Lou, Y., Gao, D., Yang, L., He, D., & Wang, M. H. (2020 March). Preliminary estimation of the basic reproduction number of novel coronavirus (2019-nCoV) in China, from 2019 to 2020: A data-driven analysis in the early phase of the outbreak. International Journal of Infectious Diseases, 92, 214–217. https://doi.org/10.1016/j.ijid.2020.01.050

  11. Centers of Disease Control and Prevention (CDC) website. (2020b). Coronavirus disease 2019. Retrieved on March 31, 2020. https://www.cdc.gov/

  12. ServiceMaster DSI website. (2020). Preventive cleaning and decontamination, COVID-19 coronavirus disinfection. Retrieved on March 30, 2020. https://servicemasterdsi.com/coronavirus-decontamination/

  13. Sentrex website. (2020). UK coronavirus infection control & fogging. Retrieved on March 28, 2020. https://sentrex.co.uk/service/coronavirus-infection-control/

  14. World Health Organization (WHO) website. (2020b). Guidance for health workers. Retrieved on March 29, 2020. https://www.who.int/emergencies/diseases/novel-coronavirus-2019/technical-guidance/health-workers

  15. Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton University Press.

    MATH  Google Scholar 

  16. Environmental Consultants Inc. APEX. (2020). General guidance for building managers regarding novel coronavirus. Retrieved. https://www.smrecover.com/wp-content/uploads/2020/03/COVID-19-General-Guideline-for-Building-Managers-Final.pdf

  17. Gleixner, A. M. (2014, April 10–11). Introduction to constraint integer programming, 5th. Porto meeting on mathematics for industry, Porto, Zuse Institute Berlin, Matheon, Berlin mathematical school.

    Google Scholar 

  18. Droste, I. (2017). Algorithms for the travelling salesman problem. Bachelor thesis, mathematics. Utrecht University.

    Google Scholar 

  19. Applegate, D. L., Bixby, R. E., Chvátal, V., Cook, W., Espinoza, D. G., Goycoolea, M., & Helsgaun, K. (2009). Certification of an optimal TSP tour through 85,900 cities. Operations Research Letters, 37(1), 11–15.

    Google Scholar 

  20. Sarubbi, J. F. M., & Luna, H. P. L. (2007). The multi-commodity traveling salesman problem. INOC—International Network Optimization Conference, April 2007. https://www.poms.ucl.ac.be/inoc2007/Papers/author.68/paper/paper.68.pdf

  21. Pureza, V., Morabito, R., & Luna, H. P. (2018). Modelling and solving the traveling salesman problem with priority prizes. Pesquisa Operacional, 38(3), 499–522. Brazilian Operations Research Society Printed version ISSN 0101–7438/Online version ISSN 1678-5142 www.scielo.br/pope. https://doi.org/10.1590/0101-7438.2018.038.03.0499

  22. Baldacci, R., Hadjiconstantinou, E., & Mingozzi, A. (2003). An exact algorithm for the traveling salesman problem with deliveries and collections. Networks, 42(1), 26–41, Wiley Periodicals, Inc.

    Google Scholar 

  23. Gendreau, M., Hertz, A., & Laporte, G. (1996). The travelling salesman problem with backhauls. Computers and Operations Research, 23(1996), 501–508

    Article  MathSciNet  Google Scholar 

  24. Aramgiatisiris, T. (2004, April–June). An exact decomposition algorithm for the traveling salesman problem with backhauls, operations research and management science units, department of industrial engineering, Kasetsart university, Bangkok, Thailand. Journal of Research in Engineering and Technology, 1(2).

    Google Scholar 

  25. Mosheiov, G. (1994). The travelling salesman problem with pick-up and delivery. European Journal of Operational Research, 79(1994), 299–310

    Article  Google Scholar 

  26. Anily, S., & Mosheiov, G. (1994). The traveling salesman problem with delivery and backhauls. Operations Research Letter, 16(1994), 11–18

    Article  MathSciNet  Google Scholar 

  27. Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers and Operations Research, 26(1999), 699–714

    Article  Google Scholar 

  28. Halse, K. (1992). Modelling and solving complex vehicle routing problems, Ph.D. thesis, IMSOR, Technical University of Denmark.

    Google Scholar 

  29. Dumitrescu, I., Ropke, S., Cordeau, J., & Laporte, G. (2010, February). The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Mathematical Programming, 121, 269.

    Google Scholar 

  30. Pop, P. C. (2007). New integer programming formulations of the generalized travelling salesman problem. American Journal of Applied Sciences, 4(11), 932–937. Science Publications. ISSN 1546-9239.

    Google Scholar 

  31. Kara, I., & Bektas, T. (2003, July 6–10). Integer linear programming formulation of the generalized vehicle routing problem, presented in 5th EURO/INFORMS Joint international meeting.

    Google Scholar 

  32. Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. OMEGA: The International Journal of Management Science, 34(3), 209–219.

    Google Scholar 

  33. Oberlin, P., Rathinam, S., & Darbha, S. (2009, June 10–12). A transformation for a heterogeneous, multi-depot, multiple traveling salesman problem. In Proceedings of the American control conference, (pp. 1292–1297), St. Louis.

    Google Scholar 

  34. Demiral, M. F., & Şen, H. (2016, May–August). Integer programming model for two-centered double traveling salesman problem. European Journal of Economics and Business Studies, 2(2). ISSN 2411-9571.

    Google Scholar 

  35. Silva, M. M., Subramanian, A., Vidal, T., & Ochi, L. S. (2012). A simple and effective metaheuristic for the minimum latency problem. European Journal of Operational Research, 221, 513–520

    Article  Google Scholar 

  36. Onder, G., Kara, I., & Derya, T. (2016). New integer programming formulation for multiple traveling repairmen problem, 19th. EURO Working group on transportation my assays Ltd., My Curve Fit software, online curve fitting. Retrieved. https://mycurvefit.com/

  37. Orman, A. J., & Williams, H. P. (2005). A survey of different integer programming formulations of the travelling salesman problem. Operational research working papers, LSEOR 04.67. Department of operational research, London school of economics and political science. Revised July 2005.

    Google Scholar 

  38. Fox, K. R., Gavish, B., & Graves, S. C. (1980). An n-constraint formulation of the (time dependent) travelling salesman problem. Operations Research, 28, 1018–1021

    Article  MathSciNet  Google Scholar 

  39. Vajda, S. (1961). Mathematical programming. Addison-Wesley.

    MATH  Google Scholar 

  40. Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of travelling salesman problems. Journal of the ACM, 3, 326–329

    Article  Google Scholar 

  41. Sawik, T. (2016). A note on the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem. Bulletin of the Polish Academy of Sciences Technical Sciences, 64(3), 2016. https://doi.org/10.1515/bpasts-2016-0057

    Article  Google Scholar 

  42. Gavish, B., & Graves, S. C. (1978). The travelling salesman problem and related problems. Working Paper OR-078-78, Operations research center, MIT.

    Google Scholar 

  43. Finke, G., Claus, A., & Gunn, E. (1983). A two-commodity network flow approach to the travelling salesman problem, Combinatorics, Graph theory and computing, Proceedings 14th South Eastern conference. Atlantic University.

    Google Scholar 

  44. Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (1954). Solutions of a large scale travelling salesman problem. Operations Research, 2, 393–410

    MATH  Google Scholar 

  45. Wong, R. T. (1980). Integer programming formulations of the travelling salesman problem. Proceedings IEEE conference on circuits and computers, (pp. 149–152). https://www.who.int/docs/default-source/coronaviruse/situation-reports/20200127-sitrep-7-2019--ncov.pdf

  46. Ain Shams University official web site. (2020). History. Retrieved. https://www.asu.edu.eg/

  47. Claus, A. (1984). A new formulation for the travelling salesman problem. SIAM Journal Algebraic and Discrete Mathods, 5, 21–25

    Article  MathSciNet  Google Scholar 

  48. Pinter, C. C., (2014). A book of set theory. Dover Publications Inc. ISBN10 0486497089, ISBN13 9780486497082.

    Google Scholar 

  49. Koopialipoor, M., & Noorbakhsh, A. (2020). Applications of artificial intelligence techniques in optimizing drilling, Chapter 6. In: A. Azizi, (Ed.), Emerging trends in mechatronics, InTechOpen. https://doi.org/10.5772/intechopen.85398

  50. Azizi, A. (2017). Introducing a novel hybrid artificial intelligence algorithm to optimize network of industrial applications in modern manufacturing. Complexity, 18. https://doi.org/10.1155/2017/8728209

  51. Mohamed, A. W., Hadi, A. A., & Mohamed, A. K. (2020). Gaining-sharing knowledge-based algorithm for solving optimization problems: A novel nature-inspired algorithm. International Journal of Machine Learning and Cybernetics, 11, 1501–1529

    Article  Google Scholar 

  52. Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2–4), 311–338

    Article  Google Scholar 

  53. Coello, C. A. C. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11–12), 1245–1287

    Article  MathSciNet  Google Scholar 

  54. Muangkote, N., Photong, L., & Sukprasert, A. (2019). Effectiveness of constrained handling techniques of improved constrained differential evolution algorithm applied to constrained optimization problems in mechanical engineering.

    Google Scholar 

  55. Long, W., Liang, X., Huang, Y., & Chen, Y. (2013). A hybrid differential evolution augmented Lagrangian method for constrained numerical and engineering optimization. Computer-Aided Design, 45(12), 1562–1574

    Article  MathSciNet  Google Scholar 

  56. Bahreininejad, A. (2019). Improving the performance of water cycle algorithm using augmented Lagrangian method. Advances in Engineering Software, 132, 55–64

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research and Decision Support, Faculty of Computers and Artificial Intelligence, Cairo University, Giza, Egypt

    Said Ali Hassan

  2. Department of Mathematics and Scientific Computing, National Institute of Technology Hamirpur, Himachal Pradesh, Hamirpur, 177005, India

    Prachi Agrawal & Talari Ganesh

  3. Operations Research Department, Faculty of Graduate Studies for Statistical Research, Cairo University, Giza, 12613, Egypt

    Ali Wagdy Mohamed

  4. Wireless Intelligent Networks Center (WINC), School of Engineering and Applied Sciences, Nile University, Giza, Egypt

    Ali Wagdy Mohamed

Authors
  1. Said Ali Hassan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prachi Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Talari Ganesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ali Wagdy Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of MCA, M. S. Ramaiah Institute of Technology, Bengaluru, Karnataka, India

    M. Niranjanamurthy

  2. Rajnagar Mahavidyalaya, Birbhum, West Bengal, India

    Siddhartha Bhattacharyya

  3. Department of Information Technology, Babasaheb Bhimrao Ambedkar University (A Central University), Lucknow, Uttar Pradesh, India

    Neeraj Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hassan, S.A., Agrawal, P., Ganesh, T., Mohamed, A.W. (2021). A Travelling Disinfection-Man Problem (TDP) for COVID-19: A Nonlinear Binary Constrained Gaining-Sharing Knowledge-Based Optimization Algorithm. In: Niranjanamurthy, M., Bhattacharyya, S., Kumar, N. (eds) Intelligent Data Analysis for COVID-19 Pandemic. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-16-1574-0_13

Download citation

Publish with us

Policies and ethics

Search

Navigation