Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method...The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.展开更多
Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-com...Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-commerce increases tremendously,the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction.One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem(MVPPDP),where a selected set of pickup and delivery customers need to be served within certain allowed trip time.In this paper,we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure(GRASP)to construct an initial solution for the MVPPDP.Our approaches first cluster the search space in order to reduce its dimensionality,then use GRASP to build routes for each cluster.We compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this problem.Experimental results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.展开更多
针对电动调节阀控制系统在实际生产过程中存在的非线性、多扰动等问题,提出一种基于改进蚁群算法优化单神经元PID(proportional integral derivative)的控制方法并将其应用于阀门开度控制中。该方法利用单神经元网络的自学习和自适应能...针对电动调节阀控制系统在实际生产过程中存在的非线性、多扰动等问题,提出一种基于改进蚁群算法优化单神经元PID(proportional integral derivative)的控制方法并将其应用于阀门开度控制中。该方法利用单神经元网络的自学习和自适应能力,实现PID控制参数的在线整定,并采用改进的蚁群优化算法优化单神经元PID中的学习速率和神经元比例系数,有效克服了单神经元PID中的学习速率和神经元比例系数因经验设定而无法达到预期控制效果的不足。仿真对比结果显示,相比于传统PID、单神经元PID以及基于蚁群优化算法优化单神经元PID 3种控制方法,本文提出的控制方法超调量分别减少了10.2%、6.1%和1.8%,同时调节时间也相应缩短了0.22、0.07、0.03 s,并且表现出更强的自适应和抗干扰能力,能够使阀门开度控制更加稳定可靠。展开更多
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.
文摘The ant colony algorithm is a new class of population basic algorithm. The path planning is realized by the use of ant colony algorithm when the plane executes the low altitude penetration, which provides a new method for the path planning. In the paper the traditional ant colony algorithm is improved, and measures of keeping optimization, adaptively selecting and adaptively adjusting are applied, by which better path at higher convergence speed can be found. Finally the algorithm is implemented with computer simulation and preferable results are obtained.
基金Deanship of scientific research for funding and supporting this research through the initiative of DSR Graduate Students Research Support(GSR).
文摘Mobile commerce(m-commerce)contributes to increasing the popularity of electronic commerce(e-commerce),allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time.As demand for e-commerce increases tremendously,the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction.One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem(MVPPDP),where a selected set of pickup and delivery customers need to be served within certain allowed trip time.In this paper,we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure(GRASP)to construct an initial solution for the MVPPDP.Our approaches first cluster the search space in order to reduce its dimensionality,then use GRASP to build routes for each cluster.We compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this problem.Experimental results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.
文摘针对电动调节阀控制系统在实际生产过程中存在的非线性、多扰动等问题,提出一种基于改进蚁群算法优化单神经元PID(proportional integral derivative)的控制方法并将其应用于阀门开度控制中。该方法利用单神经元网络的自学习和自适应能力,实现PID控制参数的在线整定,并采用改进的蚁群优化算法优化单神经元PID中的学习速率和神经元比例系数,有效克服了单神经元PID中的学习速率和神经元比例系数因经验设定而无法达到预期控制效果的不足。仿真对比结果显示,相比于传统PID、单神经元PID以及基于蚁群优化算法优化单神经元PID 3种控制方法,本文提出的控制方法超调量分别减少了10.2%、6.1%和1.8%,同时调节时间也相应缩短了0.22、0.07、0.03 s,并且表现出更强的自适应和抗干扰能力,能够使阀门开度控制更加稳定可靠。
