A new Simheuristics procedure for stochastic combinatorial optimization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Berkhout, Joost
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916352261881856
author Berkhout, Joost
author_facet Berkhout, Joost
contents Ignoring uncertainty in combinatorial optimization leads to suboptimal decisions in practice. Nevertheless, the focus is often on deterministic combinatorial optimization problems, mainly because they are already challenging enough without stochasticity. To make it easier to address stochasticity in combinatorial optimization, Simheuristics have been developed that allow solving stochastic combinatorial optimization problems. We propose a new Simheuristic procedure that dynamically changes the optimization focus between a deterministic and stochastic perspective based upon a statistical model. By doing so, an adequate trade-off is made between exploration and exploitation of the solution space during the optimization. We numerically show that the new Simheuristic procedure solves real-life stochastic scheduling problems more efficiently than standard Simheuristics strategies.
format Preprint
id arxiv_https___arxiv_org_abs_2408_05214
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A new Simheuristics procedure for stochastic combinatorial optimization
Berkhout, Joost
Optimization and Control
Ignoring uncertainty in combinatorial optimization leads to suboptimal decisions in practice. Nevertheless, the focus is often on deterministic combinatorial optimization problems, mainly because they are already challenging enough without stochasticity. To make it easier to address stochasticity in combinatorial optimization, Simheuristics have been developed that allow solving stochastic combinatorial optimization problems. We propose a new Simheuristic procedure that dynamically changes the optimization focus between a deterministic and stochastic perspective based upon a statistical model. By doing so, an adequate trade-off is made between exploration and exploitation of the solution space during the optimization. We numerically show that the new Simheuristic procedure solves real-life stochastic scheduling problems more efficiently than standard Simheuristics strategies.
title A new Simheuristics procedure for stochastic combinatorial optimization
topic Optimization and Control
url https://arxiv.org/abs/2408.05214