Skip to main content

MEJORA EN LA TOMA DE DECISIONES EN EL AMBITO DE LA LOGISTICA Y PROBLEMAS RELACIONADOS. ENFOQUE MULTI-OBJETIVO

PID2019-104263RB-C44

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE BURGOS

Resultados relacionados

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

Repositorio Institucional de la Universidad de Burgos (RIUBU)
Publication Artículo científico (JournalArticle)

Selection of investment portfolios with social responsibility: a multiobjective model and a Tabu search method

  • Pacheco Bonrostro, Joaquín
  • Cepa Serrano, Lara
  • Puche Regaliza, Julio César
  • Casado Yusta, Silvia
In this study, a model for the selection of investment portfolios is proposed with three objectives. In addition to the traditional objectives of maximizing profitability and minimizing risk, maximization of social responsibility is also considered. Moreover, with the purpose of controlling transaction costs, a limit is placed on the number of assets for selection. To the best of our knowledge, this specific model has not been considered in the literature to date. This model is difficult (NP-Hard), and therefore, only very small instances may be solved in an exact way. This paper proposes a method based on tabu search and multiobjective adaptive memory programming (MOAMP) strategies. With this method it is possible to obtain sets of nondominated solutions in short computational times. To check the performance of our method it is compared with adaptations of the nondominated sorting genetic algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA-II) and multiobjective particle swarm optimization (MOPSO). The results of different computational experiments show that our tabu search-MOAMP method performed best. The quality of the sets of solutions that were obtained and the speed of execution mean that our tabu search-MOAMP can be used as a tool for financial assessment and analysis (including online services). This tool, as we can see in this work with some examples, can take into account the social concerns of many clients and their overall risk profile (very conservative, conservative, moderate, or fearless). This approach is also in line with current legal regulations that oblige financial advisors to take the client profile into account to provide greater protection and propose good financial advice., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was partially supported by FEDER funds and the Spanish Ministry of Economy and Competitiveness (Projects PID2019-104263RB-C44 and PDC2021– 121021-C22), the Regional Government of “Castilla y León”, Spain (Projects BU329U14 and BU071G19), the Regional Government of “Castilla y León” and FEDER funds (Projects BU062U16, COV2000375 and BU056P20).
Repositorio Institucional de la Universidad de Burgos (RIUBU)
Publication Artículo científico (JournalArticle)

A stepped tabu search method for the clique partitioning problem

  • Pacheco Bonrostro, Joaquín
  • Casado Yusta, Silvia
Given an undirected graph, a clique is a subset of vertices in which the induced subgraph is complete; that is, all pairs of vertices of this subset are adjacent. Clique problems in graphs are very important due to their numerous applications. One of these problems is the clique partitioning problem (CPP), which consists of dividing the set of vertices of a graph into the smallest number of cliques possible. The CPP is an NP-hard problem with many application fields (timetabling, manufacturing, scheduling, telecommunications, etc.). Despite its great applicability, few recent studies have focused on proposing specific resolution methods for the CPP. This article presents a resolution method that combines multistart strategies with tabu search. The most novel characteristic of our method is that it allows unfeasible solutions to be visited, which facilitates exploration of the solution space. The computational tests show that our method performs better than previous methods proposed for this problem. In fact, our method strictly improves the results of these methods in most of the instances considered while requiring less computation time., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was partially supported by FEDER funds and the Spanish State Research Agency (Projects PID2019-104263RB-C44 and PDC2021–121021-C22); the Regional Government of “Castilla y León”, Spain (Project BU071G19); the Regional Government of “Castilla y León”; and FEDER funds (Project BU056P20).