Inicio  /  Algorithms  /  Vol: 17 Par: 2 (2024)  /  Artículo

An Adaptive Linear Programming Algorithm with Parameter Learning

Lin Guo    
Anand Balu Nellippallil    
Warren F. Smith    
Janet K. Allen and Farrokh Mistree    


When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resources, problems with the features above need to be linearized and then solved using solution algorithms for linear programming. The adaptive linear programming (ALP) algorithm is an extension of the Sequential Linear Programming algorithm where a nonlinear compromise decision support problem (cDSP) is iteratively linearized, and the resulting linear programming problem is solved with satisficing solutions returned. The reduced move coefficient (RMC) is used to define how far away from the boundary the next linearization is to be performed, and currently, it is determined based on a heuristic. The choice of RMC significantly affects the efficacy of the linearization process and, hence, the rapidity of finding the solution. In this paper, we propose a rule-based parameter-learning procedure to vary the RMC at each iteration, thereby significantly increasing the speed of determining the ultimate solution. To demonstrate the efficacy of the ALP algorithm with parameter learning (ALPPL), we use an industry-inspired problem, namely, the integrated design of a hot-rolling process chain for the production of a steel rod. Using the proposed ALPPL, we can incorporate domain expertise to identify the most relevant criteria to evaluate the performance of the linearization algorithm, quantify the criteria as evaluation indices, and tune the RMC to return the solutions that fall into the most desired range of each evaluation index. Compared with the old ALP algorithm using the golden section search to update the RMC, the ALPPL improves the algorithm by identifying the RMC values with better linearization performance without adding computational complexity. The insensitive region of the RMC is better explored using the ALPPL?the ALP only explores the insensitive region twice, whereas the ALPPL explores four times throughout the iterations. With ALPPL, we have a more comprehensive definition of linearization performance?given multiple design scenarios, using evaluation indices (EIs) including the statistics of deviations, the numbers of binding (active) constraints and bounds, the numbers of accumulated linear constraints, and the number of iterations. The desired range of evaluation indices (DEI) is also learned during the iterations. The RMC value that brings the most EIs into the DEI is returned as the best RMC, which ensures a balance between the accuracy of the linearization and the robustness of the solutions. For our test problem, the hot-rolling process chain, the ALP returns the best RMC in twelve iterations considering only the deviation as the linearization performance index, whereas the ALPPL returns the best RMC in fourteen iterations considering multiple EIs. The complexity of both the ALP and the ALPPL is O(n2). The parameter-learning steps can be customized to improve the parameter determination of other algorithms.

 Artículos similares

Tongda Lian, Shintaro Matsushita and Takayuki Aoki    
In this study, an AMR-PLIC-HF method is proposed and implemented by GPU parallel computing based on CUDA programming language and NVIDIA GPU. The present method improves the computation efficiency without compromising the accuracy and conservation of the... ver más
Revista: Applied Sciences

Angelo Borneo, Luca Zerbato, Federico Miretti, Antonio Tota, Enrico Galvagno and Daniela Anna Misul    
In recent decades, the automotive industry has moved towards the development of advanced driver assistance systems to enhance the comfort, safety, and energy saving of road vehicles. The increasing connection and communication between vehicles (V2V) and ... ver más
Revista: Applied Sciences

Yan Dai and Chao Sun    
In sonar systems, the performance of adaptive beamformers severely degrades when mismatches occur between the actual and presumed steering vectors of the desired signal, mainly due to hydrophone position errors, amplitude-phase errors, and the scattered ... ver más

Jianping Yuan, Yingying She, Yinghao Zhang, Jun Xu and Lei Wan    
This study focuses on addressing the the coupling problem of the vertical and horizontal plane of an autonomous underwater vehicle (AUV) with an X-rudder. To guarantee the steering performance of the AUV, a depth and course control algorithm based on an ... ver más

Weixuan Wang, Jingbo Peng and Yu Zhang    
This paper presents a study on the modeling and control of an aero-engine within the full flight envelope using the Takagi?Sugeno (T-S) fuzzy theory. A highly accurate aero-engine small deviation state variable model (SVM) was developed using the adaptiv... ver más
Revista: Aerospace