The applications of hybrid approach combining exact method and evolutionary algorithm in combinatorial optimization

Abstract

Abstract Combinatorial optimization problems have very important applications in information technology, transportation, economics, management, network communication, and other fields. Since the problem size in real-scenario application is in large-scale, the demand for real-time and efficient solving approaches increases rapidly. The traditional exact methods guarantee the optimality of the final solution, but these methods can hardly solve the problem in acceptable time due to extremely high computational costs. Heuristic approaches can find feasible solutions in a limited time, while these approaches cannot meet the demand of solution quality. In recent years, hybrid algorithms based on exact methods and heuristic algorithms show outstanding performance in solving large-scale combinatorial optimization problems. The hybridization not only overcomes the shortcomings from single algorithm but also fully utilizes the search ability for population-based approaches as well as the interpretability in exact methods, which promotes the application of combinatorial optimization in real-world problems. This paper reviews existing studies on hybrid algorithms combining exact method and evolutionary computation, summarizes the characteristics of the existing algorithms, and directs the future research.