Automatic legal case summarization crucially condenses a lengthy document into a short structure, while conserving its information content and overall meaning. Manual summarization necessitates a substantial amount of human labor and time. For this reason, automatic text summarization is introduced which saves the legal expert time. One of the key difficulties in legal text summarizations is the study of high-dimensional input results. This issue can be solved by using feature selection. Various heuristic algorithms like particle swarm optimization, genetic algorithm, and ant colony search algorithm provide better accuracy in particular problems, but they cannot be used as universal. Gravitational search algorithm is one of the modern optimizations based on heuristics algorithms according to Newton’s law. But, the gravitational search algorithm is incapable of recalling information that implies a reduction in memory. To overcome this issue, we have proposed a global optimum and local optimum solution from particle swarm optimization that can be added with the gravitational search algorithm.