检索结果-内蒙古大学图书馆

A generalization of the assignment problem, and its application to the Rank Aggregation problem

FUNDAMENTA INFORMATICAE 2007年第4期81卷 459-471页

作者： Manea, Florin Ploscaru, Calina Univ Bucharest Fac Math & Comp Sci Bucharest Romania

In this paper we propose a generalization of the assignment problem. First, we describe an algorithm, based on network flow techniques, that obtains just one solution of the approached problem;further, we develop an algorithm that is able to find all the solutions. Finally, we discuss how this general form of the assignment problem can be applied in solving the Rank Aggregation problem, in the case of rankings with ties.

关键词： assignment problem network flow ranking rank aggregation problem

来源：评论

学校读者我要写书评

暂无评论

A priority based assignment problem

引用

APPLIED MATHEMATICAL MODELLING 2016年第17-18期40卷 7784-7795页

作者： Kaur, Prabhjot Sharma, Anuj Verma, Vanita Dahiya, Kalpana Panjab Univ Univ Inst Engn & Technol Chandigarh 160014 India Panjab Univ Dept Math Chandigarh 160014 India Panjab Univ Dept Comp Sci & Applicat Chandigarh 160014 India

This paper discusses a priority based assignment problem related to an industrial project consisting of a total of n jobs. Depending upon its work breakdown structure, the execution of the project is carried out in two stages where the m primary jobs are performed first, in Stage-I whereas the (n - m) secondary jobs are performed later in Stage-II (as the secondary jobs cannot be performed until the primary jobs are finished). A number of manufacturing units exactly equal to n, each of them capable of performing all the n jobs involved in the project, are available. A tentative job-performance time taken by each of these manufacturing units for each of the n jobs is available. The purpose of the current study is to assign the jobs to the manufacturing units in such a way that the two stage execution of the project can be carried out in the minimum possible time. For this, a polynomial time iterative algorithm is proposed, which at each iteration, aims at selecting m manufacturing units to perform primary jobs corresponding to which, the remaining (n - m) manufacturing units perform the secondary jobs optimally and from this selection, a pair of times of Stage-I and Stage-II is obtained. The proposed algorithm is such that at each iteration, time of Stage-I decreases strictly and time of Stage-II increases. Out of the pairs so generated, the one with minimum sum of Stage-I and Stage-II times is considered as optimum and the corresponding assignment as the optimal assignment. A numerical illustration is given in the support of the theory. Also, the proposed algorithm is implemented and tested on a variety of test problems and the average run time for each problem is calculated. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Optimization Non-linear programming Combinatorial analysis Allocation assignment problem

来源：评论

学校读者我要写书评

暂无评论

Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm

引用

APPLIED MATHEMATICAL MODELLING 2009年第10期33卷 3926-3935页

作者： Liu, Linzhong Gao, Xin Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou 730070 Peoples R China Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

In this paper, the equilibrium optimization problem is proposed and the assignment problem is extended to the equilibrium multi-job assignment problem, equilibrium multi-job quadratic assignment problem and the minimum cost and equilibrium multi-job assignment problem. Furthermore, the mathematical models of the equilibrium multi-job assignment problem and the equilibrium multi-job quadratic assignment problem with fuzzy parameters are formulated. Finally, a genetic algorithm is designed for solving the proposed programming models and some numerical examples are given to verify the efficiency of the designed algorithm. (C) 2009 Published by Elsevier Inc.

关键词： assignment problem Credibility theory Fuzzy set Equilibrium optimization Quadratic assignment problem

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm for the personnel assignment problem with multiple objectives

引用

INFORMATION SCIENCES 2007年第3期177卷 787-803页

作者： Toroslu, Ismail H. Arslanoglu, Yllmaz Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

