Metaheuristic Solver for Problems with Permutative Representation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00361949" target="_blank" >RIV/68407700:21230/23:00361949 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/23:00361949
Result on the web
<a href="https://doi.org/10.1007/978-3-031-19958-5_5" target="_blank" >https://doi.org/10.1007/978-3-031-19958-5_5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-19958-5_5" target="_blank" >10.1007/978-3-031-19958-5_5</a>
Alternative languages
Result language
angličtina
Original language name
Metaheuristic Solver for Problems with Permutative Representation
Original language description
Today, a large proportion of combinatorial optimization problems can be efficiently formulated as a mixed-integer program and solved with an exact solver. However, exact solvers do not scale well and thus custom metaheuristic algorithms are being designed to provide better scalability at the cost of no optimality guarantees and time-consuming development. This paper proposes a novel formalism for a large class of problems with permutative representation, together with a metaheuristic solver addressing these problems. This approach combines the advantages of both exact and metaheuristic solvers: straightforward problem formulation, scalability, low design time, and ability to find high quality solutions. Three different problems are formulated in the proposed formalism and solved with the proposed solver. The solver is benchmarked against the Gurobi Optimizer and significantly outperforms it in experiments with a fixed computational budget.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Intelligent Computing & Optimization
ISBN
978-3-031-19957-8
ISSN
2367-3370
e-ISSN
2367-3389
Number of pages
13
Pages from-to
42-54
Publisher name
Springer
Place of publication
Cham
Event location
Hua Hin
Event date
Oct 27, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—