WIA-PA(Wireless Networks for Industrial Automation-Process Automation)是我国自主制定的工业无线传感器网络标准,确定性调度技术是其中一项关键技术.但目前已有的确定性调度算法主要集中在通用传感器网络或Wireless HART,ISA100.11...WIA-PA(Wireless Networks for Industrial Automation-Process Automation)是我国自主制定的工业无线传感器网络标准,确定性调度技术是其中一项关键技术.但目前已有的确定性调度算法主要集中在通用传感器网络或Wireless HART,ISA100.11a等遵循国外标准的工业无线传感器网络中,未能针对WIA-PA网络进行优化设计.鉴于此,本文提出了一种适用于WIA-PA网络的基于回溯法的最优确定性调度算法,能够获取调度解的最大成功率;并以此为基础,进一步提出了一种基于最小时间裕度优先的时分多址调度算法(Least Slack First on Time Division Multiple Access,LSF-TDMA).仿真实验结果表明,所提出的LSF-TDMA算法能够满足WIA-PA网络端到端数据传输的确定性需求,在调度解获取成功率接近于最优的同时,有效降低了算法复杂度.展开更多
One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term produ...One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.展开更多
文摘为了满足航空器经济性的制造需求,降低航空器内部的有效载荷,使用无线代替有线已经成为机载网络转型升级的重要方向,然而传统无线技术难以满足机载网络中时间敏感业务的实时性传输需求.因此,通过明确机载无线通信网络(airborne wireless communication network, AWCN)的应用特点,设计了AWCN结合机载骨干交换网络的混合拓扑架构;综合考虑了节点无冲突、信道无干扰、路径依赖与端到端时延需求,构建了时间触发的AWCN确定性调度应该满足的一阶逻辑形式;理论分析了不同信道数量下完成调度所需要的最少时隙数量与制约端到端时延的主要因素,并证明了稳态时数据流在网关处的信息年龄期望值;设计了基于整数规划的调度方法,并针对大规模网络中决策变量多、约束之间耦合性高而导致的求解效率低的缺陷,提出了一种增量式求解策略.最后,通过实验验证了确定性调度模型与理论分析的有效性,并讨论了不同调度影响因子对数据流总时延与调度规模的影响.
文摘WIA-PA(Wireless Networks for Industrial Automation-Process Automation)是我国自主制定的工业无线传感器网络标准,确定性调度技术是其中一项关键技术.但目前已有的确定性调度算法主要集中在通用传感器网络或Wireless HART,ISA100.11a等遵循国外标准的工业无线传感器网络中,未能针对WIA-PA网络进行优化设计.鉴于此,本文提出了一种适用于WIA-PA网络的基于回溯法的最优确定性调度算法,能够获取调度解的最大成功率;并以此为基础,进一步提出了一种基于最小时间裕度优先的时分多址调度算法(Least Slack First on Time Division Multiple Access,LSF-TDMA).仿真实验结果表明,所提出的LSF-TDMA算法能够满足WIA-PA网络端到端数据传输的确定性需求,在调度解获取成功率接近于最优的同时,有效降低了算法复杂度.
文摘One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.
