EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Knowledge-Driven Optimization Planning Method for Emergency Command Communication Networking

Yao Li, Jiaqi Liu, Chang Guo, Wei Gao, Zhenhai Lu, Jingke Wan, Chao Zhang, Jungang Yang

Applied Sciences · 12.11.2026 · 16 (22) · 11223

DOI: 10.3390/app162211223 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 12.11.2026. Verfasst von Yao Li und 7 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National University of Defense Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

After a major earthquake, public communication infrastructure is frequently paralyzed by damage, power outages, and traffic congestion, compelling emergency command systems to rapidly establish reliable dedicated communication networks under limited communication resources. To address the low efficiency of manual networking planning and the difficulty in guaranteeing constraint satisfaction and traceability, this paper proposes a knowledge-driven optimization planning method for emergency command communication networking. The method formalizes domain knowledge into ontologies, rules, and constraints, constructs a lexicographic multi-objective 0–1 integer programming model with the objectives of minimizing the number of networks, minimizing radio usage, maximizing the backup degree of critical links, minimizing business mixing, and, in degraded scenarios, a fifth, lowest-priority recommended-means deviation, solves the model exactly with the Constraint Programming–SAT (CP-SAT) solver, and designs a three-layer evidence chain mechanism (demand–resource–decision) to render the resulting networking schemes traceable. Experimental results based on a municipal earthquake emergency command communication scenario show that the method obtains optimal solutions while satisfying all formalized constraints and that, across ten repeated runs, CP-SAT proves global optimality of all four lexicographic stages within 8.27 ± 1.35 s (the fifth deviation stage being provably vacuous in the baseline), whereas the branch-and-bound solver fails to prove optimality of the business-mixing stage within a 300 s time limit; link-feasibility and scenario-variation experiments further verify that the method detects infeasible scenarios and adapts the scheme under link damage, demand growth, and equipment loss, with the solution time increasing with the problem scale and the bottleneck concentrated in the optimality proof of the business-mixing penalty stage.

Förderung

  • National University of Defense Technology

Zitieren

APA

Li, Y., Liu, J., Guo, C., Gao, W., Lu, Z., Wan, J., Zhang, C., & Yang, J. (2026). A Knowledge-Driven Optimization Planning Method for Emergency Command Communication Networking. Applied Sciences, 16(22), 11223. https://doi.org/10.3390/app162211223

Vancouver

Li Y, Liu J, Guo C, Gao W, Lu Z, Wan J, et al. A Knowledge-Driven Optimization Planning Method for Emergency Command Communication Networking. Applied Sciences. 2026;16(22):11223. doi:10.3390/app162211223

BibTeX
@article{Li2026,
  author = {Li, Yao and Liu, Jiaqi and Guo, Chang and Gao, Wei and Lu, Zhenhai and Wan, Jingke and Zhang, Chao and Yang, Jungang},
  title = {A Knowledge-Driven Optimization Planning Method for Emergency Command Communication Networking},
  journal = {Applied Sciences},
  year = {2026},
  volume = {16},
  number = {22},
  pages = {11223},
  doi = {10.3390/app162211223}
}
Kostenlos starten →