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

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.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-12
DOI
https://doi.org/10.3390/app162211223
Primary Topic
Facility Location and Emergency Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

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

Jungang Yang, Caifen Guo, Yao Li, Wei Gao et al.
Applied Sciences
Facility Location and Emergency Management
article

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

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

Abstract

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.

Applied SciencesVol. 16(22)
National University of Defense Technology (CN)
National University of Defense Technology
Industry, innovation and infrastructure, Sustainable cities and communities
Facility Location and Emergency Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon