Skip to main content

OPTIMIZACION REALISTA EN PROBLEMAS DE SALUD PUBLICA

PID2021-124975OB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2021
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Solving the yard crane scheduling problem with dynamic assignment of input/output points

  • Wang, Hongtao
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] This paper introduces an automatic yard crane scheduling problem with additional assignments of input/output (I/O) points at the block. I/O points are the buffer between the block and the rest of the terminal and containers are relocated from the block to the I/O points or vice-versa. The crane schedule therefore not only considers movements, storage and retrieval of containers, but must also be coordinated with the release and due times of containers at the I/O points, which are also limited and need to be assigned during the scheduling process. This results in a complex, but at the same time, more realistic problem. Two GRASP (Greedy Randomized Adaptive Search Procedure) heuristic approaches are proposed along with improvements to the solution construction and local search phases that are specifically tailored for this problem. The proposed algorithms are statistically calibrated and comprehensive experiments are designed to assess the performance of the method, including validation across small, medium, and large size instances. The experimental results show that the proposed methods are effective and competitive when compared to existing approaches. The GRASP manages to obtain an optimality average rate of 71.25% for small instances and finds 461 new best solutions in the 480 medium and large instances, with up to 200 containers, when compared to existing approaches for this problem., The authors would like to express their most sincere gratitude to the anonymous referees and their insightful comments which have resulted in a much stronger manuscript. Hongtao Wang is sponsored by the Chinese Scholarship Council (No. 202006890026) . The authors are partially supported by the Spanish Ministry of Science and Innovation under the project "OPRES-Realistic Optimization in Problems in Public Health" (No. PID2021-124975OB-I00) partially financed with FEDER funds and by the Agencia Valenciana de la Innovacio (AVI) under the project "ireves (innovacion en vehiculos de emergencia sanitaria): una herramienta inteligente de decision" (No. INNACC/2021/26, interested readers can visit http://ireves.upv.es) .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A crossover operator for objective functions defined over graph neighborhoods with interdependent and related variables

  • Jordán, Jaume|||0000-0003-0400-9136
  • Palanca Cámara, Javier|||0000-0002-6209-9603
  • Sanchez-Anguix, Víctor|||0000-0003-4851-0037
  • Julian, Vicente|||0000-0002-2743-6037
[EN] This article presents a new crossover operator for problems with an underlying graph structure where edges point to prospective interdependence relationships between decision variables and neighborhoods shape the definition of the global objective function via a sum of different expressions, one for each neighborhood. The main goal of this work is to propose a crossover operator that is broadly applicable, adaptable, and effective across a wide range of problem settings characterized by objective functions that are expressed in terms of graph neighbourhoods with interdependent and related variables. Extensive experimentation has been conducted to compare and evaluate the proposed crossover operator with both classic and specialized crossover operators. More specifically, the crossover operators have been tested under a variety of graph types, which model how variables are involved in interdependencies, different types of expressions in which interdependent variables are combined, and different numbers of decision variables. The results suggest that the new crossover operator is statistically better or at least as good as the best-performing crossover in 75% of the families of problems tested., This work is partially funded by the Spanish Ministry of Science and Innovation under the project PID2021-123673OBC31 and PID2021-124975OB-I00, project TED2021-131295B-C32 from the State Research Agency, and DIGITAL2022 CLOUDAI02/ S8760000 from the European Commission. Jaume Jordán is supported by the IJC2020-045683-I grant funded by MCIN/AEI/10.13039/5011 00011033 and by European Union NextGenerationEU/PRTR . Additional support is provided by project INNVA1/2024/91 funded by Agencia Valenciana de la Innovación.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Models and algorithms for a yard crane scheduling problem in container ports

  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Belenguer, Jose Manuel
  • Alvarez-Valdes, Ramon
[EN] This paper addresses the scheduling of a yard crane in an automated container block, considering its rela-tionships with the other terminal subsystems. Containers coming into the block to be stored have release times, indicating the moment at which they arrive from ships or trucks. Containers being retrieved have due times, indicating when they will be required by other subsystems. The problem can be seen as a pickup routing problem and also as a one-machine scheduling problem. As a starting point, integer linear models were developed for both approaches. Then, to obtain good solutions for large instances, several heuristic algorithms, coupled with a local search, were proposed. An extensive computational study, based on a newly generated benchmark, shows the limits of the exact methods and the quality of the solutions obtained by the heuristics., The authors are partially supported by the Spanish Ministry of Science and Innovation under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00), partially financed with FEDER funds, by the Spanish Ministry of Science and Innovation under the project "OPRES-Realistic Optimization in Problems in Public Healt"(No. PID2021-124975OB-I00), partially financed with FEDER funds and by the Agencia Valenciana de la Innovacio (AVI) under the project "ireves (innovacion en vehiculos de emergencia sanitaria): una herramienta inteligente de decision" (No. INNACC/2021/26) partially financed with FEDER funds (interested readers can visit http://ireves.upv.es). Some of the authors are supported by the Faculty of Business Administration and Man-agement at the Universitat Politecnica de Valencia. Special thanks are due to Gerardo Gabriel Minella from Instituto Tecnologico de Informatica.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Flowshop with additional resources during setups: Mathematical models and a GRASP algorithm

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop scheduling problems happen when a number of jobs have to be sequentially processed by a number of machines. This paper addressees, for the first time, the Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S). In this problem, in addition to the standard permutation flowshop constraints, each machine requires a setup between the processing of two consecutive jobs. A number of additional and scarce resources, e.g. operators, are needed to carry out each setup. Two Mixed Integer Linear Programming formulations and an exact algorithm are proposed to solve the PFSR-S. Due to its complexity, these approaches can only solve instances of small size to optimality. Therefore, a GRASP metaheuristic is also proposed which provides solutions for much larger instances. All the methods designed for the PFSR-S in this paper are computationally tested over a benchmark of instances adapted from the literature. The results obtained show that the GRASP metaheuristic finds good quality solutions in short computational times., Juan C. Yepes-Borrero acknowledges financial support by Colfuturo under program Credito-Beca grant number 201503877 and from ElInstituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX under program Pasaporte a la ciencia - Doctor-ado, Foco-reto pais 4.2.3, grant number 3568118. This research hasbeen partially supported by the Agencia Estatal de Investigacion (AEI)and the European Regional Development's fund (ERDF): PID2020-114594GB-C21; Regional Government of Andalusia: projects FEDER-US-1256951, AT 21_00032, and P18-FR-1422; Fundacion BBVA: project Netmeet Data (Ayudas Fundacion BBVA a equipos de investigacioncientifica 2019). The authors are partially supported by Agencia Valenciana de la Innovacion (AVI) under the project ireves (innovacionen vehiculos de emergencia sanitaria): una herramienta inteligente dedecision'' (No. INNACC/2021/26) partially financed with FEDER funds(interested readers can visit http://ireves.upv.es), and by the Spanish Ministry of Science and Innovation under the project OPRES-RealisticOptimization in Problems in Public Health'' (No. PID2021-124975OB-I00), partially financed with FEDER funds. Part of the authors aresupported by the Faculty of Business Administration and Managementat Universitat Politecnica de Valencia
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An evolutionary metaheuristic for forming teams in the classroom with constraints

  • Candel, Gonzalo
  • Sanchez-Anguix, Víctor|||0000-0003-4851-0037
  • Alberola Oltra, Juan Miguel|||0000-0002-5486-5638
  • Julian, Vicente|||0000-0002-2743-6037
  • Botti V.|||0000-0002-6507-2756
