Scribd
Upload
5 views3 pages

A New Algorithm For Solving Linear Bottleneck Assi

The document presents a new algorithm for solving linear bottleneck assignment problems (LBAP), which are crucial in emergency situations like dispatching fire fighters and ambulances. The proposed algorithm improves efficiency and speed in decision-making processes by utilizing the Hungarian method and includes examples to illustrate its application. The authors emphasize the algorithm's simplicity and effectiveness compared to existing methods.

Uploaded by

陳徐行
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

A New Algorithm For Solving Linear Bottleneck Assi

The document presents a new algorithm for solving linear bottleneck assignment problems (LBAP), which are crucial in emergency situations like dispatching fire fighters and ambulances. The proposed algorithm improves efficiency and speed in decision-making processes by utilizing the Hungarian method and includes examples to illustrate its application. The authors emphasize the algorithm's simplicity and effectiveness compared to existing methods.

Uploaded by

陳徐行
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/284766515

A New Algorithm for Solving Linear Bottleneck Assignment Problem

Article in Journal of Institute of Science and Technology · November 2015


DOI: 10.3126/jist.v20i2.13961

CITATIONS READS

11 1,294

3 authors, including:

Pramendra Singh Pundir Brijesh P. Singh


Department of Statistics University of Allahabad Banaras Hindu University
23 PUBLICATIONS 427 CITATIONS 148 PUBLICATIONS 396 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Brijesh P. Singh on 22 January 2016.

The user has requested enhancement of the downloaded file.


ISSN: 2469-9062 (print), 2467-9240(e)
Journal of Institute of Science and Technology, 2015, 20(2): 101-102, © IOST, Tribhuvan University

A New Algorithm for Solving Linear Bottleneck Assignment Problem

Pramendra Singh Pundir1, Sandeep Kumar Porwal2 and Brijesh P. Singh3


1
Department of Statistics, University of Allahabad, Allahabad
Banaras Hindu University, Varanasi, INDIA
2
DST-CIMS, Banaras Hindu University, Varanasi, INDIA.
3
Faculty of Commerce and DST-CIMS, BHU, Varanais, INDIA
E-mail: [email protected]

ABSTRACT
Linear bottleneck assignment problems have wide range of applications in emergency situation like call for fire
fighters, ambulances etc. This paper presents a new simple but faster algorithm for solving linear bottleneck
assignment problems, so that in such emergent situation efficient and faster decision taking could be make
possible. Some examples are also discussed to explain the procedure.

Keywords: Linear bottleneck assignment problems, improved solution, optimal value.

INTRODUCTION
Around 60 years back, in 1955 and 1956 Harold Step 3: Obtain efficient solution by using Hungarian
(1955) published two famous articles presenting the method. If solution exist then c* is optimal value for
Hungarian algorithm, the first polynomial-time LBAP.
method for the assignment problem. This historic Otherwise,
result allowed the researchers for the first time an Step 4: Write down all the entries of the cost matrix
easy solution of real-world instances that no C=[cij] in ascending order and take next ordered value
computer on earth could then handle. Since then the larger than c*, as improved c*. Now, repeat step 2 and
assignment problem has attracted hundreds of 3 till the solution is obtained.
researchers, accompanying and sometimes EXAMPLES
anticipating the development of combinatorial Here we consider, two examples from Burkard et al.
optimization. Burkard et al. (2009) had given a (2009).
comprehensive view of this huge area, starting from
the conceptual foundations laid down since the 1920s Example 1: Consider an LBAP with cost matrix
by the studies on matching problems, and examining   3 54392 
in detail theoretical, algorithmic, and practical  3 3

C  0 e e 
developments of the various assignment problems.  2 sin   8  4 
 
Linear bottleneck assignment problems (LBAP) were
introduced by Fulkerson et al. (1953) in connection Solution:
with assigning jobs to parallel machines so as to
Step 1: c*= Max (-2, sin   8  , 4, 3 , 0, -2)= 4
minimize the latest completion time. In this paper, an
improved algorithm for solving LBAP is discussed Step 2: Using Hungarian method we get the solution
with examples. as (2, 1, 3).
THE ALGORITHM Example 2: Consider an LBAP with cost matrix
For the given cost matrix C=[cij] 8 2 3 3
Step 1: Define the c*= Max (Minicij, Minjcij) 
2 7 5 8

C  
Step 2: Replace all those entries which are greater 0 9 8 4
than c* by ∞.  
2 5 6 3

101
A New Algorithm for Solving Linear Bottleneck Assignment Problem

Solution: either less iterations (i.e. number of times c* is


Step 1: c*= Max (2, 2, 0, 2, 0, 2, 3, 3)= 3 defined) or at the most in as many iterations taken by
any other popular method like threshold algorithm,
Step 2: Using Hungarian method we could not get the augmenting path methods etc.
solution.
REFERENCES
Step 3: Ordered arrangement of the cij,s is 0, 2, 2, 2,
3, 3, 3, 4, 5, 5, 6, 7, 8, 8, 8, 9. Now, take c*= 4. Burkard, R., Dell’Amico, M., Martello, S. 2009.
Assignment Problems. SIAM.
Step 4: Again by using Hungarian method we could
not get the solution. Fulkerson, D.R., Glicksberg, I., Gross, O. 1953. A
production line assignment problem. Tech.
Step 5: Now take c*= 5. Rep. RM-1102, The Rand Corporation, Santa
Step 6: Using Hungarian method we get the solution Monica, CA.
as (2, 3, 1, 4). Kuhn, H.W. 1955. The Hungarian method for the
CONCLUSION assignment problem. Naval Res. Log. Quart. 2:
LBAP has wide variety of applications in emergency 83–97.
situation like call for fire fighters or ambulances or Kuhn, H.W. 1956. Variants of the Hungarian method
various situations during war etc. This algorithm not for the assignment problem. Naval Res. Log.
only provides a simpler tool but also a faster tool to Quart. 3: 253-258.
decision makers as it gives the optimal answer in

102

View publication stats

You might also like