A Review of Metaheuristics for Solving Combinatorial Optimization Problems in Management

Metaheuristics have already shown useful in solving difficult problems in a broad range of fields over the last several decades. This accomplishment spurs the research group to create new, more successful heuristics and stimulates interest in this area of study. However, recent research has concentrated on constructing innovative algorithms but instead of consolidating the body of current knowledge. A further obstacle to the advancement of the area is the lack of formalization and precision in the identification, design, and development of combinatorial optimization issues and metaheuristics. The basic ideas and issues in this domain are discussed, and formalism is suggested for organizing, designing, and coding combinatorial optimization issues and metaheuristics. We think these contributions might help the discipline advance and make metaheuristics more capable of solving problems comparable to these other machine learning methods.