Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A review of Simheuristics: extending metaheuristics to deal with stochastic optimization problems
Publication

Publications

A review of Simheuristics: extending metaheuristics to deal with stochastic optimization problems

Title
A review of Simheuristics: extending metaheuristics to deal with stochastic optimization problems
Type
Article in International Scientific Journal
Year
2015
Authors
Angel A. Juan
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Javier Faulin
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Scott E. Grasman
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Markus Rabe
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 2
Pages: 62-72
ISSN: 2214-7160
Publisher: Elsevier
Scientific classification
FOS: Engineering and technology
Other information
Authenticus ID: P-00G-3DK
Abstract (EN): Many combinatorial optimization problems (COPs) encountered in real-world logistics, transportation, production, healthcare, financial, telecommunication, and computing applications are NP-hard in nature. These real-life COPs are frequently characterized by their large-scale sizes and the need for obtaining high-quality solutions in short computing times, thus requiring the use of metaheuristic algorithms. Metaheuristics benefit from different random-search and parallelization paradigms, but they frequently assume that the problem inputs, the underlying objective function, and the set of optimization constraints are deterministic. However, uncertainty is all around us, which often makes deterministic models oversimplified versions of real-life systems. After completing an extensive review of related work, this paper describes a general methodology that allows for extending metaheuristics through simulation to solve stochastic COPs. ‘Simheuristics’ allow modelers for dealing with real-life uncertainty in a natural way by integrating simulation (in any of its variants) into a metaheuristic-driven framework. These optimization-driven algorithms rely on the fact that efficient metaheuristics already exist for the deterministic version of the corresponding COP. Simheuristics also facilitate the introduction of risk and/or reliability analysis criteria during the assessment of alternative high-quality solutions to stochastic COPs. Several examples of applications in different fields illustrate the potential of the proposed methodology.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Using variable neighbourhood descent and genetic algorithms for sequencing mixed-model assembly systems in the footwear industry (2021)
Article in International Scientific Journal
José Soeiro Ferreira; Parisa Sadeghi; Rui Diogo Rebelo
Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap (2019)
Article in International Scientific Journal
Luiz Henrique Cherri; Maria Antónia Carravilla; Cristina Ribeiro; Franklina Maria Bragion Toledo
Integrating pricing and capacity decisions in car rental: A matheuristic approach (2018)
Article in International Scientific Journal
Beatriz Brito Oliveira; Maria Antónia Carravilla; José Fernando Oliveira
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-15 at 22:32:47 | Privacy Policy | Personal Data Protection Policy | Whistleblowing