A precedence order is defined based on the release dates of jobs＇ direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel schedulin...A precedence order is defined based on the release dates of jobs＇ direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P｜pj = 1, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement.展开更多
A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered ...A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.展开更多
针对堆优化算法(HBO)在解决复杂问题时存在搜索能力不足和搜索效率低等缺陷,提出一种差分扰动的HBO--DDHBO。首先,提出一种随机差分扰动策略更新最优个体的位置,以解决HBO没有对其更新从而导致的搜索效率低的问题;其次,使用一种最优最...针对堆优化算法(HBO)在解决复杂问题时存在搜索能力不足和搜索效率低等缺陷,提出一种差分扰动的HBO--DDHBO。首先,提出一种随机差分扰动策略更新最优个体的位置,以解决HBO没有对其更新从而导致的搜索效率低的问题;其次,使用一种最优最差差分扰动策略更新最差个体的位置,以强化其搜索能力;然后,采用一种多层差分扰动策略更新一般个体的位置,以强化多层个体之间的信息交流,并提高搜索能力;最后,针对原更新模型在搜索初期获得有效解概率低的问题,提出一种基于维的差分扰动策略更新其他个体的位置。在大量CEC2017复杂函数上的实验结果表明,与HBO相比,DDHBO在96.67%的函数上具有更好的优化性能,更少的平均运行时间(3.4450s);与WRBBO(Worst opposition learning and Random-scaled differential mutation Biogeography-Based Optimization)、DEBBO(Differential Evolution and Biogeography-Based Optimization)和HGWOP(Hybrid PSO and Grey Wolf Optimizer)等先进算法相比,DDHBO也具有显著的优势。展开更多
基金This work was supported by the National Natural Science Foundation of China(No.60474023)Science and Technology Key Project Fund of theMinistry of Education(No.03184)the Major State Basic Research Development Program of China(No.2002CB312200).
文摘A precedence order is defined based on the release dates of jobs＇ direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P｜pj = 1, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement.
文摘A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.
文摘针对堆优化算法(HBO)在解决复杂问题时存在搜索能力不足和搜索效率低等缺陷,提出一种差分扰动的HBO--DDHBO。首先,提出一种随机差分扰动策略更新最优个体的位置,以解决HBO没有对其更新从而导致的搜索效率低的问题;其次,使用一种最优最差差分扰动策略更新最差个体的位置,以强化其搜索能力;然后,采用一种多层差分扰动策略更新一般个体的位置,以强化多层个体之间的信息交流,并提高搜索能力;最后,针对原更新模型在搜索初期获得有效解概率低的问题,提出一种基于维的差分扰动策略更新其他个体的位置。在大量CEC2017复杂函数上的实验结果表明,与HBO相比,DDHBO在96.67%的函数上具有更好的优化性能,更少的平均运行时间(3.4450s);与WRBBO(Worst opposition learning and Random-scaled differential mutation Biogeography-Based Optimization)、DEBBO(Differential Evolution and Biogeography-Based Optimization)和HGWOP(Hybrid PSO and Grey Wolf Optimizer)等先进算法相比,DDHBO也具有显著的优势。
