Authors: Mladenović, Nenad 
Brimberg, Jack
Urošević, Dragan 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Formulation Space Search Metaheuristic
First page: 405
Last page: 445
Related Publication(s): The Palgrave Handbook of Operations Research
Issue Date: 2022
Rank: M14
ISBN: 978-3-030-96934-9
DOI: 10.1007/978-3-030-96935-6_12
Many methods for solving discrete and continuous global optimization problems are based on changing one formulation to another, which is either equivalent or very close to it. These types of methods include dual, primal-dual, Lagrangian, linearization, surrogation, convexification methods, coordinate system change, discrete/continuous reformulations, to mention a few. However, in all those classes, the set of formulations of one problem are not considered as a set having some structure provided with some order relation among formulations. The main idea of Formulation Space Search (FSS) is to provide the set of formulations with some metric or quasi-metric relations, used for solving a given class or type of problem. In that way, the (quasi) distance between formulations is introduced, and the search space is extended to the set of formulations as well. This chapter presents the general methodology of FSS, and gives an overview of several applications taken from the literature that fall within this framework. We also examine a few of these applications in more detail.
Publisher: Palgrave Macmillan

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM




This item is licensed under a Creative Commons License Creative Commons