DocumentCode
2121345
Title
Determinant elimination approach for precise solution to generalized assignment problems
Author
Xu Wangbao ; Chen Xuebo
Author_Institution
Sch. of Electron. & Inf. Eng., Liaoning Univ. of Sci. & Technol., Anshan, China
fYear
2010
fDate
29-31 July 2010
Firstpage
1781
Lastpage
1785
Abstract
This paper investigates generalized assignment problem and methods for the problem, because the problem is valuable in theory and often used in many practical engineering problems. Firstly, based on the discussions about branch rule, bound function and elimination rule, a determinant elimination approach is proposed for the problem, and its program is given in Matlab language. Then, with the aim to improve the method, an insert method for an initial assignment is presented and the process to adjust and transform the cost matrix is also given. Finally, the steps for improved determinant elimination approach are listed and numerical experiments are given. The experimental results show that the proposed methods are feasible and efficient.
Keywords
determinants; optimisation; tree searching; Matlab language; bound function; branch rule; cost matrix; determinant elimination approach; elimination rule; generalized assignment problem; Computers; Control systems; Electronic mail; Information science; Laboratories; Logistics; Operations research; Assignment Problem; Branch and Bound Approach; Determinant Elimination Approach; Hungarian Method;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2010 29th Chinese
Conference_Location
Beijing
Print_ISBN
978-1-4244-6263-6
Type
conf
Filename
5573970
Link To Document