A transportation branch and bound algorithm for solving the generalized assignment problem

被引:7
|
作者
Munapo E. [1 ]
Lesaoana M. [2 ]
Nyamugure P. [3 ]
Kumar S. [4 ]
机构
[1] Graduate School of Business and Leadership, University of KwaZulu-Natal, Westville Campus, Durban
[2] Department of Statistics and Operations Research, University of Limpopo, Bag X1106, Sovenga
[3] Department of Statistics and Operations Research, National University of Science and Technology, P.O. Box AC 939, Ascot, Bulawayo
[4] Department of Mathematics and Statistics, University of Melbourne, Parkville
关键词
Branch and bound method; Generalized assignment problem; Transportation model;
D O I
10.1007/s13198-015-0343-9
中图分类号
学科分类号
摘要
This paper presents a transportation branch and bound algorithm for solving the generalized assignment problem. This is a branch and bound technique in which the sub-problems are solved by the available efficient transportation techniques rather than the usual simplex based approaches. A technique for selecting branching variables that minimize the number of sub-problems is also presented. © 2015, The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden.
引用
收藏
页码:217 / 223
页数:6
相关论文
共 50 条
  • [21] On solving fully intuitionistic fuzzy transportation problem via branch and bound technique
    Rani, J. Jansi
    Dhanasekar, S.
    Micheal, David Raj
    Manivannan, A.
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2023, 44 (04) : 6219 - 6229
  • [22] Fleet Assignment Problem Study Based on Branch-and-bound Algorithm
    Wu Donghua
    Xia Hongshan
    Fan Yongjun
    Zhang Jinyuan
    [J]. PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON MECHATRONICS, CONTROL AND ELECTRONIC ENGINEERING, 2014, 113 : 16 - 20
  • [23] A branch and bound algorithm for the cyclic job-shop problem with transportation
    Brucker, Peter
    Burke, Edmund K.
    Groenemeyer, Sven
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3200 - 3214
  • [24] SOLVING THE GENERALIZED TRANSPORTATION PROBLEM
    ROWSE, J
    [J]. REGIONAL SCIENCE AND URBAN ECONOMICS, 1981, 11 (01) : 57 - 68
  • [25] One algorithm for branch and bound method for solving concave optimization problem
    Andrianova, A. A.
    Korepanova, A. A.
    Halilova, I. F.
    [J]. 11TH INTERNATIONAL CONFERENCE ON MESH METHODS FOR BOUNDRY-VALUE PROBLEMS AND APPLICATIONS, 2016, 158
  • [26] BRANCH AND BOUND METHOD FOR SOLVING A GENERALIZED DISTRIBUTION PROBLEM WITH OPTIMIZING SOURCE CAPACITIES
    KUBAT, J
    [J]. EKONOMICKO-MATEMATICKY OBZOR, 1975, 11 (03): : 273 - 289
  • [27] A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming
    Ramakrishnan, KG
    Resende, MGC
    Pardalos, PM
    [J]. STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 57 - 73
  • [28] A BRANCH AND BOUND ALGORITHM FOR SOLVING A CLASS OF GENERALIZED LINEAR MULTIPLICATIVE PROGRAMMING PROBLEMS
    Liu, Xia
    Gao, Yue-Lin
    Zhang, Bo
    Huang, Xiao-Li
    [J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2021, 22 (01) : 149 - 162
  • [29] A branch-and-bound algorithm for finding all optimal solutions of the assignment problem
    Fu, Zhuo
    Eglese, Richard
    Wright, Mike
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (06) : 831 - 839
  • [30] A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
    Hahn, P
    Grant, T
    Hall, N
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) : 629 - 640