Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in thr...Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in throughput are very limited.In order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots.From the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.展开更多
Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencie...Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencies in ABC regarding its local search ability and global search efficiency. Aiming at these deficiencies,an ABC variant named hybrid ABC(HABC) algorithm is proposed.Firstly, the variable neighborhood search factor is added to the solution search equation, which can enhance the local search ability and increase the population diversity. Secondly, inspired by the neuroscience investigation of real honeybees, the memory mechanism is put forward, which assumes the artificial bees can remember their past successful experiences and further guide the subsequent foraging behavior. The proposed memory mechanism is used to improve the global search efficiency. Finally, the results of comparison on a set of ten benchmark functions demonstrate the superiority of HABC.展开更多
A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. The proposed hybrid neighborhood is not only efficient in local search, but also can help overcome entrapments while sea...A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. The proposed hybrid neighborhood is not only efficient in local search, but also can help overcome entrapments while search procedure get trapped at local optima and carry the search to areas of the feasible set with better prospect. New strategies used for breaking out of entrapments are presented and they are helpful for the procedure to improve local optima. A performance comparison of the proposed method with some best-performing algorithms on all 10-job, 10-machine benchmark problems and the other two problems generated by Fisher and Thompson (ie., FT6 and FT20)is made. The experiment results show the better optimal performance of the proposed algorithm.展开更多
Floorplanning is a prominent area in the Very Large-Scale Integrated (VLSI) circuit design automation, because it influences the performance, size, yield and reliability of the VLSI chips. It is the process of estimat...Floorplanning is a prominent area in the Very Large-Scale Integrated (VLSI) circuit design automation, because it influences the performance, size, yield and reliability of the VLSI chips. It is the process of estimating the positions and shapes of the modules. A high packing density, small feature size and high clock frequency make the Integrated Circuit (IC) to dissipate large amount of heat. So, in this paper, a methodology is presented to distribute the temperature of the module on the layout while simultaneously optimizing the total area and wirelength by using a hybrid Particle Swarm Optimization-Harmony Search (HPSOHS) algorithm. This hybrid algorithm employs diversification technique (PSO) to obtain global optima and intensification strategy (HS) to achieve the best solution at the local level and Modified Corner List algorithm (MCL) for floorplan representation. A thermal modelling tool called hotspot tool is integrated with the proposed algorithm to obtain the temperature at the block level. The proposed algorithm is illustrated using Microelectronics Centre of North Carolina (MCNC) benchmark circuits. The results obtained are compared with the solutions derived from other stochastic algorithms and the proposed algorithm provides better solution.展开更多
This paper presents a new hybrid approach that combines Modified Priority List (MPL) with Charged System Search (CSS), termed MPL-CSS, to solve one of the most crucial power system’s operational optimization problems...This paper presents a new hybrid approach that combines Modified Priority List (MPL) with Charged System Search (CSS), termed MPL-CSS, to solve one of the most crucial power system’s operational optimization problems, known as unit commitment (UC) scheduling. The UC scheduling problem is a mixed-integer nonlinear problem, highly-dimensional and extremely constrained. Existing meta-heuristic UC solution methods have the problems of stopping at a local optimum and slow convergence when applied to large-scale, heavily-constrained UC applications. In the first step of the proposed method, initial hourly optimum solutions of UC are obtained by Modified Priority List (MPL);however, the obtained UC solution may still be possible to be further improved. Therefore, in the second step, the CSS is utilized to achieve higher quality solutions. The UC is formulated as mixed integer linear programming to ensure the tractability of the results. The proposed method is successfully applied to a popular test system up to 100 units generators for both 24-hr and 168-hr system. Computational results show that both solution cost and execution time are superior to those of published methods.展开更多
随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含...随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含交直流系统的基于可扩展标记语言的通用信息模型(common information model/extensible markup language,CIM/XML)数据到潮流计算输入数据的转换。首先,该文从设备间开关拓扑的角度,进行深度优先算法(depth first search,DFS)搜索和设备拓扑拼接,实现开关/节点模型到母线/支路模型的转换;其次,在筛选出活拓扑岛、剔除不带电设备后,着重分析了CIM/XML中换流器建模对交直流节点选取的影响,进而提出了直流节点选取规则和具备普适性的直流数据生成策略。最后,以某地调度500kV及以上交直流网络导出的CIM/XML数据为算例,潮流计算结果与数据采集与监视控制系统(supervisory control and data acquisition,SCADA)量测数据比对验证所提策略的有效性。展开更多
为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预...为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预测方法。该方法利用CEEMDAN处理涌水量数据,构建麻雀搜索算法(SSA)优化的长短期记忆网络(LSTM)和自回归移动平均模型(ARIMA)并行级联而成的混合时间序列模型对工作面涌水量进行预测。研究结果表明:该模型预测结果与真实数据相差更小,平均绝对误差为6.36 m 3/h,均方根误差为10.6 m 3/h,模型拟合系数为0.95,更适用于工作面涌水量预测。研究结果可为矿井工作面涌水量预测及防控提供参考。展开更多
基金Supported by the National Natural Science Foundation of China(No.61401407)
文摘Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in throughput are very limited.In order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots.From the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.
基金supported by the National Natural Science Foundation of China(7177121671701209)
文摘Artificial bee colony(ABC) is one of the most popular swarm intelligence optimization algorithms which have been widely used in numerical optimization and engineering applications. However, there are still deficiencies in ABC regarding its local search ability and global search efficiency. Aiming at these deficiencies,an ABC variant named hybrid ABC(HABC) algorithm is proposed.Firstly, the variable neighborhood search factor is added to the solution search equation, which can enhance the local search ability and increase the population diversity. Secondly, inspired by the neuroscience investigation of real honeybees, the memory mechanism is put forward, which assumes the artificial bees can remember their past successful experiences and further guide the subsequent foraging behavior. The proposed memory mechanism is used to improve the global search efficiency. Finally, the results of comparison on a set of ten benchmark functions demonstrate the superiority of HABC.
基金TheNationalGrandFundamentalResearch973ProgramofChina (No .G19980 30 6 0 0 )
文摘A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. The proposed hybrid neighborhood is not only efficient in local search, but also can help overcome entrapments while search procedure get trapped at local optima and carry the search to areas of the feasible set with better prospect. New strategies used for breaking out of entrapments are presented and they are helpful for the procedure to improve local optima. A performance comparison of the proposed method with some best-performing algorithms on all 10-job, 10-machine benchmark problems and the other two problems generated by Fisher and Thompson (ie., FT6 and FT20)is made. The experiment results show the better optimal performance of the proposed algorithm.
文摘Floorplanning is a prominent area in the Very Large-Scale Integrated (VLSI) circuit design automation, because it influences the performance, size, yield and reliability of the VLSI chips. It is the process of estimating the positions and shapes of the modules. A high packing density, small feature size and high clock frequency make the Integrated Circuit (IC) to dissipate large amount of heat. So, in this paper, a methodology is presented to distribute the temperature of the module on the layout while simultaneously optimizing the total area and wirelength by using a hybrid Particle Swarm Optimization-Harmony Search (HPSOHS) algorithm. This hybrid algorithm employs diversification technique (PSO) to obtain global optima and intensification strategy (HS) to achieve the best solution at the local level and Modified Corner List algorithm (MCL) for floorplan representation. A thermal modelling tool called hotspot tool is integrated with the proposed algorithm to obtain the temperature at the block level. The proposed algorithm is illustrated using Microelectronics Centre of North Carolina (MCNC) benchmark circuits. The results obtained are compared with the solutions derived from other stochastic algorithms and the proposed algorithm provides better solution.
文摘This paper presents a new hybrid approach that combines Modified Priority List (MPL) with Charged System Search (CSS), termed MPL-CSS, to solve one of the most crucial power system’s operational optimization problems, known as unit commitment (UC) scheduling. The UC scheduling problem is a mixed-integer nonlinear problem, highly-dimensional and extremely constrained. Existing meta-heuristic UC solution methods have the problems of stopping at a local optimum and slow convergence when applied to large-scale, heavily-constrained UC applications. In the first step of the proposed method, initial hourly optimum solutions of UC are obtained by Modified Priority List (MPL);however, the obtained UC solution may still be possible to be further improved. Therefore, in the second step, the CSS is utilized to achieve higher quality solutions. The UC is formulated as mixed integer linear programming to ensure the tractability of the results. The proposed method is successfully applied to a popular test system up to 100 units generators for both 24-hr and 168-hr system. Computational results show that both solution cost and execution time are superior to those of published methods.
文摘随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含交直流系统的基于可扩展标记语言的通用信息模型(common information model/extensible markup language,CIM/XML)数据到潮流计算输入数据的转换。首先,该文从设备间开关拓扑的角度,进行深度优先算法(depth first search,DFS)搜索和设备拓扑拼接,实现开关/节点模型到母线/支路模型的转换;其次,在筛选出活拓扑岛、剔除不带电设备后,着重分析了CIM/XML中换流器建模对交直流节点选取的影响,进而提出了直流节点选取规则和具备普适性的直流数据生成策略。最后,以某地调度500kV及以上交直流网络导出的CIM/XML数据为算例,潮流计算结果与数据采集与监视控制系统(supervisory control and data acquisition,SCADA)量测数据比对验证所提策略的有效性。
文摘为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预测方法。该方法利用CEEMDAN处理涌水量数据,构建麻雀搜索算法(SSA)优化的长短期记忆网络(LSTM)和自回归移动平均模型(ARIMA)并行级联而成的混合时间序列模型对工作面涌水量进行预测。研究结果表明:该模型预测结果与真实数据相差更小,平均绝对误差为6.36 m 3/h,均方根误差为10.6 m 3/h,模型拟合系数为0.95,更适用于工作面涌水量预测。研究结果可为矿井工作面涌水量预测及防控提供参考。
