Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publication Artículo de revisión (ReviewArticle)

Learnheuristics, Hybridizing metaheuristics with machine learning for optimization with dynamic inputs

  • Calvet, Laura|||0000-0001-8425-1381
  • Armas, Jésica De
  • Masip, David
  • Juan, Ángel A.|||0000-0003-1392-1776
This paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms. Learnheuristics can be used to solve combinatorial optimization problems with dynamic inputs (COPDIs). In these COPDIs, the problem inputs (elements either located in the objective function or in the constraints set) are not fixed in advance as usual. On the contrary, they might vary in a predictable (non-random) way as the solution is partially built according to some heuristic-based iterative process. For instance, a consumer's willingness to spend on a specific product might change as the availability of this product decreases and its price rises. Thus, these inputs might take different values depending on the current solution configuration. These variations in the inputs might require from a coordination between the learning mechanism and the metaheuristic algorithm: at each iteration, the learning method updates the inputs model used by the metaheuristic.
O2, repositorio institucional de la UOC
Publication Artículo científico (JournalArticle)

A simheuristic algorithm for solving the arc routing problem with stochastic demands

  • González Martín, Sergio
  • Juan, Angel A.
  • Riera Terrén, Daniel
  • Elizondo, Monica G.
  • Ramos, Juan Jose
This paper proposes a simheuristic algorithm for solving the Arc Routing Problem with Stochastic Demands (ARPSD). Our approach combines Monte Carlo Simulation (MCS) with the RandSHARP metaheuristic, which was originally designed for solving the Capacitated Arc Routing Problem with deterministic demands (CARP). The RandSHARP metaheuristic is a biased-randomized version of a savings-based heuristic for the CARP, which allows it to obtain competitive results for this problem in low computational times. The RandSHARP is then combined with MCS to cope with the stochastic variant of the problem in a natural and efficient way. Our work is based on the use of a safety stock during the route-design stage. This safety stock can then be used during the delivery stage to satisfy unexpected demands. A reliability index is also defined to evaluate the robustness of each solution with respect to possible route failures caused by random demands. Some numerical experiments contribute to validate our approach and to illustrate its potential benefits.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs

  • Gruler, Aljoscha|||0000-0003-0510-117X
  • Panadero, Javier|||0000-0002-3793-3328
  • Armas Adrián, Jésica de|||0000-0002-7619-7407
  • Moreno Pérez, José Andrés|||0000-0001-9506-5197
  • Juan, Ángel A|||0000-0003-1392-1776
Vendor managed inventory aims at reducing supply chain costs by centralizing inventory management and vehicle routing decisions. This integrated supply chain approach results in a complex combinatorial optimization problem known as the inventory routing problem (IRP). This paper presents a variable neighborhood search metaheuristic hybridized with simulation to solve the IRP under demand uncertainty. Our simheuristic approach is able to solve large sized instances for the single period IRP with stochastic demands and stock-outs in very short computing times. A range of experiments underline the algorithm's competitiveness compared to previously used heuristic approaches. The results are analyzed in order to provide closer managerial insights.