Document Type
Article
Publication Date
2022
DOI
10.24018/compute.2022.2.2.50
Publication Title
European Journal of Information Technologies and Computer Science
Volume
2
Issue
2
Pages
6-12
Abstract
There are several approaches for solving hard optimization problems. Mathematical programming techniques such as (integer) linear programming-based methods and metaheuristic approaches are two extremely effective streams for combinatorial problems. Different research streams, more or less in isolation from one another, created these two. Only several years ago, many scholars noticed the advantages and enormous potential of building hybrids of combining mathematical programming methodologies and metaheuristics. In reality, many problems can be solved much better by exploiting synergies between these approaches than by “pure” classical algorithms. The key question is how to integrate mathematical programming methods and metaheuristics to achieve such benefits. This paper reviews existing techniques for such combinations and provides examples of using them for vehicle routing problems.
ORCID
0000-0002-9759-9210 (Tahami)
Original Publication Citation
Tahami, H., & Fakhravar, H. (2022). A literature review on combining heuristics and exact algorithms in combinatorial optimization. European Journal of Information Technologies and Computer Science, 2(2), 6-12. https://doi.org/10.24018/ejcompute.2022.2.2.50
Repository Citation
Tahami, Hesamoddin and Fakhravar, Hengameh, "A Literature Review On Combining Heuristics and Exact Algorithms in Combinatorial Optimization" (2022). Engineering Management & Systems Engineering Faculty Publications. 118.
https://digitalcommons.odu.edu/emse_fac_pubs/118
Included in
Computational Engineering Commons, Computer Engineering Commons, Numerical Analysis and Computation Commons, Operations Research, Systems Engineering and Industrial Engineering Commons
Comments
"All published works are licensed under a Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) License."