Pasar al contenido principal

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación 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.
Dipòsit Digital de Documents de la UAB
Publicación 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.