Abstract Satellite range scheduling with the priority constraint is one of the most important prob lems in the field of satellite operation. This paper proposes a station coding based genetic algorithm to solve this p...Abstract Satellite range scheduling with the priority constraint is one of the most important prob lems in the field of satellite operation. This paper proposes a station coding based genetic algorithm to solve this problem, which adopts a new chromosome encoding method that arranges tasks according to the ground station ID. The new encoding method contributes to reducing the complex ity in conflict checking and resolving, and helps to improve the ability to find optimal resolutions. Three different selection operators are designed to match the new encoding strategy, namely ran dom selection, greedy selection, and roulette selection. To demonstrate the benefits of the improved genetic algorithm, a basic genetic algorithm is designed in which two cross operators are presented, a singlepoint crossover and a multipoint crossover. For the purpose of algorithm test and analysis, a problemgenerating program is designed, which can simulate problems by modeling features encountered in realworld problems. Based on the problem generator, computational results and analysis are made and illustrated for the scheduling of multiple ground stations.展开更多
To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport req...To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.展开更多
An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the obj...An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.展开更多
In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic...In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.展开更多
针对智慧医疗场景中高密度无线体域网(wireless body area network,WBAN)多优先级数据传输与计算资源受限的挑战,研究提出一种融合动态优先级评估与量子优化的任务卸载策略。首先通过构建医疗物联网(healthcare Internet of Things,H-I...针对智慧医疗场景中高密度无线体域网(wireless body area network,WBAN)多优先级数据传输与计算资源受限的挑战,研究提出一种融合动态优先级评估与量子优化的任务卸载策略。首先通过构建医疗物联网(healthcare Internet of Things,H-IoT)高密度WBAN网络模型,集成任务优先级分层机制与动态信道状态感知模块,建立基于生理数据特征的通信质量评估体系。其次设计多维动态调度框架,利用生理参数偏离度、数据滞留时间及抢占事件等指标实时调整任务优先级权重,结合抢占式调度策略保障急诊数据的低时延传输。再进一步改进量子遗传算法(improved quantum genetic algorithm,IQGA),采用动态量子旋转门角度调整机制优化局部搜索性能,并引入灾变修正函数提升全局收敛效率。仿真实验表明,该策略在任务平均处理时间、系统能耗、高优先级任务时延及收敛速度方面分别实现71.51%、88.21%、89.63%和78.74%的性能优化,系统综合收益提升达114.43%。研究成果为高密度医疗物联网场景下的实时任务调度与资源分配提供了理论支撑与技术路径。展开更多
针对海上船舶受损需要外界进行抢修支援问题,提出了海上船舶抢修优化调度模型并利用改进的多维动态列表规划算法(Multidimensional Dynamic List Planning Algorithm,MPLDS)进行求解。确立了船舶海上装备抢修基本流程,建立任务-资源的...针对海上船舶受损需要外界进行抢修支援问题,提出了海上船舶抢修优化调度模型并利用改进的多维动态列表规划算法(Multidimensional Dynamic List Planning Algorithm,MPLDS)进行求解。确立了船舶海上装备抢修基本流程,建立任务-资源的优化调度约束模型,模型分为基于效果的行动优化方法与优化调度的约束模型2部分,运用改进的MPLDS对约束模型求解,充分考虑优化调度过程中时间、成本以及任务与支援平台间的重要性,并进行算例分析验证准确性。改进的MPLDS算法充分利用优先权调解方法对优化调度约束模型求解,能够满足制定支援方案者对各方面考虑的基本诉求,实现海上受损船舶的高效抢修支援。展开更多
针对星载路由设备的发展趋势,即交互速率提升、带宽增加以及设计轻量化,本文提出了一种基于改进轮询的星载高速交换算法的设计方案。该方案采用基于改进RR(Round Robin,轮询)调度算法和PBPW(Priority-based Bandwidth Privilege with We...针对星载路由设备的发展趋势,即交互速率提升、带宽增加以及设计轻量化,本文提出了一种基于改进轮询的星载高速交换算法的设计方案。该方案采用基于改进RR(Round Robin,轮询)调度算法和PBPW(Priority-based Bandwidth Privilege with Weighting,基于优先级并带权重的带宽特权)算法相结合的二级队列调度算法。在第一级调度中,引入优先级轮询调度,确保高优先级的数据帧能够优先转发,同时开放了缓存共享机制,一定程度上避免了拥塞和资源的浪费;在第二级调度中,为每条链路分配了阈值,从而避免了某些链路因“饥饿”而无法得到服务,同时防止了其他链路的拥塞问题。与传统的基于FIFO(First In First Out,先进先出)的简单队列调度算法相比,这种改进的轮询调度机制显著提高了星载路由器的转发速率,并降低了转发时延。此外,通过轮询方式实现了对高优先级数据帧的优先转发,进一步优化了路由器的性能。展开更多
For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the com...For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling （IPPS） problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS （MOIPPS） problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatch- ing rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.展开更多
文摘Abstract Satellite range scheduling with the priority constraint is one of the most important prob lems in the field of satellite operation. This paper proposes a station coding based genetic algorithm to solve this problem, which adopts a new chromosome encoding method that arranges tasks according to the ground station ID. The new encoding method contributes to reducing the complex ity in conflict checking and resolving, and helps to improve the ability to find optimal resolutions. Three different selection operators are designed to match the new encoding strategy, namely ran dom selection, greedy selection, and roulette selection. To demonstrate the benefits of the improved genetic algorithm, a basic genetic algorithm is designed in which two cross operators are presented, a singlepoint crossover and a multipoint crossover. For the purpose of algorithm test and analysis, a problemgenerating program is designed, which can simulate problems by modeling features encountered in realworld problems. Based on the problem generator, computational results and analysis are made and illustrated for the scheduling of multiple ground stations.
基金Supported by the National Natural Science Foundation of China(No.51765043)
文摘To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.
基金supported by the National Natural Science Foundation of China(6083500460775047+4 种基金60974048)the National High Technology Research and Development Program of China(863 Program)(2007AA0422442008AA04Z214)the Natural Science Foundation of Hunan Province(09JJ9012)Scientific Research Fund of Hunan Provincial Education Department(08C337)
文摘An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.
基金supported by the National Natural Science Foundation of China(61773120,61473301,71501180,71501179,61603400)。
文摘In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.
文摘针对智慧医疗场景中高密度无线体域网(wireless body area network,WBAN)多优先级数据传输与计算资源受限的挑战,研究提出一种融合动态优先级评估与量子优化的任务卸载策略。首先通过构建医疗物联网(healthcare Internet of Things,H-IoT)高密度WBAN网络模型,集成任务优先级分层机制与动态信道状态感知模块,建立基于生理数据特征的通信质量评估体系。其次设计多维动态调度框架,利用生理参数偏离度、数据滞留时间及抢占事件等指标实时调整任务优先级权重,结合抢占式调度策略保障急诊数据的低时延传输。再进一步改进量子遗传算法(improved quantum genetic algorithm,IQGA),采用动态量子旋转门角度调整机制优化局部搜索性能,并引入灾变修正函数提升全局收敛效率。仿真实验表明,该策略在任务平均处理时间、系统能耗、高优先级任务时延及收敛速度方面分别实现71.51%、88.21%、89.63%和78.74%的性能优化,系统综合收益提升达114.43%。研究成果为高密度医疗物联网场景下的实时任务调度与资源分配提供了理论支撑与技术路径。
文摘针对海上船舶受损需要外界进行抢修支援问题,提出了海上船舶抢修优化调度模型并利用改进的多维动态列表规划算法(Multidimensional Dynamic List Planning Algorithm,MPLDS)进行求解。确立了船舶海上装备抢修基本流程,建立任务-资源的优化调度约束模型,模型分为基于效果的行动优化方法与优化调度的约束模型2部分,运用改进的MPLDS对约束模型求解,充分考虑优化调度过程中时间、成本以及任务与支援平台间的重要性,并进行算例分析验证准确性。改进的MPLDS算法充分利用优先权调解方法对优化调度约束模型求解,能够满足制定支援方案者对各方面考虑的基本诉求,实现海上受损船舶的高效抢修支援。
文摘针对星载路由设备的发展趋势,即交互速率提升、带宽增加以及设计轻量化,本文提出了一种基于改进轮询的星载高速交换算法的设计方案。该方案采用基于改进RR(Round Robin,轮询)调度算法和PBPW(Priority-based Bandwidth Privilege with Weighting,基于优先级并带权重的带宽特权)算法相结合的二级队列调度算法。在第一级调度中,引入优先级轮询调度,确保高优先级的数据帧能够优先转发,同时开放了缓存共享机制,一定程度上避免了拥塞和资源的浪费;在第二级调度中,为每条链路分配了阈值,从而避免了某些链路因“饥饿”而无法得到服务,同时防止了其他链路的拥塞问题。与传统的基于FIFO(First In First Out,先进先出)的简单队列调度算法相比,这种改进的轮询调度机制显著提高了星载路由器的转发速率,并降低了转发时延。此外,通过轮询方式实现了对高优先级数据帧的优先转发,进一步优化了路由器的性能。
文摘For increasing the overall performance of modem manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling （IPPS） problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS （MOIPPS） problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatch- ing rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.
