Abstract: It is known that litigation is time consuming. However, justice delayed is justice denied. The effectiveness of judicial system depends on the efficient and timely manner of court case operation. Court case assignment in Thailand is currently operated in a random assignment norm. However, the increasing number of cases in the court of justice contributes as a building block to the reputation of time consuming operating system. Selecting the right cases to be assigned to the available efficient judge in the area is a vital need for judicial operation. Therefore, major challenges with respect to court case assignment are to determine the right case to be assigned to the right efficient judge in the field and to allocate appropriate time for delivering the court decision in order to maximize the effectiveness of the judicial system. In this article, the selected math model is a mixed integer linear programming that is developed to analyze and solve the problem. A metaheuristic algorithm with polynomially bounded computational complexity is proposed to address the issue. Furthermore, results of extensive computational experiments to empirically evaluate its effectiveness to find an optimal solution are reported.
Keywords: Justice administration, Case assignment, Mixed integer programming, Assignment problem, Metaheuristic method, NP-hard problem
Cite this paper
W. Wongsinlatam, K. Pimpila, A. Wongphat, S. Buchitchon. (2016) A Mixed Integer Linear Programming for Maximizing Effectiveness of Case Assignment in Court of Justice Using Metaheuristic Optimization. International Journal of Mathematical and Computational Methods, 1 , 415-420

Copyright © 2016 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution License 4.0


