To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algor...To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algorithm(BOA),the fragrance coefficient is designed to balance the exploration and exploitation of BOA.The variant particle swarm local search strategy is proposed to improve the local search ability of the current optimal butterfly and prevent the algorithm from falling into local optimality.192000-dimensional functions and 201000-dimensional CEC 2010 large-scale functions are used to verify FPSBOA for complex large-scale optimization problems.The experimental results are statistically analyzed by Friedman test and Wilcoxon rank-sum test.All attained results demonstrated that FPSBOA can better solve more challenging scientific and industrial real-world problems with thousands of variables.Finally,four mechanical engineering problems and one ten-dimensional process synthesis and design problem are applied to FPSBOA,which shows FPSBOA has the feasibility and effectiveness in real-world application problems.展开更多
This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can...This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.展开更多
Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among air...Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.展开更多
Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged a...Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.展开更多
To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,...To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.展开更多
针对基于自主移动机器人(Autonomous Mobile Robot,AMR)的货到人拣选系统多拣货台场景,研究订单分配、处理顺序及货架访问顺序的集成优化,提出多拣货台订单分配与排序问题(Order Allocation and Sequencing Problem,OASP),对订单如何分...针对基于自主移动机器人(Autonomous Mobile Robot,AMR)的货到人拣选系统多拣货台场景,研究订单分配、处理顺序及货架访问顺序的集成优化,提出多拣货台订单分配与排序问题(Order Allocation and Sequencing Problem,OASP),对订单如何分配给拣货台、订单在拣货台的处理顺序及如何安排货架的访问顺序进行集成优化决策,并以最小化订单拣选时间为目标建立混合整数规划模型.设计变邻域搜索算法(the Variable Neighborhood Search Algorithm,VNSA),通过订单相似度进行分批分配并生成贪婪初始解,结合货架置换、订单重分配的抖动算子和订单交换/插入、货架序列调整等4种局部优化邻域,采用动态切换机制实现迭代寻优,并将设计的算法与CPLEX求解器进行比较.研究结果表明:VNSA算法在小规模算例中求解速度与精度优于CPLEX求解器;在大规模算例中对初始解的优化能力显著,验证了联合优化订单分配和排序的有效性;订单拣选时间与拣货台数量、容量呈负相关,与负载平衡系数呈正相关.展开更多
为了研究地面车辆与无人机在巡检过程中的最佳任务分配策略及路径规划问题,提出一种两阶段混合式启发算法——改进自适应大邻域搜索(improved adaptive large neighborhood search,IALNS)算法。第一阶段根据待巡检节点的不同需求等级及...为了研究地面车辆与无人机在巡检过程中的最佳任务分配策略及路径规划问题,提出一种两阶段混合式启发算法——改进自适应大邻域搜索(improved adaptive large neighborhood search,IALNS)算法。第一阶段根据待巡检节点的不同需求等级及距离等因素,利用聚类算法对目标节点进行划分;第二阶段采用一种混合式启发算法解决路线调度问题,增加6种新的局部优化算子,引入节点重分配策略,经过迭代得到成本最小的车辆与无人机协同混合路线。对所提算法解和其他算法解进行测试和比较分析,试验数据表明,IALNS算法在解决车辆与无人机协同巡检问题时具有显著优势。展开更多
基金funded by the National Natural Science Foundation of China(No.72104069)the Science and Technology Department of Henan Province,China(No.182102310886 and 162102110109)the Postgraduate Meritocracy Scheme,hina(No.SYL19060145).
文摘To solve large-scale optimization problems,Fragrance coefficient and variant Particle Swarm local search Butterfly Optimization Algorithm(FPSBOA)is proposed.In the position update stage of Butterfly Optimization Algorithm(BOA),the fragrance coefficient is designed to balance the exploration and exploitation of BOA.The variant particle swarm local search strategy is proposed to improve the local search ability of the current optimal butterfly and prevent the algorithm from falling into local optimality.192000-dimensional functions and 201000-dimensional CEC 2010 large-scale functions are used to verify FPSBOA for complex large-scale optimization problems.The experimental results are statistically analyzed by Friedman test and Wilcoxon rank-sum test.All attained results demonstrated that FPSBOA can better solve more challenging scientific and industrial real-world problems with thousands of variables.Finally,four mechanical engineering problems and one ten-dimensional process synthesis and design problem are applied to FPSBOA,which shows FPSBOA has the feasibility and effectiveness in real-world application problems.
文摘This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.
基金supported in part by the National Natural Science Foundation of China(Nos.62167003,52302421)in part by the Diversified Investment Fund of Tianjin,China(No.23JCQNJC00210)。
文摘Airports around the world commonly face challenges in managing airport slot allocation.Effective management of limited slot resources by civil aviation authority often requires redistributing requested slots among airlines.The allocation process must operate within the prescribed capacity limits of the airport while adhering to established priorities and regulations.Additionally,ensuring market fairness is a key objective,as the value of airport slots plays a significant role in the adjustment process.This transforms the traditional time-shift-based problem into a complex multi-objective optimization problem.Addressing such complications is of significant importance to airlines,airports,and passengers alike.Due to the complexity of fairness metrics,traditional integer programming models encounter difficulties in finding effective solutions.This study proposes a neighborhood search strategy to tackle the single airport slot allocation,making it adaptable to both static and rolling capacity scenarios.Two Genetic Algorithms(GAs)are introduced,corresponding to time adjustment and sequence adjustment strategies,respectively.The GA based on the time adjustment strategy demonstrates high robustness,while the sequence adjustment strategy builds upon this GA to develop a simple heuristic algorithm that offers rapid convergence.Case studies conducted at seven airports in China confirm that all three algorithms yield high-quality adjustment solutions suitable for the majority of applications.Further,Pareto analysis reveals that these algorithms effectively balance the adjustment shifts and fairness metrics,demonstrating high practical value and broad applicability.
基金This work was supported by the Natural Science Foundation of China(Nos.61672478 and 61806090)the National Key Research and Development Program of China(No.2017YFB1003102)+4 种基金the Guangdong Provincial Key Laboratory(No.2020B121201001)the Shenzhen Peacock Plan(No.KQTD2016112514355531)the Guangdong-Hong Kong-Macao Greater Bay Area Center for Brain Science and Brain-inspired Intelligence Fund(No.2019028)the Fellowship of China Postdoctoral Science Foundation(No.2020M671900)the National Leading Youth Talent Support Program of China.
文摘Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.
基金supported by Natural Science Foundation Project of Gansu Provincial Science and Technology Department(No.1506RJZA084)Gansu Provincial Education Department Scientific Research Fund Grant Project(No.1204-13).
文摘To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.
文摘为了研究地面车辆与无人机在巡检过程中的最佳任务分配策略及路径规划问题,提出一种两阶段混合式启发算法——改进自适应大邻域搜索(improved adaptive large neighborhood search,IALNS)算法。第一阶段根据待巡检节点的不同需求等级及距离等因素,利用聚类算法对目标节点进行划分;第二阶段采用一种混合式启发算法解决路线调度问题,增加6种新的局部优化算子,引入节点重分配策略,经过迭代得到成本最小的车辆与无人机协同混合路线。对所提算法解和其他算法解进行测试和比较分析,试验数据表明,IALNS算法在解决车辆与无人机协同巡检问题时具有显著优势。
