As the Internet of Things(IoT)and mobile devices have rapidly proliferated,their computationally intensive applications have developed into complex,concurrent IoT-based workflows involving multiple interdependent task...As the Internet of Things(IoT)and mobile devices have rapidly proliferated,their computationally intensive applications have developed into complex,concurrent IoT-based workflows involving multiple interdependent tasks.By exploiting its low latency and high bandwidth,mobile edge computing(MEC)has emerged to achieve the high-performance computation offloading of these applications to satisfy the quality-of-service requirements of workflows and devices.In this study,we propose an offloading strategy for IoT-based workflows in a high-performance MEC environment.The proposed task-based offloading strategy consists of an optimization problem that includes task dependency,communication costs,workflow constraints,device energy consumption,and the heterogeneous characteristics of the edge environment.In addition,the optimal placement of workflow tasks is optimized using a discrete teaching learning-based optimization(DTLBO)metaheuristic.Extensive experimental evaluations demonstrate that the proposed offloading strategy is effective at minimizing the energy consumption of mobile devices and reducing the execution times of workflows compared to offloading strategies using different metaheuristics,including particle swarm optimization and ant colony optimization.展开更多
The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contribute...The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contributed significantly to the development of this field,these approaches either are limited in problem size or need manual intervention in choosing parameters.To solve these difficulties,many studies have considered learning-based optimization(LBO)algorithms to solve the VRP.This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms.Finally,we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.展开更多
Remanufacturing contributes to achieving economical,environmental,and social sustainability,and one of its main steps is disassembly aiming to acquire a set of recyclable and reusable components from endof-life produc...Remanufacturing contributes to achieving economical,environmental,and social sustainability,and one of its main steps is disassembly aiming to acquire a set of recyclable and reusable components from endof-life products.This research considers a multi-objective multi-product disassembly sequence planning problem under uncertain circumstances to realize a trade-off among economic,environmental,and social sustainability.Firstly,a multi-objective chance-constrained programming model is formulized to achieve maximal disassembly profit and minimal noise pollution while satisfying energy consumption requirements and obeying various complex product structures.Secondly,a multi-objective group teaching optimization algorithm combining a stochastic simulation approach is particularly devised to handle the problem.In the designed approach,problem-specific encoding and decoding methods are employed to represent and produce feasible solutions.The stochastic simulation approach is utilized to assess the feasibility and performance of the obtained solutions under uncertain environments.Rank and crowding distance approaches are introduced to realize ability grouping,namely,dividing the population into two groups.Precedence preserving crossover and mutation operators are separately utilized on the two groups to achieve population evolution,and an adaptive local search method is developed to enhance exploitation.Thirdly,comparison experiments on some real-world test problems with different scales are carried out.Through dissecting the experimental results with three performance metrics,it can be observed that the devised approach outperforms its competitors by 9.39%-10.00%,11.37%-59.86%,and 2.36%-7.73%regarding performance,respectively.The experimental results demonstrate the efficiency and excellence of the devised approach in providing high-quality disassembly schemes for managers and engineers.展开更多
Purpose–The purpose of this paper is to propose a novel improved teaching and learning-based algorithm(TLBO)to enhance its convergence ability and solution accuracy,making it more suitable for solving large-scale opt...Purpose–The purpose of this paper is to propose a novel improved teaching and learning-based algorithm(TLBO)to enhance its convergence ability and solution accuracy,making it more suitable for solving large-scale optimization issues.Design/methodology/approach–Utilizing multiple cooperation mechanisms in teaching and learning processes,an improved TBLO named CTLBO(collectivism teaching-learning-based optimization)is developed.This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes.Applying modularizationidea,based on the configuration structure of operators ofCTLBO,six variants ofCTLBOare constructed.Foridentifying the best configuration,30 general benchmark functions are tested.Then,three experiments using CEC2020(2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms.At last,a large-scale industrial engineering problem is taken as the application case.Findings–Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO.Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems.The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem,while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c,revealing that CTLBO and its variants can far outperform other algorithms.CTLBO is an excellent algorithm for solving large-scale complex optimization issues.Originality/value–The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism,self-learning mechanism in teaching and group teaching mechanism.CTLBO has important application value in solving large-scale optimization problems.展开更多
With the emergence of the artificial intelligence era,all kinds of robots are traditionally used in agricultural production.However,studies concerning the robot task assignment problem in the agriculture field,which i...With the emergence of the artificial intelligence era,all kinds of robots are traditionally used in agricultural production.However,studies concerning the robot task assignment problem in the agriculture field,which is closely related to the cost and efficiency of a smart farm,are limited.Therefore,a Multi-Weeding Robot Task Assignment(MWRTA)problem is addressed in this paper to minimize the maximum completion time and residual herbicide.A mathematical model is set up,and a Multi-Objective Teaching-Learning-Based Optimization(MOTLBO)algorithm is presented to solve the problem.In the MOTLBO algorithm,a heuristicbased initialization comprising an improved Nawaz Enscore,and Ham(NEH)heuristic and maximum loadbased heuristic is used to generate an initial population with a high level of quality and diversity.An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule.A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm.Finally,a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature.Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.展开更多
The energy consumption of a teaching building can be effectively reduced by timetable optimization.However,in most studies that explore methods to reduce building energy consumption by course timetable optimization,se...The energy consumption of a teaching building can be effectively reduced by timetable optimization.However,in most studies that explore methods to reduce building energy consumption by course timetable optimization,self-study activities are not considered.In this study,an MATLAB-EnergyPlus joint simulation model was constructed based on the Building Controls Virtual Test Bed platform to reduce building energy consumption by optimizing the course schedule and opening strategy of self-study rooms in a holistic way.The following results were obtained by taking a university in Xi’an as an example:(1)The energy saving percentages obtained by timetabling optimization during the heating season examination week,heating season non-examination week,cooling season examination week,and cooling season non-examination week are 35%,29.4%,13.4%,and 13.4%,respectively.(2)Regarding the temporal arrangement,most courses are scheduled in the morning during the cooling season and afternoon during the heating season.Regarding the spatial arrangement,most courses are arranged in the central section of the middle floors of the building.(3)During the heating season,the additional building energy consumption incurred by the opening of self-study rooms decreases when duty heating temperature increases.展开更多
The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor...The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.展开更多
成果导向教育(OBE)强调以学生学习成果为导向进行教学设计,而课程成绩关联分析可为OBE实施提供数据支持。随着教育大数据技术的快速发展,数据驱动的教学决策正成为高等教育改革的重要方向。本研究利用Apriori算法对新疆某财经类高校保...成果导向教育(OBE)强调以学生学习成果为导向进行教学设计,而课程成绩关联分析可为OBE实施提供数据支持。随着教育大数据技术的快速发展,数据驱动的教学决策正成为高等教育改革的重要方向。本研究利用Apriori算法对新疆某财经类高校保险专业培养方案中6门专业核心课程的共计140名学生的课程成绩数据,进行关联规则挖掘和数据分析研究。通过构建"数据挖掘-教学诊断-优化实施"的闭环模型,结合OBE(Outcome Based Education)教育理念,运用教育测量学理论与机器学习方法交叉验证,从课程体系重构、教学策略优化两个方面提出OBE理念下的保险专业培养方案改进建议。研究创新性地建立课程关联强度量化指标体系,为保险学专业OBE理念下的培养方案制定提供数据参考。展开更多
摘要As the Internet of Things(IoT)and mobile devices have rapidly proliferated,their computationally intensive applications have developed into complex,concurrent IoT-based workflows involving multiple interdependent tasks.By exploiting its low latency and high bandwidth,mobile edge computing(MEC)has emerged to achieve the high-performance computation offloading of these applications to satisfy the quality-of-service requirements of workflows and devices.In this study,we propose an offloading strategy for IoT-based workflows in a high-performance MEC environment.The proposed task-based offloading strategy consists of an optimization problem that includes task dependency,communication costs,workflow constraints,device energy consumption,and the heterogeneous characteristics of the edge environment.In addition,the optimal placement of workflow tasks is optimized using a discrete teaching learning-based optimization(DTLBO)metaheuristic.Extensive experimental evaluations demonstrate that the proposed offloading strategy is effective at minimizing the energy consumption of mobile devices and reducing the execution times of workflows compared to offloading strategies using different metaheuristics,including particle swarm optimization and ant colony optimization.
摘要The vehicle routing problem(VRP)is a typical discrete combinatorial optimization problem,and many models and algorithms have been proposed to solve the VRP and its variants.Although existing approaches have contributed significantly to the development of this field,these approaches either are limited in problem size or need manual intervention in choosing parameters.To solve these difficulties,many studies have considered learning-based optimization(LBO)algorithms to solve the VRP.This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms.Finally,we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.
基金supported in part by the National Natural Science Foundation of China(Nos.62173356 and 61703320)Shandong Province Outstanding Youth Innovation Team Project of Colleges and Universities(No.2020RWG011)+4 种基金Natural Science Foundation of Shandong Province(No.ZR202111110025)Science and Technology Development Fund(FDCT)Macao SAR(No.0019/2021/A)Innovation Centre for Digital Business and Capital Development of Beijing Technology and Business University(No.SZSK202208)Zhuhai Industry-University-Research Project with Hongkong and Macao(No.ZH22017002210014PWC).
摘要Remanufacturing contributes to achieving economical,environmental,and social sustainability,and one of its main steps is disassembly aiming to acquire a set of recyclable and reusable components from endof-life products.This research considers a multi-objective multi-product disassembly sequence planning problem under uncertain circumstances to realize a trade-off among economic,environmental,and social sustainability.Firstly,a multi-objective chance-constrained programming model is formulized to achieve maximal disassembly profit and minimal noise pollution while satisfying energy consumption requirements and obeying various complex product structures.Secondly,a multi-objective group teaching optimization algorithm combining a stochastic simulation approach is particularly devised to handle the problem.In the designed approach,problem-specific encoding and decoding methods are employed to represent and produce feasible solutions.The stochastic simulation approach is utilized to assess the feasibility and performance of the obtained solutions under uncertain environments.Rank and crowding distance approaches are introduced to realize ability grouping,namely,dividing the population into two groups.Precedence preserving crossover and mutation operators are separately utilized on the two groups to achieve population evolution,and an adaptive local search method is developed to enhance exploitation.Thirdly,comparison experiments on some real-world test problems with different scales are carried out.Through dissecting the experimental results with three performance metrics,it can be observed that the devised approach outperforms its competitors by 9.39%-10.00%,11.37%-59.86%,and 2.36%-7.73%regarding performance,respectively.The experimental results demonstrate the efficiency and excellence of the devised approach in providing high-quality disassembly schemes for managers and engineers.
基金This research is funded by the National Natural Science Foundation of China(#71772191).
摘要Purpose–The purpose of this paper is to propose a novel improved teaching and learning-based algorithm(TLBO)to enhance its convergence ability and solution accuracy,making it more suitable for solving large-scale optimization issues.Design/methodology/approach–Utilizing multiple cooperation mechanisms in teaching and learning processes,an improved TBLO named CTLBO(collectivism teaching-learning-based optimization)is developed.This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes.Applying modularizationidea,based on the configuration structure of operators ofCTLBO,six variants ofCTLBOare constructed.Foridentifying the best configuration,30 general benchmark functions are tested.Then,three experiments using CEC2020(2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms.At last,a large-scale industrial engineering problem is taken as the application case.Findings–Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO.Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems.The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem,while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c,revealing that CTLBO and its variants can far outperform other algorithms.CTLBO is an excellent algorithm for solving large-scale complex optimization issues.Originality/value–The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism,self-learning mechanism in teaching and group teaching mechanism.CTLBO has important application value in solving large-scale optimization problems.
基金supported by the National Natural Science Foundation of China(Nos.62273221 and 61973203)the Program of Shanghai Academic/Technology Research Leader(No.21XD1401000)the Shanghai Key Laboratory of Power Station Automation Technology.
摘要With the emergence of the artificial intelligence era,all kinds of robots are traditionally used in agricultural production.However,studies concerning the robot task assignment problem in the agriculture field,which is closely related to the cost and efficiency of a smart farm,are limited.Therefore,a Multi-Weeding Robot Task Assignment(MWRTA)problem is addressed in this paper to minimize the maximum completion time and residual herbicide.A mathematical model is set up,and a Multi-Objective Teaching-Learning-Based Optimization(MOTLBO)algorithm is presented to solve the problem.In the MOTLBO algorithm,a heuristicbased initialization comprising an improved Nawaz Enscore,and Ham(NEH)heuristic and maximum loadbased heuristic is used to generate an initial population with a high level of quality and diversity.An effective teaching-learning-based optimization process is designed with a dynamic grouping mechanism and a redefined individual updating rule.A multi-neighborhood-based local search strategy is provided to balance the exploitation and exploration of the algorithm.Finally,a comprehensive experiment is conducted to compare the proposed algorithm with several state-of-the-art algorithms in the literature.Experimental results demonstrate the significant superiority of the proposed algorithm for solving the problem under consideration.
摘要针对现有变电站碳排放量预测模型存在考虑指标较少、数据更新慢等问题,本文提出一种基于改进萤火虫算法(improved firefly algorithm,IFA)优化反向传播(back propagation,BP)神经网络的变电站碳排放预测模型。首先,针对萤火虫算法(firefly algorithm,FA)收敛速度过慢以及易陷入局部最优等问题,引入教与学因子,修改萤火虫位置更新过程,以提高群体适应度。其次,引入IFA算法对BP神经网络模型进行超参数寻优,并构建IFA-BP神经网络预测模型。然后,基于CRITIC法筛选预测模型输入层的关键碳排放指标。最后,利用训练集数据训练预测模型,基于训练好的模型对变电站的碳排放量进行预测。仿真结果表明,相较于3种对比方案,本文IFA-BP神经网络预测模型分别在均方根误差(root mean square error,RMSE)上降低59.61%、15.77%和26.65%,在决定系数(coefficient of determination,R2)上提高5.66%、1.46%和1.15%,充分验证了本文所提变电站碳排放预测模型的可行性与优越性。
基金supported by the National Natural Science Foundation of China (52008328)National Key Research and Development Project (2018YFD1100202)+1 种基金the Science and Technology Department of Shaanxi Province (2020SF-393,2018ZDCXL-SF-03-04)the State Key Laboratory of Green Building in Western China (LSZZ202009).
摘要The energy consumption of a teaching building can be effectively reduced by timetable optimization.However,in most studies that explore methods to reduce building energy consumption by course timetable optimization,self-study activities are not considered.In this study,an MATLAB-EnergyPlus joint simulation model was constructed based on the Building Controls Virtual Test Bed platform to reduce building energy consumption by optimizing the course schedule and opening strategy of self-study rooms in a holistic way.The following results were obtained by taking a university in Xi’an as an example:(1)The energy saving percentages obtained by timetabling optimization during the heating season examination week,heating season non-examination week,cooling season examination week,and cooling season non-examination week are 35%,29.4%,13.4%,and 13.4%,respectively.(2)Regarding the temporal arrangement,most courses are scheduled in the morning during the cooling season and afternoon during the heating season.Regarding the spatial arrangement,most courses are arranged in the central section of the middle floors of the building.(3)During the heating season,the additional building energy consumption incurred by the opening of self-study rooms decreases when duty heating temperature increases.
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
摘要The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.
摘要成果导向教育(OBE)强调以学生学习成果为导向进行教学设计,而课程成绩关联分析可为OBE实施提供数据支持。随着教育大数据技术的快速发展,数据驱动的教学决策正成为高等教育改革的重要方向。本研究利用Apriori算法对新疆某财经类高校保险专业培养方案中6门专业核心课程的共计140名学生的课程成绩数据,进行关联规则挖掘和数据分析研究。通过构建"数据挖掘-教学诊断-优化实施"的闭环模型,结合OBE(Outcome Based Education)教育理念,运用教育测量学理论与机器学习方法交叉验证,从课程体系重构、教学策略优化两个方面提出OBE理念下的保险专业培养方案改进建议。研究创新性地建立课程关联强度量化指标体系,为保险学专业OBE理念下的培养方案制定提供数据参考。