The new treatment mode research of hepatitis B based on ant colony algorithm

Jing Yu (), Lining Xing () and Xu Tan ()
Additional contact information
Jing Yu: National University of Defense Technology
Lining Xing: National University of Defense Technology
Xu Tan: ShenZhen Institute of Information Technology

Journal of Combinatorial Optimization, No 0, 20 pages

Abstract: Abstract Hepatitis B (HB) is a deadly disease that has a severe impact on infected individuals. In China, not only are the incidence and infection rates of HB very high, but also many HB patients suffer from mental illness associated with anxiety and fear because of HB-associated symptoms. This exacerbates the patients’ condition, potentially increasing the risk of mortality. In this paper, we propose a new treatment mode to improve the therapeutic efficiency and patients’ satisfaction with their healthcare. In a single process of this new treatment, several patients with similar disease symptoms are treated by one doctor at the same time. This new treatment mode can not only relieve the anxiety and fear of HB patients, and improve patients’ cognition rate of HB, but also reduce the HB infection rate, slow down the progression of disease symptoms, and shorten the course. If patients with similar disease symptoms are to be grouped together, there is a need to determine the optimal patient batch combination, which can be solved in the new mode, called patient combined problem (PCP). We also constructed a mathematical model of PCP, and present the ant colony (AC) algorithm and Enhanced AC with a P-3-exchange operator for PCP in the new treatment mode in this paper. We also performed an experiment that showed that our proposed algorithms are very fast and effective for solving this problem.

Keywords: Hepatitis B; Combinatorial optimization; Ant colony algorithm; Patient satisfaction; New treatment mode; Local search (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00478-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00478-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00478-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().