共查询到20条相似文献，搜索用时 15 毫秒
1.
《Information processing & management》2022,59(5):103028
Assigning paper to suitable reviewers is of great significance to ensure the accuracy and fairness of peer review results. In the past three decades, many researchers have made a wealth of achievements on the reviewer assignment problem (RAP). In this survey, we provide a comprehensive review of the primary research achievements on reviewer assignment algorithm from 1992 to 2022. Specially, this survey first discusses the background and necessity of automatic reviewer assignment, and then systematically summarize the existing research work from three aspects, i.e., construction of candidate reviewer database, computation of matching degree between reviewers and papers, and reviewer assignment optimization algorithm, with objective comments on the advantages and disadvantages of the current algorithms. Afterwards, the evaluation metrics and datasets of reviewer assignment algorithm are summarized. To conclude, we prospect the potential research directions of RAP. Since there are few comprehensive survey papers on reviewer assignment algorithm in the past ten years, this survey can serve as a valuable reference for the related researchers and peer review organizers. 相似文献
2.
3.
4.
5.
介绍了一种求解复杂组合优化问题的新型的模拟进化算法——蚁群算法。阐述了该算法的基本原理、模型以及实现过程,并且介绍了蚁群算法在TSP问题、二次分配问题、车间作业调度问题、大规模集成电路综合布线以及车辆路径问题等组合优化问题中的应用思路。 相似文献
6.
针对正交频分多址无线蜂窝系统下行链路,提出一种基于用户速率调和均值公平的多小区干扰协调功率分配算法.为了优先减轻小区边缘用户的同频干扰,把多小区功率分配问题建模为一个以用户速率调和均值公平为目标的非凸优化问题,并提出一种迭代算法求其接近最优解.该算法需要相邻的基站通过交互干扰信息进行相互协作.仿真结果表明,该算法在保证小区中心用户有较高通信速率的同时,极大提升了小区边缘用户的通信速率. 相似文献
7.
Constrained control for stochastic linear systems is generally a difficult task due to the possible infeasibility of state constraints. In this paper, we focus on a finite control horizon and propose a design methodology where the constrained control problem is formulated as a chance-constrained optimization problem depending on some parameter. This parameter can be tuned so as to decide the appropriate trade-off between control cost minimization and state constraints satisfaction. An approximate solution is computed via a randomized algorithm. Precise guarantees about its feasibility for the original chance-constrained problem are provided. A numerical example shows the efficacy of the proposed methodology. 相似文献
8.
Tree-structured vector quantization (VQ) is a technique designed to represent a codebook that simplifies encoding as well as vector quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh and Gray proposed a tree-pruning heuristic in which a given initial tree is pruned backwards according to certain optimization criterion. We define the notion of an optimal pruned tree subject to a cost constraint and study the computational complexity of finding such an optimal tree for various cost functions. Under the assumption that all trees are equally probable, we show that, on the average, the number of pruned trees in a given tree is exponential in the number of leaves. Furthermore, we prove that finding an optimal pruned tree subject to constraints such as entropy or the expected-depth is NP-hard. However, we show that when the constraint is the number of leaves, the problem can be solved in polynomial time. We develop an algorithm to find the optimal pruned tree in O(nk) time, where n is the size of the initial tree and kis the constraint size. 相似文献
9.
Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. 相似文献
10.
成品油二次配送是成品油销售的重要环节,配送中心要实现最经济、最快速的多客户需求响应,就需要对路线、车辆、载重、时间窗等要素进行合理优化。文章针对成品油配送的特点,构造了具有载重、时间窗、访问机制等约束条件限制的调度优化模型,运用AK算法思想对传统C-W节约算法进行了改进,算例验证表明了改进算法的优越性。最后,对空车驰返问题进行了绕点折返优化,使模型得以更加完善。进一步的算例验证结果显示改进模型在成品油二次配送优化中效果极好。 相似文献
11.
高校教务管理工作中,课程安排是一项重要而又复杂的基本工作。排课问题是典型的多重约束和组合优化的问题,通过最优的排列组合合理分配教学资源。本文通过对排课问题基本要素及相互约束条件的分析,结合自身实践描述了课表的编排原则,同时对模拟退火算法、图论法、遗传算法、蚁群算法等主要排课算法的原理和特点进行了阐述。 相似文献
12.
基于动态神经网络专家系统的供应商信用等级分析 总被引：4，自引：0，他引：4
在供应链(SC)中,如何正确地选择敏捷的、有实力和相容的供应商合作伙伴,影响到整个SC的竞争力。而对供应商信用等级进行正确地评价又是实现优化选择供应商合作伙伴的关键,同时也对提升整个SC的竞争力有着极其重要的作用。本文提出了一个供应商信用等级分析指标体系,并通过人工智能神经网络进行评估。考虑到神经网络的收敛性,本文基于重置算法构建了动态神经网络专家系统。应用实例表明,该指标体系与专家系统有效地解决了对供应商信用等级进行分析评估的问题。 相似文献
13.
《Journal of The Franklin Institute》2022,359(18):11135-11154
A class of resource allocation problems with equality constraint are considered in this paper, such as economic dispatch problem in smart grid systems, which is essentially an optimization problem. Inspired by the Lagrange multiplier method, the resource allocation problem is transformed into a multi-agent consensus problem for large-scale networked distributed nodes. A consensus-based distributed fixed-time optimization algorithm is presented, where the information exchange network is depicted by a strongly connected and weight-balanced digraph. This type of communication network can ensure that the equality constraint always holds. Moreover, a new globally fixed-time stability theorem for nonlinear systems is first given in this paper. Based on this theorem and consensus theory, the optimal resource allocation scheme can be given in a fixed time. Finally, the application and comparison of the designed algorithm show that the algorithm can effectively solve the allocation problem of power resources such as economic dispatch. 相似文献
14.
基于多目标鱼群-蚁群算法的水资源优化配置 总被引：2，自引：2，他引：0
为了解决复杂的水资源优化配置问题和丰富智能优化方法在水资源优化配置中的应用,建立了以经济、社会、环境综合效益最大为目标的水资源优化配置模型和多目标鱼群-蚁群算法。经济效益以区域供水带来的直接经济效益最大为目标;社会效益以区域总缺水量最小为目标;生态环境效益以区域重要污染物排放量最小为目标;约束条件包括供水、需水、水环境和经济发展协调度等。多目标鱼群-蚁群算法融合了人工鱼群算法的快速跟踪变化和跳出局部极值优点以及蚁群算法的信息素正反馈优点,并将人工鱼群算法中的拥挤度概念引入到蚁群算法中,避免了蚁群算法初期可能早熟的问题。通过实验仿真,此算法具有较快的收敛速度和较高的寻优性能,能有效地找到优化解,从而为解决复杂的水资源优化配置问题提供了新的思路。 相似文献
15.
几何约束求解技术是基于约束满足的参数化设计方法中最核心的技术。几何约束求解技术的好坏、性能的优劣直接关系到一个基于约束的参数化设计系统是否优良。遗传量子算法是将量子计算和遗传算法相结合的算法,采用量子位染色体的表示形式。该算法具有量子计算的量子位和量子位的迭加特性,同时加入了量子交换算法,使得进化染色体更好的呈现多样特性。实验表明,将该算法应用于几何约束求解方程中,可以解决欠约束和过约束一致的问题。 相似文献
16.
In this paper, the state estimation problem for discrete-time networked systems with communication constraints and random packet dropouts is considered. The communication constraint is that, at each sampling instant, there is at most one of the various transmission nodes in the networked systems is allowed to access a shared communication channel, and then the received data are transmitted to a remote estimator to perform the estimation task. The channel accessing process of those transmission nodes is determined by a finite-state discrete-time Markov chain, and random packet dropouts in remote data transmission are modeled by a Bernoulli distributed white sequence. Using Bayes’ rule and some results developed in this study, two state estimation algorithms are proposed in the sense of minimum mean-square error. The first algorithm is optimal, which can exactly compute the minimum mean-square error estimate of system state. The second algorithm is a suboptimal algorithm obtained under a lot of Gaussian hypotheses. The proposed suboptimal algorithm is recursive and has time-independent complexity. Computer simulations are carried out to illustrate the performance of the proposed algorithms. 相似文献
17.
《Journal of The Franklin Institute》2022,359(15):7992-8013
In this paper, a compound control strategy is proposed to realize the trajectory tracking task of quadrotors under operating constraints and disturbances. Disturbances caused by model uncertainties, environmental noises, and measurement disturbances are divided into matched disturbances and unmatched ones, which are compensated and suppressed separately by using two control components. The integral sliding mode control component is designed to actively reject the matched disturbances, and the control system is then transformed into an equivalent control system subject to equivalent disturbances only related to the unmatched disturbances. The remaining equivalent disturbances are treated by a robust model predictive control component based on the idea of constraints tightening, which minimizes the tracking error in an optimization framework and takes both state and input constraints into account explicitly. The derived compound control strategy is based on these two control components. Conditions are provided to guarantee the robust constraint satisfaction, recursive feasibility and closed-loop stability of the tracking error system. An illustrative example on the quadrotors shows the efficiency and robustness of this compound tracking control algorithm. 相似文献
18.
研究了零散货物的装载问题。根据待装货物体积、重量与货车客积、载重的相对关系，将货物分为两类。对于不同货物类型的单车装载问题，优先考虑其主要约束目标，而对其他目标则适时调整。对于货物足够多的多车装载问题，关键是按照货物的类型确定不同的装车顺序。对于货车足够多的多车装载问题，则利用上次循环得到的解，对下一次的装车次序进行调整，使解不断趋于优化。 相似文献
19.
20.
《Journal of The Franklin Institute》2022,359(10):4874-4892
In this paper, we study the cooperation problem over a group of discrete-time nonlinear dynamically decoupled multi-agent systems (MAS). A distributed model predictive control (DMPC) scheme is proposed in the event-triggered context. Agents cooperate through a coupled cost function subject to input constraints. From the practical perspective, the additive disturbances are taken into account in the controller design. Using the contraction theory in the framework of Riemannian manifolds, a novel constraint is constructed in the DMPC optimization problem to provide the capability of disturbance rejection. Moreover, the event-triggered mechanism is introduced for saving computational and communicational resources. The event-triggering condition is developed by checking the Riemannian distance between the actual and optimal state trajectories. The stability of the closed-loop system and recursive feasibility of the DMPC scheme, thereafter, are rigorously analyzed. In particular, the stability analysis is built upon the contraction theory, which distinguishes this work from the existing results using the conventional Lyapunov theory. It is shown that the recursive feasibility is guaranteed if the additive disturbances are bounded and the event-triggering condition is properly designed. The numerical simulation results demonstrate the effectiveness of the proposed algorithm. 相似文献