The assignment problem is a well-known graph optimization problem defined on weighted-bipartite graphs. The objective of the standard assignment problem is to maximize the summation of the weights of the matched edges of the bipartite graph. In the standard assignment problem, any node in one partition can be matched with any node in the other partition without any restriction. In this paper, variations of the standard assignment problem are defined with matching constraints by introducing structures in the partitions of the bipartite graph, and by defining constraints on these structures. According to the first constraint, the matching between the two partitions should respect the hierarchical-ordering constraints defined by forest and level graph structures produced by using the nodes of the two partitions respectively. In order to define the second constraint, the nodes of the partitions of the bipartite graph are distributed into mutually exclusive sets. The set-restriction constraint enforces the rule that in one of the partitions all the elements of each set should be matched with the elements of a set in the other partition. Even with one of these constraints the assignment problem becomes an NP-hard problem. Therefore, the extended assignment problem with both the hierarchical-ordering and set-restriction constraints becomes an NP-hard multi-objective optimization problem with three conflicting objectives;namely, minimizing the numbers of hierarchical-ordering and set-restriction violations, and maximizing the summation of the weights of the edges of the matching. Genetic algorithms are proven to be very successful for NP-hard multi-objective optimization problems. In this paper, we also propose genetic algorithm solutions for different versions of the assignment problem with multiple objectives based on hierarchical and set constraints, and we empirically show the performance of these solutions. (C) 2006 Elsevier Inc. All rights reserved.

关键词： assignment problem bipartite graph matching hierarchical-ordering constraint set constraint NP-complete multiobjective optimization problem genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Uncertain random assignment problem

引用

APPLIED MATHEMATICAL MODELLING 2018年 56卷 96-104页

作者： Ding, Sibo Zeng, Xiao-Jun Henan Univ Technol Sch Management Zhengzhou 450001 Henan Peoples R China Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

This paper proposes an uncertain random assignment problem in which random variables coexist with uncertain variables. Critical values of uncertain random variables are used to rank uncertain random variables. An uncertain random simulation algorithm is developed in order to obtain chance distributions and critical values of uncertain random variables. An alpha-optimistic model is presented. A combined optimization approach is designed to solve the alpha-optimistic model. This approach incorporates uncertain random simulation into branch and bound algorithm. Finally, an example application of the approach is presented. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Uncertainty modeling Uncertain random simulation Uncertain variable Uncertain random variable assignment problem

来源：评论

学校读者我要写书评

暂无评论

Robust contour matching via the order-pre serving assignment problem

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2006年第7期15卷 1831-1838页

作者： Scott, Clayton Nowak, Robert Rice Univ Dept Stat Houston TX 77005 USA Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA

A common approach to determining corresponding points on two shapes is to compute the cost of each possible pairing of points and solve the assignment problem (weighted bipartite matching) for the resulting cost matrix. We consider the problem of solving for point correspondences when the shapes of interest are each defined by a single, closed contour. A modification of the standard assignment problem is proposed whereby the correspondences are required to preserve the ordering of the points induced from the shapes' contours. Enforcement of this constraint leads to significantly improved correspondences. Robustness with respect to outliers and shape irregularity is obtained by required only a fraction of feature points to be matched. Furthermore, the minimum matching size may be specified in advance. We present efficient dynamic programming algorithms to solve the proposed optimization problem. Experiments on the Brown and MPEG-7 shape databases demonstrate the effectiveness of the proposed method relative to the standard assignment problem.

关键词： assignment problem contour matching dynamic programming MPEG-7 shape database shape descriptors

来源：评论

学校读者我要写书评

暂无评论

A note: a due-window assignment problem on parallel identical machines

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2011年第1期62卷 238-241页

作者： Mosheiov, G. Sarig, A. Hebrew Univ Jerusalem Sch Business Adm IL-91905 Jerusalem Israel

We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n(4))) solution procedure. Journal of the Operational Research Society (2011) 62, 238-241. doi:10.1057/jors.2009.179 Published online 3 March 2010

关键词： scheduling parallel machines earliness-tardiness due-window assignment problem

来源：评论

学校读者我要写书评

暂无评论

A Davidson College multi-objective assignment problem: a case study

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2014年第4期12卷 379-401页

作者： Chartier, Timothy P. Ellison, Victoria Langville, Amy N. Davidson Coll Dept Math Davidson NC 28035 USA N Carolina State Univ Operat Res Program Raleigh NC 27695 USA Coll Charleston Dept Math Charleston SC 29401 USA

