Sustainable service oriented equipment maintenance management of steel enterprises using a two-stage optimization approach

2022 ◽  
Vol 75 ◽  
pp. 102311
Author(s):  
Wei Qin ◽  
Zilong Zhuang ◽  
Yang Liu ◽  
Jie Xu
Networks ◽  
2017 ◽  
Vol 69 (2) ◽  
pp. 189-204 ◽  
Author(s):  
Maciej Rysz ◽  
Pavlo A. Krokhmal ◽  
Eduardo L. Pasiliao

Author(s):  
Rui Qiu ◽  
Yongtu Liang

Abstract Currently, unmanned aerial vehicle (UAV) provides the possibility of comprehensive coverage and multi-dimensional visualization of pipeline monitoring. Encouraged by industry policy, research on UAV path planning in pipeline network inspection has emerged. The difficulties of this issue lie in strict operational requirements, variable flight missions, as well as unified optimization for UAV deployment and real-time path planning. Meanwhile, the intricate structure and large scale of the pipeline network further complicate this issue. At present, there is still room to improve the practicality and applicability of the mathematical model and solution strategy. Aiming at this problem, this paper proposes a novel two-stage optimization approach for UAV path planning in pipeline network inspection. The first stage is conventional pre-flight planning, where the requirement for optimality is higher than calculation time. Therefore, a mixed integer linear programming (MILP) model is established and solved by the commercial solver to obtain the optimal UAV number, take-off location and detailed flight path. The second stage is re-planning during the flight, taking into account frequent pipeline accidents (e.g. leaks and cracks). In this stage, the flight path must be timely rescheduled to identify specific hazardous locations. Thus, the requirement for calculation time is higher than optimality and the genetic algorithm is used for solution to satisfy the timeliness of decision-making. Finally, the proposed method is applied to the UAV inspection of a branched oil and gas transmission pipeline network with 36 nodes and the results are analyzed in detail in terms of computational performance. In the first stage, compared to manpower inspection, the total cost and time of UAV inspection is decreased by 54% and 56% respectively. In the second stage, it takes less than 1 minute to obtain a suboptimal solution, verifying the applicability and superiority of the method.


2004 ◽  
Vol 16 (6) ◽  
pp. 1193-1234 ◽  
Author(s):  
Yuanqing Li ◽  
Andrzej Cichocki ◽  
Shun-ichi Amari

In this letter, we analyze a two-stage cluster-then-l1-optimization approach for sparse representation of a data matrix, which is also a promising approach for blind source separation (BSS) in which fewer sensors than sources are present. First, sparse representation (factorization) of a data matrix is discussed. For a given overcomplete basis matrix, the corresponding sparse solution (coefficient matrix) with minimum l1 norm is unique with probability one, which can be obtained using a standard linear programming algorithm. The equivalence of the l1—norm solution and the l0—norm solution is also analyzed according to a probabilistic framework. If the obtained l1—norm solution is sufficiently sparse, then it is equal to the l0—norm solution with a high probability. Furthermore, the l1—norm solution is robust to noise, but the l0—norm solution is not, showing that the l1—norm is a good sparsity measure. These results can be used as a recoverability analysis of BSS, as discussed. The basis matrix in this article is estimated using a clustering algorithm followed by normalization, in which the matrix columns are the cluster centers of normalized data column vectors. Zibulevsky, Pearlmutter, Boll, and Kisilev (2000) used this kind of two-stage approach in underdetermined BSS. Our recoverability analysis shows that this approach can deal with the situation in which the sources are overlapped to some degree in the analyzed


2018 ◽  
Vol 204 ◽  
pp. 214-226 ◽  
Author(s):  
Jiangtao Hong ◽  
Ali Diabat ◽  
Vinay V. Panicker ◽  
Sridharan Rajagopalan

Sign in / Sign up

Export Citation Format

Share Document