[EN] Team formation is essential for developing teamwork-related skills in educational settings. The problem of team formation in the classroom consists of partitioning a classroom into non-overlapping teams of students, including every single student. Several algorithms have been proposed to automate the formation of teams, each employing different criteria for guiding the team formation process. Traditionally, metaheuristics have been a common approach due to the combinatorial complexity of the problem. This paper introduces a novel and general evolutionary algorithm for team formation in the classroom guided by mutation, the general concept of synergy between team members, and local search. Our algorithm allows for flexible team size constraints and the inclusion of compulsory and forbidden student combinations, which are not considered in existing methods but are important for capturing human relationships in the classroom. In addition, our algorithm is independent of the specific objective function employed to evaluate the teams formed. We present experiments comparing our proposal with other state-of-the-art algorithms, demonstrating robust performance across different objective functions employed in the team formation literature, superior scalability as the problem size increases, and remarkable performance in settings with or without the aforementioned constraints., This work was partially supported by MINECO/FEDER RTI2018-095390-B-C31 project of the Spanish government, project TED2021-131295B-C32 from the State Research Agency, and DIGITAL2022 CLOUDAI02/S8760000 from the European Commission, . Some of the authors are partially supported by the Spanish Ministry of Science and Innovation under the project PID2021-123673OB-C31 COSASS and project OPRES-Realistic Optimization in Problems in Public Health (No. PID2021-124975OB-I00), partially financed with FEDER funds. Additional support is provided by project INNVA1/2024/91 funded by Agencia Valenciana de la Innovación.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Modeling the process of responding to health emergencies: Main aspects and problems related to evaluating ambulance relocation strategies

  • Karpova-Krylova, Yulia|||0000-0002-0512-9562
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] Ambulance relocation is a field of study focused on the repositioning of available ambulances in response to changing conditions to maintain or improve service levels. The scientific community has proposed numerous relocation strategies, often evaluated in environments that simulate the healthcare emergency response process. In order to properly model this process, it is essential to identify the relevant information. Despite efforts to improve realism, many approximations still hinder the accuracy of the results. This article analyzes the information about different ways of determining several aspects of the emergency response process. Furthermore, the importance of incorporating realistic aspects when modeling the emergency response process is shown and the instances generated for the case of Valencia (Spain) are offered based on these aspects., The authors are supported by Instituto Valenciano de Competitividad e Innovacion (IVACE I + i) Spain under the project "Hireves: Herramienta Interactiva de Relocalizacion de Vehiculos de Emergencias Sanitarias" (No. INNVA1/2024/91). Also the authors are supported by the Spanish Ministry of Science and Innovation under the project "OPRES-Realistic Optimization in Problems in Public Health" (No. PID2021-124975OB-I00). Both projects has been partially financed with FEDER, Spain funds. Yulia Karpova is supported under the project "Programa de Ayudas de Investigacion y Desarrollo (PAID-01-21) de la Universitat Politecnica de Valencia". Special thanks to Servicio de Atencion Sanitaria a Urgencias y Emergencias (SASUE) and to Servicios de Emergencias Sanitarias (SES) of the Comunitat Valenciana, and Department of Coordination of Medical Transport for the information and data provided.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Heuristic algorithms based on the isochron analysis for dynamic relocation of medical emergency vehicles

  • Karpova-Krylova, Yulia|||0000-0002-0512-9562
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Vecina, Miguel Ángel
[EN] Among the wide range of medical services, prehospital health care is one of the most relevant, as it usually involves an emergency situation. The qualified medical team is dispatched to the scene of the incident as soon as possible. One of the most influential factors in response time depends on where the ambulances are stationed, however, when a medical vehicle is attending an emergency, it becomes unavailable for other calls. Increasing the ambulance fleet is a costly option that does not guarantee efficiency. An alternative solution is the relocation of available ambulances to increase the population covered by them. Obtaining the optimal solution in real time is not feasible for this problem. Therefore, this work addresses the problem of dynamic relocation of ambulances through the design and development of heuristic tools. The isochron overlap analysis defines possible scenarios that may occur when ambulances become unavailable for emergencies and determines the appropriate conditions to carry out the relocation of ambulances. Computational experiments are run using a benchmark of instances based on the characteristics of a real Emergency Medical Service. Based on the results of the study, we can conclude that the designed relocation algorithms perform better than if there was no relocation strategy., The authors are supported by Agència Valenciana de la Innovació (AVI), Spain under the project ireves (innovación en vehículos de emergencia sanitaria): una herramienta inteligente de decisión (No. INNACC/2021/26). This project has been partially financed with FEDER, Spain funds. Interested readers can visit http://ireves.upv.es. The authors are supported by the Spanish Ministry of Science and Innovation under the project ``OPRES-Realistic Optimization in Problems in Public Health¿¿(No. PID2021-124975OB-I00), partially financed with FEDER funds. Part of the authors are supported by the Faculty of Business Administration and Management at Universitat Politècnica de València, Spain and Yulia Karpova is supported under the project Programa de Ayudas de Investigación y Desarrollo (PAID-01-21) de la Universitat Politècnica de València. Special thanks to Servicio de Atención Sanitaria a Urgencias Emergencias (SASUE) and to Servicios de Emergencias Sanitarias (SES) of the Comunitat Valenciana, and Department of Coordination of Medical Transport for the information and data provided. All authors have contributed to all sections and tasks performed in this article.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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
Publication Artículo científico (JournalArticle)

