A spatial orthogonal allocation and heterogeneous cultural hybrid algorithm for multirobot exploration mission planning

A spatial orthogonal allocation method is devised for multirobot tasks allocation.A 3D space model is adopted to describe exploration mission;meanwhile spatial orthogonal tentative technology is utilized to update the attractor position for load balance.Heterogeneous interactive cultural hybrid architecture is proposed to solve a robot route planning problem;it utilizes good-point-set to initialize population spaces,redefine novel evolution model and particle evolution ability,and introduce near-neighbor lo...     

货架分配问题的一个有效混合遗传算法

针对货架分配问题提出了一个遗传算法与模拟退火算法及一个局部搜索算法混合的算法。首先,设计了一种比较直观的编码方法,用一个矩阵作为一种货架分配方案。第二,设计了与编码相应的杂交和变异算子,并且杂交、变异都能生成可行解,不需要对解进行修正。第三,为了能够生成好的初始种群,定义了一个阀值,这个阀值不仅反映了解的适应值的信息,而且还反映解的结构的信息。第四,为了增加算法的局部搜索能力,同时又尽量不增加计算的复杂度,让模拟退火算法和一种局部搜索算法并行作用于相应的子群。通过大量的数据模拟实验及与其他的几种算法模拟结果进行比较,实验显示,该算法不论是计算结果还是算法的稳定性都优于其他算法。     

Scheduling algorithm for real-time tasks using multiobjective hybrid genetic algorithm in heterogeneous multiprocessors system

The scheduling problem for real-time tasks on multiprocessor is one of the NP-hard problems. This paper proposes a new scheduling algorithm for real-time tasks using multiobjective hybrid genetic algorithm (mohGA) on heterogeneous multiprocessor environment. In solution algorithms, the genetic algorithm (GA) and the simulated annealing (SA) are cooperatively used. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution.     

基于混合蚁群算法的MAS任务分配*

在MAS（多agent系统）中,由于任务的复杂性和agent求解问题能力的不同,任务和agent不再是传统的一对一的关系。为解决MAS的任务分配问题,提出了任务与agent之间多对多的任务分配模式。首先建立了任务分配的数学模型,并导出分配优化的目标函数;其次利用混合蚁群算法快速收敛和分布式求解的特点实现任务分配的组合优化。对实验仿真的结果分析表明,多对多的任务分配模式能够明显提升多agent系统的性能。     

IEEE 802.11n系统中自适应混合优化功率分配算法*

为解决IEEE 802.11n系统中的功率浪费现象,提出了一种先注水后调和平均值（first-water filling-last-harmonic, FWLH）的自适应混合优化功率分配算法。首先利用注水算法（water-filling algorithm）计算判别信道质量的阈值,对阈值以下的信道关闭不分配功率,对阈值以上的信道采用调和平均值算法(harmonic algorithm, HARM)进行功率分配。仿真表明,在误码率方面,FWLH算法比注水算法和HARM算法分别降低了大约100倍和20倍,使     

基于NOMA异构云无线接入网的联合子信道和功率分配算法

针对基于NOMA异构云无线接入网中增加网络效用需要以更高的能源消耗为代价,从而导致能源效率低的问题,提出了一种联合子信道和功率分配方案。首先,该方案定义网络效用和电网能源成本之间的差值为系统收益,考虑了最大传输功率、能量收集（energy harvesting,EH）电池容量、用户最小数据速率需求和跨层干扰阈值等约束,以最大化系统收益为目标建立优化问题;然后,采用贪心算法给用户配对并分配子信道,实现低复杂度次优解;最后,利用基于交替方向乘子法的拉格朗日最大化方法优化了功率分配。仿真结果表明,与NOMA系统中未配备EH单元的方案相比,系统收益提高了约18.8%;与OFDMA系统中配备EH单元的方案相比,系统收益提高了约11.8%。     

MOHHA求解不可靠生产线多目标缓冲区分配问题

研究含有可失效机器的不可靠串行生产线上缓冲区容量分配问题,以最大化生产线生产率和最小化生产线缓冲区总量为多目标,提出一种多目标混合启发式算法（MOHHA）。采用了离散事件仿真方法,建立生产率与缓冲区容量分配的仿真模型作为算法的评价工具。算法第一步求得生产线最大生产率,并作为目标生产率进一步求解最小化缓冲区总量。通过三组测试算例,与以往研究结果作对比验证了算法的有效性和优越性。     

基于文化算法的混合聚类方法

文化算法是一种新的进化计算方法,文化进化过程除了具有传统的进化计算模型的群体空间外,还增加了一个知识空间和支持这两个空间通信的机制。以文化算法为框架,采用K-均值模型为聚类模型,针对聚类问题设计适用于该问题的知识空间、群体空间、接受函数和影响函数,提出一种混合聚类算法KCAGA。实验证明,该算法对解决聚类问题初始化敏感以及容易陷入局部优化取得很好的效果,适用于聚类问题的解决。     

