The Metaheuristic Strategy for AI Search and Optimization

Carlos A. S. Oliveira ()
Additional contact information
Carlos A. S. Oliveira: AT&T Labs Inc.

Chapter Chapter 9 in Handbook of Artificial Intelligence and Data Sciences for Routing Problems, 2025, pp 157-176 from Springer

Abstract: Abstract The design of exact algorithms running in polynomial time for problems belonging to the class NP-hard has been one of the main open problems in the area of theoretical computer science. For this reason, when one needs to solve instances of these problems that are sufficiently large, it is necessary to employ methods that may result only in an approximate solution. This chapter discusses metaheuristic strategies that are commonly used in the solution of hard combinatorial optimization problems. Approximation algorithms with performance guarantees offer a powerful approach to tackling NP-hard problems, providing solutions that are provably close to optimal. However, the design of such algorithms relies heavily on the specific properties of the problem and may not be generalizable across different problem domains. For problems where no approximation guarantee is feasible, heuristic methods remain an essential tool in the practitioner’s arsenal.

Keywords: Metaheuristics; Math programming; AI algorithms; Optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-78262-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9783031782626

DOI: 10.1007/978-3-031-78262-6_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().