Zobrazeno 1 - 8
of 8
pro vyhledávání: '"90-08 (Primary)"'
This work introduces a novel blackbox optimization algorithm for computationally expensive constrained multi-fidelity problems. When applying a direct search method to such problems, the scarcity of feasible points may lead to numerous costly evaluat
Externí odkaz:
http://arxiv.org/abs/2312.13128
This study proposes a new constraint handling technique for assisting metaheuristic optimization algorithms to solve constrained optimization problems more effectively and efficiently. Given any two solutions of any constrained optimization problems,
Externí odkaz:
http://arxiv.org/abs/2310.13186
Autor:
Garner, Casey, Holder, Allen
Classifications organize entities into categories that identify similarities within a category and discern dissimilarities among categories, and they powerfully classify information in support of analysis. We propose a new classification scheme premi
Externí odkaz:
http://arxiv.org/abs/2209.01052
Home health care problems consist of scheduling visits to home patients by health professionals while following a series of requirements. This paper studies the Home Health Care Routing and Scheduling Problem, which comprises a multi-attribute vehicl
Externí odkaz:
http://arxiv.org/abs/2206.14347
Trajectory inference aims at recovering the dynamics of a population from snapshots of its temporal marginals. To solve this task, a min-entropy estimator relative to the Wiener measure in path space was introduced by Lavenant et al. arXiv:2102.09204
Externí odkaz:
http://arxiv.org/abs/2205.07146
We consider the price-optimal earliest arrival problem in public transit (POEAP) in which we aim to calculate the Pareto-set of journeys with respect to ticket price and arrival time in a public transportation network. Public transit fare structures
Externí odkaz:
http://arxiv.org/abs/2204.01326
Autor:
Gouvine, Gabriel
In this paper, we present a novel approach for solving a maintenance scheduling problem from the French electricity grid company RTE, as presented in the ROADEF 2020 challenge. Our approach combines constraint generation with a new family of cutting
Externí odkaz:
http://arxiv.org/abs/2111.01047
Autor:
Gabriel Gouvine
Publikováno v:
Gabriel Gouvine
HAL
HAL
The ROADEF 2020 challenge presents a maintenance scheduling problem from the French electricity grid company RTE. The modeling of uncertainty makes the problem highly nonconvex and apparently out of the reach of mathematical solvers. We present our a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a1dbbb0715e60337729f2445eb5b752
https://hal.archives-ouvertes.fr/hal-03413634
https://hal.archives-ouvertes.fr/hal-03413634