A Knowledge-Driven Optimization Planning Method for Emergency Command Communication Networking
Year: 2026
Type: article
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.
Source: Applied Sciences
DOI: 10.3390/app162211223
Institution: National University of Defense Technology
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: gold
Estimated APC paid: $2,896
Award: G9001333499
OpenAlex ID: W7225904845
