With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various so...With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.展开更多
Soft sensor is an efficacious solution to predict the hard-to-measure target variable by using the process variables.In practical application scenarios, however, the feedback cycle of target variable is usually larger...Soft sensor is an efficacious solution to predict the hard-to-measure target variable by using the process variables.In practical application scenarios, however, the feedback cycle of target variable is usually larger than that of the process variables, which causes the deficiency of prediction errors. Consequently soft sensor cannot be calibrated timely and deteriorates. We proposed a soft sensor calibration method by using Just-in-time modeling and Ada Boost learning method. A moving window consisting of a primary part and a secondary part is constructed.The primary part is made of history data from certain number of constant feedback cycles of target variable and the secondary part includes some coarse target values estimated initially by Just-in-time modeling during the latest feedback cycle of target variable. The data set of the whole moving window is processed by Ada Boost learning method to build an auxiliary estimation model and then target variable values of the latest corresponding feedback cycle are reestimated. Finally the soft sensor model is calibrated by using the reestimated target variable values when the target feedback is unavailable; otherwise using the feedback value. The feasibility and effectiveness of the proposed calibration method is tested and verified through a series of comparative experiments on a pH neutralization facility in our laboratory.展开更多
基金This work was supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)Thanks to Professor Weijin Jiang for his guidance and suggestions on this research.Funding Statement。
文摘With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.
基金Supported by the National Basic Research Program of China(2012CB720500)
文摘Soft sensor is an efficacious solution to predict the hard-to-measure target variable by using the process variables.In practical application scenarios, however, the feedback cycle of target variable is usually larger than that of the process variables, which causes the deficiency of prediction errors. Consequently soft sensor cannot be calibrated timely and deteriorates. We proposed a soft sensor calibration method by using Just-in-time modeling and Ada Boost learning method. A moving window consisting of a primary part and a secondary part is constructed.The primary part is made of history data from certain number of constant feedback cycles of target variable and the secondary part includes some coarse target values estimated initially by Just-in-time modeling during the latest feedback cycle of target variable. The data set of the whole moving window is processed by Ada Boost learning method to build an auxiliary estimation model and then target variable values of the latest corresponding feedback cycle are reestimated. Finally the soft sensor model is calibrated by using the reestimated target variable values when the target feedback is unavailable; otherwise using the feedback value. The feasibility and effectiveness of the proposed calibration method is tested and verified through a series of comparative experiments on a pH neutralization facility in our laboratory.
