Pasar al contenido principal

INVESTIGACION OPERATIVA PARA PROBLEMAS DE OPTIMIZACION DE LA CADENA DE SUMINISTRO

PID2021-125709OB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT DE VALÈNCIA

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Forward-Backward Simheuristic for the Stochastic Capacitated Dispersion Problem

  • Gómez González, Juan Francisco|||0000-0001-7692-9922
  • Martínez-Gavara, Anna|||0000-0001-9995-010X
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A|||0000-0003-1392-1776
  • Martí, Rafael|||0000-0001-7265-823X
In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward-backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The stochastic maximum diversity problem

  • Martinez-Gavara, Anna
  • Keenan, Peter
  • Pariente, Antonio
  • Marti, Rafael
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The Maximum Diversity Problem (MDP) is a well-known combinatorial optimisation model with applications ranging from facility location to social network analysis. This paper introduces a stochastic extension, the Stochastic Maximum Diversity Problem (SMDP), to better model applications based on attributes that may change, such as the travel time in location or routeing problems and affinity or preferences in social networks. The mathematical programming literature widely recognises that using stochastic data introduces an additional layer of difficulty to optimisation problems and therefore makes them more difficult to solve. The MDP is an NP-hard problem; consequently, the stochastic maximum diversity problem (SMDP) considered in this paper is difficult to solve. This paper proposes an extension to the scatter search (SS) method, the Stochastic SS, which integrates SS with simulation to solve the SMDP efficiently. Specifically, a Simheuristic SS algorithm is considered. It is based on customised search strategies to explore the solution space efficiently. The proposed approach is validated by an extensive comparison with alternative reference methods, and the results show the superior performance of the proposed method for stochastic problems., This work was supported by the Spanish Ministry of Science, Innovation and Universities (ERDF) (PID2024-160226OB-C21, PID2022-138860NB-I00, AIA2025-163553-C44, PID2021-125709OB-C21) and the Generalitat Valenciana (2021 CIAICO 224, 2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The container premarshalling problem under limited crane time: A constraint programming approach

  • Jiménez-Piqueras, Celia
  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramon
  • Ruiz García, Rubén
[EN] This study addresses the premarshalling problem when the crane time is limited and a complete rearrangement of the bay is not possible. This issue has been neglected in the literature, but it is very common in practice. We show that the use of standard approaches often fails to yield good solutions and develop a model for the problem in two steps. First, a constraint programming model is proposed for premarshalling with crane time minimization objective. Then, this model is adapted to the new problem. An extensive computational study shows that the first model improves on the performance of the existing state-of-the-art integer programming model and that the model of the new problem obtains high quality solutions even in short running times., This work was supported by the Spanish Ministry of Science and Innovation under predoctoral grant PRE2019-087706, under project "OPRES-Realistic Optimization in Problems in Public Health" (PID2 021-124975OB-I00) , and under project "Operations Research for Supply Chain Optimization Problems" (PID2021-125709OB-C21) , partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Forward-Backward Simheuristic for the Stochastic Capacitated Dispersion Problem

  • Gómez, Juan F.
  • Martínez-Gavara, Anna
  • Panadero, Javier
  • Martí, Rafael
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward¿backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution., This work has been partially funded by the European Commission via projects UP2030 (HORIZON-MISS- 2021-CIT-02-01-101096405) and SUN (HORIZON-CL4- 2022-HUMAN-01-14- 101092612), as well as by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T). The authors have been also supported by grant PID2021-125709OB-C21 funded by MCIN/AEI/ 10.13039/501100011033 and by ERDF A way of making Europe. They also received financial support from the Generalitat Valenciana (code CIAICO/2021/224).