The Comparison between Dragonflies Algorithm and Fireflies Algorithm for Court Case Administration: A Mixed Integer Linear Programming

Abstract

This article focuses on case assignment which is one of the most significant tools in case management to improve efficiency of judicial system. The effectiveness of judicial system depends greatly on the efficient and timely manner of court case operation, especially in criminal cases where suspects are hold in prison on remand. To ensure the rule of law, the preferred system in the court of justice is the one that is predictable and consistent. However, one of the building blocks to such goal is the nature of litigation which is unpredictably time consuming. In this paper, a Mixed Integer Linear Programming (MILP) is selected to address the issue of case assignment in the court of justice. The computational experiments are also reported to evaluate its solution. The two techniques of metaheuristic method are used to find optimal solution of the assignment problem that are called Dragonflies Algorithm (DA) and Fireflies Algorithm (FA). The result shows that DA is more effective in finding an optimal solution to the problem of court case assignment than of the FA.