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 concentr...

Full description

Saved in:
Bibliographic Details
Published in2023 3rd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE) pp. 38 - 42
Main Authors Mulla, Gulnar Sadat, Gupta, Keerat Kumar, Sharma, Sameer Dev, R, Ramesh, Kumar, Manish, Ganesh, KVB
Format Conference Proceeding
LanguageEnglish
Published IEEE 12.05.2023
Subjects
Computer architecture
Heuristic algorithms
issues with combinatorial optimization
Machine learning
meta - heuristics
Metaheuristics
methodology
Principles
Productivity
Scalability
Software algorithms
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/ICACITE57410.2023.10183253