One important mission of strategic defense is to develop an integrated layered Ballistic Missile Defense System (BMDS). Motivated by the queueing theory, we presented a work for the representation, modeling, performance simulation, and channels optimal allocation of the layered BMDS M/M/N queueing systems. Firstly, in order to simulate the process of defense and to study the Defense Effectiveness (DE), we modeled and simulated the M/M/N queueing system of layered BMDS. Specifically, we proposed the M/M/N/N and M/M/N/C queueing model for short defense depth and long defense depth, respectively; single target channel and multiple target channels were distinguished in each model. Secondly, we considered the problem of assigning limited target channels to incoming targets, we illustrated how to allocate channels for achieving the best DE, and we also proposed a novel and robust search algorithm for obtaining the minimum channel requirements across a set of neighborhoods. Simultaneously, we presented examples of optimal allocation problems under different constraints. Thirdly, several simulation examples verified the effectiveness of the proposed queueing models. This work may help to understand the rules of queueing process and to provide optimal configuration suggestions for defense decision-making.
21 July 2016 in Journal of Systems Engineering and Electronics
One important mission of the strategic defense is to develop an integrated, layered ballistic missile defense system (BMDS). Considering the problem of assigning limited defense weapons to incoming ballistic missiles, we illustrate how defense weapons, ballistic missiles, kill probability and effectiveness of defense (ED) are interrelated and how to understand this relationship for achieving the best allocation plan. Motivated by the queueing theory, in which the available resources are not sufficient to satisfy the demands placed upon them at all times, the layered deployed defense weapon is modeled as a queueing system to shoot Poisson arrived targets. Simultaneously, examples, of optimum intercepts allocation problems under different constraints are presented. The four theorems determine the allocation rules of intercepts to targets that maximize ED or minimize the cost to achieve a required ED.
15 March 2020 in International Journal of Bifurcation and Chaos
The logistics demands of industries represented by e-commerce have experienced explosive growth in recent years. Vehicle path-planning plays a crucial role in optimization systems for logistics and distribution. A path-planning scheme suitable for an actual scenario is the key to reducing costs and improving service efficiency in logistics industries. In complex application scenarios, however, it is difficult for conventional heuristic algorithms to ensure the quality of solutions for vehicle routing problems. This study proposes a joint approach based on the genetic algorithm and graph convolutional network for solving the capacitated vehicle routing problem with multiple distribution centers. First, we use the heuristic method to modularize the complex environment and encode each module based on the constraint conditions. Next, the graph convolutional network is adopted for feature embedding for the graph representation of the vehicle routing problem, and multiple decoders are used to increase the diversity of the solution space. Meanwhile, the REINFORCE algorithm with a baseline is employed to train the model, ensuring quick returns of high-quality solutions. Moreover, the fitness function is calculated based on the solution to each module, and the genetic algorithm is employed to seek the optimal solution on a global scale. Finally, the effectiveness of the proposed framework is validated through experiments at different scales and comparisons with other algorithms. The experimental results show that, compared to the single decoder GCN-based solving method, the method proposed in this paper improves the solving success rate to 100% across 15 generated instances. The average path length obtained is only 11% of the optimal solution produced by the GCN-based multi-decoder method.