This paper presents a multi-objective linear integer program that assigns student volunteers to present lectures at participating classes in local schools. A student's class assignment is based upon his or her availability to teach at that time as well as several additional factors including student preferences regarding commuting and partners as well as the institution's goal of creating diverse student groups. This case study shows that the proposed mathematical program dramatically improves the assignments of students to classes and provides increased flexibility for modeling other goals and factors in future years. In addition, this multi-phase model can be applied in other contexts, such as crew scheduling or the scheduling of parallel sessions of large conferences.

关键词： Mixed integer program assignment problem Multi-objective goal program

来源：评论

学校读者我要写书评

暂无评论

An extended assignment problem considering multiple inputs and outputs

引用

APPLIED MATHEMATICAL MODELLING 2007年第10期31卷 2239-2248页

作者： Chen, Liang-Hsuan Lu, Hai-Wen Natl Cheng Kung Univ Dept Ind & Informat Management Tainan 701 Taiwan Nanhua Univ Dept Elect Commerce Management Chiayi Taiwan

The existing assignment problems for assigning n jobs to n individuals are limited to the considerations of cost or profit incurred by each possible assignment. However, in real applications, various inputs and outputs are usually concerned in an assignment problem, such as a general decision-making problem. This paper develops a procedure for resolving assignment problems with multiple incommensurate inputs and outputs for each possible assignment. The concept of the relative efficiency in using various resources, instead of cost or profit, is adopted for each possible assignment of the problem. Data envelopment analysis (DEA) is employed in this paper to measure the efficiency of one assignment relative to that of the others according to a set of decision-making units. A composite efficiency index, consisting of two kinds of relative efficiencies under different comparison bases, is defined to serve as the performance measurement of each possible assignment in the problem formulation. A mathematical programming model for the extended assignment problem is proposed, which is then expressed as a classical integer linear programming model to determine the assignments with the maximum efficiency. A numerical example is used to demonstrate the approach. (c) 2006 Elsevier Inc. All rights reserved.

关键词： assignment problem Hungarian algorithm data envelopment analysis

来源：评论

学校读者我要写书评

暂无评论

Gaussian Half-Duplex Relay Networks: Improved Constant Gap and Connections With the assignment problem

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第6期60卷 3559-3575页

作者： Cardone, Martina Tuninetti, Daniela Knopp, Raymond Salim, Umer Mobile Commun Dept F-06410 Eurecom Biot France Univ Illinois Elect & Comp Engn Dept Chicago IL 60607 USA Intel Mobile Commun Algorithm Design Grp F-06560 Sophia Antipolis France

This paper considers a Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. The information theoretic cut-set upper bound to the capacity is shown to be achieved to within 1.96(N + 2) bits by noisy network coding, thereby reducing the previously known gap. This gap is obtained as a special case of a more general constant gap result for Gaussian half-duplex multicast networks. It is then shown that the generalized degrees-of-freedom of this network is the solution of a linear program, where the coefficients of the linear inequality constraints are proved to be the solution of several linear programs referred as the assignment problem in graph theory, for which efficient numerical algorithms exist. The optimal schedule, that is, the optimal value of the 2(N) possible transmit-receive configuration states for the relays, is investigated and known results for diamond networks are extended to general relay networks. It is shown, for the case of N = 2 relays, that only N + 1 = 3 out of the 2(N) = 4 possible states have a strictly positive probability and suffice to characterize the capacity to within a constant gap. Extensive experimental results show that, for a general N-relay network with N = 8, the optimal schedule has at most N + 1 states with a strictly positive probability. As an extension of a conjecture presented for diamond networks, it is conjectured that this result holds for any half-duplex relay network and any number of relays. Finally, a network with N = 2 relays is studied in detail to illustrate the channel conditions under which selecting the best relay is not optimal, and to highlight the nature of the rate gain due to multiple relays.

关键词： assignment problem capacity to within a constant gap generalized degrees-of-freedom half-duplex inner bound outer bound relay networks weighted bipartite matching problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：