A fast two-stage hybrid meta-heuristic algorithm for robust corridor allocation problem

The optimisation of the corridor allocation problem (CAP) belongs to the optimisation of the efficiency of the automated production line. The goal is to reduce the material handling cost (MHC) in the production process through a reasonable layout of the facilities, so as to save expenses for the enterprise. In recent years, with the acceleration of market changes, product design and production process adjustments have become more frequent, and more attention has been paid to the research on the layout of facilities under the condition of changes in the flow of materials between production facilities over time. On the basis of the CAP model, this paper considers the optimisation problem of row layout when the flow of materials between facilities fluctuates in a certain range. The new model can be utilised to obtain the overall optimisation solution under the condition of the floating material flow matrix, so as to achieve the goal of optimising the total MHC in the entire production process. As the new model introduces more variables and intermediate parameters, a two-stage solution method is previously required, which greatly increases the time to solve the problem. This paper proposes a targeted meta-heuristic algorithm optimisation method combining the advantages of tabu search algorithm and harmony search algorithm, which simplifies the solution phase of calling the precise solver in the two-stage algorithm of row facility layout problem, improves the problem solving efficiency, and makes the solution of large-scale problems become possible. The proposed model is verified through Lingo software, and then the model and the hybrid algorithm in the MATLAB environment are verified with each other. Finally, the proposed simplified algorithm is utilised to solve the large-scale problems that could not be solved by the two-stage algorithm before.     

A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system

Effective task scheduling, which is essential for achieving high performance in a heterogeneous multiprocessor system, remains a challenging problem despite extensive studies. In this article, a heuristic-based hybrid genetic-variable neighborhood search algorithm is proposed for the minimization of makespan in the heterogeneous multiprocessor scheduling problem. The proposed algorithm distinguishes itself from many existing genetic algorithm (GA) approaches in three aspects. First, it incorporates GA with the variable neighborhood search (VNS) algorithm, a local search metaheuristic, to exploit the intrinsic structure of the solutions for guiding the exploration process of GA. Second, two novel neighborhood structures are proposed, in which problem-specific knowledge concerned with load balancing and communication reduction is utilized respectively, to improve both the search quality and efficiency of VNS. Third, the proposed algorithm restricts the use of GA to evolve the task-processor mapping solutions, while taking advantage of an upward-ranking heuristic mostly used by traditional list scheduling approaches to determine the task sequence assignment in each processor. Empirical results on benchmark task graphs of several well-known parallel applications, which have been validated by the use of non-parametric statistical tests, show that the proposed algorithm significantly outperforms several related algorithms in terms of the schedule quality. Further experiments are carried out to reveal that the proposed algorithm is able to maintain high performance within a wide range of parameter settings.     

A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows

This paper presents a hybrid evolutionary algorithm (HEA) to solve heterogeneous fleet vehicle routing problems with time windows. There are two main types of such problems, namely the fleet size and mix vehicle routing problem with time windows (F) and the heterogeneous fixed fleet vehicle routing problem with time windows (H), where the latter, in contrast to the former, assumes a limited availability of vehicles. The main objective is to minimize the fixed vehicle cost and the distribution cost, where the latter can be defined with respect to en-route time (T) or distance (D). The proposed unified algorithm is able to solve the four variants of heterogeneous fleet routing problem, called FT, FD, HT and HD, where the last variant is new. The HEA successfully combines several metaheuristics and offers a number of new advanced efficient procedures tailored to handle the heterogeneous fleet dimension. Extensive computational experiments on benchmark instances have shown that the HEA is highly effective on FT, FD and HT. In particular, out of the 360 instances we obtained 75 new best solutions and matched 102 within reasonable computational times. New benchmark results on HD are also presented.     

正交文化算法及其在布局优化问题中的应用

布局优化问题是工程应用中普遍存在的一种组合优化问题,属于NP完备问题。针对布局优化问题,将差异演化算法和郭涛算法融入文化算法的框架,利用正交设计方法初始化种群,提出了一种正交文化算法。通过对一个带约束的和一个较大规模的不带约束的布局优化问题进行性能比较,验证了该算法的可行性和有效性。     

Dynamic core allocation for energy efficient video decoding in homogeneous and heterogeneous multicore architectures

This paper describes two dynamic core allocation techniques for video decoding on homogeneous and heterogeneous embedded multicore platforms with the objective of reducing energy consumption while guaranteeing performance. While decoding a frame, the scheme measures “slack” and “overshoot” over the budgeted decode time and amortizes across the neighboring frames to achieve overall performance, compensating for the overshoot with the slack time. It allocates, on a per-frame basis, an appropriate number and types of cores for decoding to guarantee performance, while saving energy by using clock gating to switch off unused cores. Using the Sniper simulator to evaluate the implementation of the scheme on a modern embedded processor, we get an energy saving of 6%–61% while strictly adhering to the required performance of 75 fps on homogeneous multicore architectures. We receive an energy saving of 2%–46% while meeting the performance of 25 fps on heterogeneous multicore architectures. Thus, we show that substantial energy savings can be achieved in video decoding by employing dynamic core allocation, compared with the default strategy of allocating as many cores as available.     

