Search results
1 – 2 of 2Qi Zhou, Xinyu Shao, Ping Jiang, Tingli Xie, Jiexiang Hu, Leshi Shu, Longchao Cao and Zhongmei Gao
Engineering system design and optimization problems are usually multi-objective and constrained and have uncertainties in the inputs. These uncertainties might significantly…
Abstract
Purpose
Engineering system design and optimization problems are usually multi-objective and constrained and have uncertainties in the inputs. These uncertainties might significantly degrade the overall performance of engineering systems and change the feasibility of the obtained solutions. This paper aims to propose a multi-objective robust optimization approach based on Kriging metamodel (K-MORO) to obtain the robust Pareto set under the interval uncertainty.
Design/methodology/approach
In K-MORO, the nested optimization structure is reduced into a single loop optimization structure to ease the computational burden. Considering the interpolation uncertainty from the Kriging metamodel may affect the robustness of the Pareto optima, an objective switching and sequential updating strategy is introduced in K-MORO to determine (1) whether the robust analysis or the Kriging metamodel should be used to evaluate the robustness of design alternatives, and (2) which design alternatives are selected to improve the prediction accuracy of the Kriging metamodel during the robust optimization process.
Findings
Five numerical and engineering cases are used to demonstrate the applicability of the proposed approach. The results illustrate that K-MORO is able to obtain robust Pareto frontier, while significantly reducing computational cost.
Practical implications
The proposed approach exhibits great capability for practical engineering design optimization problems that are multi-objective and constrained and have uncertainties.
Originality/value
A K-MORO approach is proposed, which can obtain the robust Pareto set under the interval uncertainty and ease the computational burden of the robust optimization process.
Details
Keywords
Zhongmei Zhang, Qingyang Hu, Guanxin Hou and Shuai Zhang
Vehicle companion is one of the most common companion patterns in daily life, which has great value to accident investigation, group tracking, carpooling recommendation and road…
Abstract
Purpose
Vehicle companion is one of the most common companion patterns in daily life, which has great value to accident investigation, group tracking, carpooling recommendation and road planning. Due to the complexity and large scale of vehicle sensor streaming data, existing work were difficult to ensure the efficiency and effectiveness of real-time vehicle companion discovery (VCD). This paper aims to provide a high-quality and low-cost method to discover vehicle companions in real time.
Design/methodology/approach
This paper provides a real-time VCD method based on pro-active data service collaboration. This study makes use of dynamic service collaboration to selectively process data produced by relative sensors, and relax the temporal and spatial constraints of vehicle companion pattern for discovering more potential companion vehicles.
Findings
Experiments based on real and simulated data show that the method can discover 67% more companion vehicles, with 62% less response time comparing with centralized method.
Originality/value
To reduce the amount of processing streaming data, this study provides a Service Collaboration-based Vehicle Companion Discovery method based on proactive data service model. And this study provides a new definition of vehicle companion through relaxing the temporal and spatial constraints for discover companion vehicles as many as possible.
Details