Realistic strategies for dynamic ambulance relocation

  • Karpova-Krylova, Yulia|||0000-0002-0512-9562
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] The location of vehicles is a decision of significant importance for Emergency Medical Services. However, the delivery of emergency care is dynamic in nature and the initial locations of ambulances may quickly prove inadequate for maintaining coverage as they are dispatched to attend to patients. Rather than increasing the size of the fleet of vehicles, research has focused on the dynamic relocation of ambulances. This approach allows available vehicles to move to sites beyond their usual bases, maintaining an appropriate level of service. The scientific community has proposed a wide variety of ambulance relocation strategies using different methodological approaches. However, most of the strategies have not been implemented by real life Emergency Medical Services. This study proposes a scenario-based dynamic relocation algorithm that incorporates the following realistic aspects: it allows ambulances to start and end their work shift at their usual base, regardless of the number of relocations performed; a methodology based on Geographic Information Systems is developed to determine the positions of ambulances en route in order to be able to assign these ambulances to emergencies. In addition, the importance of relocating ambulances at different times of the day is studied. The proposed algorithm is validated by applying it to a real life case, in the city of Valencia, Spain, where the importance of considering these realistic aspects is shown., The authors are supported by Instituto Valenciano de Competitividad e Innovacion (IVACE I+i) , Spain under the project "Hireves: Herramienta Interactiva de Relocalizacion de Vehiculos de Emergencias Sanitaria" (No.INNVA1/2024/91) . Also the authors are supported by the Spanish Ministry of Science and Innovation, Spain under the project "OPRES-Realistic Optimization in Problems in Public Health" (No. PID2021-124975OB-I00) . Both projects has been partially financed with FEDER, Spain funds. Yulia Karpova is supported under the project "Programa de Ayudas de Investigacion y Desarrollo (PAID-01-21) de la Universitat Politecnica de Valencia, Spain". Special thanks to Servicio de Atencion Sanitaria a Urgencias y Emergencias (SASUE) and to Servicios de Emergencias Sanitarias (SES) of the Comunitat Valenciana, and Department of Coordination of Medical Transport for the information and data provided.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Iterated greedy for the yard crane scheduling problem with input/output assignment

  • Wang, Hongtao
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] The yard crane scheduling problem (YCSP) consists of optimizing container loading for storage and retrieval requests from yard cranes at port terminals. This paper studies a realistic generalization of the YCSP that incorporates the assignments of input/output (I/O) points during the optimization stage. I/O points serve as buffers between the different transportation modes in the port terminal. These are limited in number and unproductive idle times might result if a container schedule exhausts I/O point availability. The resulting problem entails not only scheduling container storage and retrieval requests, but also the assignment of the I/O points. We introduce a series of simple, yet powerful, Iterated Greedy (IG) methods. These include variations of the destruction and reconstruction operators, coordination with novel local search procedures and problem-specific knowledge speed-ups. The proposed IG methods are carefully calibrated and evaluated using comprehensive computational experiments. The results indicate that small changes in the features of the algorithm have a profound impact on performance. Comparisons against the state-of-the-art approaches for this particular problem result in a strong, and statistically significant performance advantage for the proposed IG procedures., The authors are partially sponsored by the Spanish Ministry of Science and Innovation under the project OPRES-Realistic Optimization in Problems in Public Health (No. PID2021-124975OB-I00) partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Enhancing management efficiency in emergency vehicles logistic using realistic data from Geographic Information System

  • Vecina, Miguel Ángel
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Karpova-Krylova, Yulia|||0000-0002-0512-9562
[EN] The rapid intervention of Emergency Medical Vehicles is crucial for public health. The Ambulance Location Problem involves determining optimal placements of these vehicles to maximize service coverage and response efficiency. This study introduces a hybrid methodology that integrates Geographic Information Systems with optimization techniques, specifically a Batch Mixed Integer Linear Programming model and a Greedy heuristic. By combining spatial and temporal analysis through isochrones ¿ an approach rarely utilized in current literature ¿ with optimization models, the methodology effectively minimizes uncovered population while accounting for spatial variability. This approach is applied to a real-life case in the province of Valencia, Spain. The study presents a comprehensive graphical tool for visualizing the impact of demographic and geographic factors, enabling more informed decision-making. Results demonstrate significant improvements in coverage compared to the existing allocation, highlighting the effectiveness of integrating Geographic Information Systems with optimization algorithms. This research advances the state of the art in ambulance location by offering a more realistic and flexible approach that bridges the gap between spatial analysis and decision-making in emergency services., The authors are supported by Instituto Valenciano de Competitividad e Innovación (IVACE+i) , partially financed with FEDER funds, under the project Hireves: herramienta interactiva de relocalización para vehículos de emergencias sanitarias (No. INNVA1/2024/91). Additional support comes from the Spanish Ministry of Science and Innovation for the project OPRES-Realistic Optimization in Problems in Public Health (No. PID2021-124975OB-I00), partially financed with FEDER funds. Part of the research team is backed by the Faculty of Business Administration and Management at Universitat Politècnica de València. Yulia Karpova s work is under the project Programa de Ayudas de Investigación y Desarrollo (PAID-01-21) from the same university. Special thanks are extended to Servicio de Atención Sanitaria a Urgencias y Emergencias (SASUE) and to Servicios de Emergencias Sanitarias (SES) of the Comunitat Valenciana, along with the Department of Coordination of Medical Transport, for providing valuable information and data.