A Heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators
Research model to maximize the overall effectiveness of a digital forensic CSI procedure. We describe sequential and parallel scenarios for CSI in time critical forensic cases. We present MILP model to analyze the problem of allocating evidences to investigators and investigation time for selected evidences for the sequential scenario. Sequential digital forensic investigation problem with multiple investigators is NP-hard in the strong sense. We develop a heuristic algorithm with justifying extensive computational experiments to solve the problem. We discuss the extensions of the proposed model to enhance applications to practical digital forensic problems.
digital forensics np-hardness crime scene investigation mixed integer programming heuristic solution computational results