Person:
Torre, Rocío de la

Profile Picture

Email Address

Birth Date

Research Projects

Organizational Units

Job Title

Last Name

Torre

First Name

Rocío de la

person.page.departamento

Gestión de Empresas

ORCID

0000-0002-8662-8901

person.page.upna

811619

Name

Filters

20201
Reset filters

Settings

End date: 2023 × Subject: Biased-randomized algorithms ×

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    PublicationOpen Access
    On the use of biased-randomized algorithms for solving non-smooth optimization problems
    (MDPI, 2020) Juan Pérez, Ángel Alejandro; Corlu, Canan Gunes; Tordecilla, Rafael D.; Torre, Rocío de la; Ferrer, Albert; Enpresen Kudeaketa; Institute for Advanced Research in Business and Economics - INARBE; Gestión de Empresas
    Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines.