In this paper we examine the check sorting and clearing operation and develop a mathematical model for arriving at optimal decisions on check sorting patterns and clearing routes. Previous research in this area has focused on either the sorting operation or the clearing operation, and hence the main contribution of our research is to develop and solve optimization model that simultaneously represents both these operations. The proposed model was tested using real-life operational data obtained from a Philadelphia-based bank. After optimally solving the model, we recommend possible ways of finding more robust sorting and clearing decisions, and compare the robust decisions to the optimal solution. It should be noted that the sorting and clearing operation is not limited to banking industry alone, but that it is also a backbone of the U.S. Postal Service operation. The output of the proposed research can therefore have wider applicability and implications.
[1]
R. Nauss,et al.
Optimization of Bank Transit Check Clearing Operations
,
1985
.
[2]
Sidney W. Hess.
Design and Implementation of a New Check Clearing System for the Philadelphia Federal Reserve District
,
1975
.
[3]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.
[4]
Donald E. Knuth,et al.
The art of computer programming, volume 3: (2nd ed.) sorting and searching
,
1998
.
[5]
Frederic H. Murphy,et al.
A Mathematical Programming Approach to the Scheduling of Sorting Operations
,
1978
.
[6]
Robert E. Markland,et al.
Improving Transit Check Clearing Operations at Maryland National Bank
,
1983
.
[7]
Frederic H. Murphy,et al.
A Dynamic Programming Algorithm for Check Sorting
,
1977
.
[8]
Susan Robertson.
New research provides snapshot of U.S. retail payments
,
2002
.