A cascade evolutionary algorithm for the bodyguard allocation problem

The bodyguard allocation problem (BAP) is an optimization problem that illustrates the behavior of processes with contradictory individual goals in some distributed systems. The objective function of this problem is the maximization of a parameter called the social welfare. Although the main method proposed to solve this problem, known as CBAP, is simple and time efficient, it lacks the ability to generate a diverse set of solutions, which is one of the most important feature to improve the chances to reach the global optimum. To overcome this drawback, we address the BAP with an evolutionary algorithm, the EBAP. Later, we take advantage of the best properties of both algorithms, EBAP and CBAP, to generate a two-stage cascade evolutionary algorithm called FFC-BAP. Extensive experimental results show that the algorithm FFC-BAP outperforms both the EBAP and the CBAP, in terms of quality of solutions.     

一种基于人工鱼群和文化算法的新型混合全局优化算法*

提出一种基于人工鱼群和文化算法的新型混合全局优化算法,该混合算法的思想是将人工鱼群嵌入文化算法框架中,作为种群空间的一个进化过程;通过从进化种群中获得的知识组成知识空间,两空间具有各自群体并独立并行演化,从而实现增加人工鱼群的群体多样性。最后通过数值实例仿真结果表明,本算法具有较高的计算精度和收敛速度。     

HBBA: hybrid algorithm for buffer allocation in tandem production lines

In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion depends on the average steady-state production rate of the line and the buffer equipment acquisition cost. We evaluate black-box complexity of this problem and propose a hybrid optimization algorithm (HBBA), combining the genetic and branch-and-bound approaches. HBBA is excellent in computational time. HBBA uses a Markov model aggregation technique for goal function evaluation. Nevertheless, HBBA is more general and can be used with other production rate evaluation techniques.     

Multi-criteria human resource allocation for solving multistage combinatorial optimization problems using multiobjective hybrid genetic algorithm

Multi-criteria human resource allocation involves deciding how to divide human resource of limited availability among multiple demands in a way that optimizes current objectives. In this paper, we focus on multi-criteria human resource allocation for solving multistage combinatorial optimization problem. Hence we tackle this problem via a multistage decision-making model. A multistage decision-making model is similar to a complex problem solving, in which a suitable sequence of decisions is to be found. The task can be interpreted as a series of interactions between a decision maker and an outside world, at each stage of which some decisions are available and their immediate effect can be easily computed. Eventually, goals would be reached due to the found of optimized variables. In order to obtain a set of Pareto solutions efficiently, we propose a multiobjective hybrid genetic algorithm (mohGA) approach based on the multistage decision-making model for solving combinatorial optimization problems. According to the proposed method, we apply the mohGA to seek feasible solutions for all stages. The effectiveness of the proposed algorithm was validated by its application to an illustrative example dealing with multiobjective resource allocation problem.     

面向混合异构架构的模型并行训练优化方法

随着混合异构平台的发展,出现了类型不一的加速设备,如何在混合异构平台中充分利用这些不同类型的设备,以及如何在多个计算设备之间部署深度学习模型,而且训练大型和复杂模型的重要性不断提高.数据并行(DP)是应用最广泛的并行化策略,但是如果数据并行训练中的设备数量不断增加,设备之间的通信开销就会成为瓶颈.此外,每个步骤因设备性...     

Power allocation for OFDM-based cognitive heterogeneous networks

In this paper,the capacity maximization and the spectrum utilization efficiency improvement are investigated for the Pico cells in broadband heterogeneous networks.In frequency-reuse model,the users attached to Macro base station are usually viewed as primary users,and those attached to Pico base station should be regarded as cognitive radio(CR) users.As both the primary users and the CR users communicate in parallel frequency bands,the performance of the system is limited by the mutual inter-carrier interference(ICI).In order to control ICI and maximize the achievable transmission rate of the CR users,an effective power allocation scheme is proposed to maximize the transmission rate of the CR users under a given interference threshold prescribed by the primary users.By transforming this suboptimal solution into an innovative matrix expression,the algorithm is easier to perform in practice.The simulation results demonstrate that the proposed algorithm provides a large performance gain in Pico cell capacity over the non-cooperative and equal power allocation schemes.     

基于文化算法的家庭服务机器人任务规划

通过对家庭服务机器人任务规划问题进行形式化描述,给出了问题的求解模型,提出了一种改进的文化算法,通过算法中信念空间和种群空间的相互联系和相互促进实现求解。算法采用独特的编码方式,其种群空间采用遗传算法作为进化手段,采用较为独特的信念提取方式构造算法的信念空间并促使其进化。将该算法用于家庭服务机器人大赛的仿真平台上,证明其有效性。