Pasar al contenido principal

OPTIMIZACION REALISTA EN PROBLEMAS DE SALUD PUBLICA

PID2021-124975OB-I00

•
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 POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación Tesis doctoral (DoctoralThesis)

Novel Realistic Approaches for Container Premarshalling

  • Jiménez Piqueras, Celia
[ES] En las últimas décadas, el rápido crecimiento del transporte de mercancía contenerizada ha planteado grandes retos a la eficiencia portuaria. La optimización de operaciones se ha vuelto crucial para minimizar los costes de puertos y navieras y reducir el impacto medioambiental. La organización y gestión del patio del puerto son esenciales para garantizar la eficiencia del puerto, ya que se utiliza para almacenar contenedores y conecta todas las zonas y actividades portuarias. Este entorno dinámico exige estrategias efectivas para colocar y retirar contenedores. Al estar apilados, retirar un contenedor puede requerir mover otros que estén encima a otras pilas, lo que ralentiza la retirada. Estos movimientos se pueden evitar ordenando los contenedores de antemano en un proceso conocido como premarshalling. El problema clásico de optimización asociado al premarshalling, que trata de encontrar el mínimo número de recolocaciones necesarias para ordenar los contenedores, se basa en varias asunciones poco realistas. Esta tesis pretende facilitar la aplicación práctica del premarshalling reformulando algunas de estas asunciones. Los contenedores del patio se organizan en grupos llamados bahías, y el problema de premarshalling se centra en organizar una bahía de contenedores cada vez. La formulación clásica solo permite recolocaciones dentro de la bahía que se está ordenando, pero esta no es una limitación real en la práctica. Proponemos una nueva versión del problema en la que los contenedores se pueden mover a una bahía adyacente para facilitar el proceso de ordenación. Otro aspecto poco realista de la formulación clásica es su objetivo. En literatura previa se muestra que minimizar el tiempo empleado por la grúa durante el premarshalling conduce a soluciones más eficientes que minimizar el número de recolocaciones. Esta tesis va más allá de la incorporación de tiempos de grúa y asume la disponibilidad limitada de la grúa. Mientras que la formulación original no proporciona una solución cuando el tiempo necesario para completar el premarshalling excede la disponibilidad de la grúa, definimos una nueva formulación que proporciona un premarshalling completo cuando el tiempo lo permite y parcial cuando no. Definir buenas ordenaciones parciales es un reto, así que exploramos tres estrategias alternativas. El estudio de estas variantes del problema requería un método de resolución simple que pudiera adaptarse fácilmente a diversas asunciones y proporcionar soluciones óptimas para la validación del problema. Para cumplir con tales requerimientos, proponemos un método de resolución que combina el uso de un solver de programación por restricciones con algoritmos sencillos y fáciles de implementar. La programación por restricciones ha recibido muy poca atención en la literatura de premarshalling, a pesar de haber demostrado un buen rendimiento resolviendo problemas combinatorios en diversos campos. Esta tesis revela la eficacia de esta técnica para el problema de premarshalling al proporcionar modelos de programación por restricciones que superan a los métodos de programación matemática de vanguardia. En líneas generales, esta tesis pretende acercar la formulación matemática del problema de premarshalling a su aplicación en el mundo real. Para ello, aborda tanto aspectos teóricos como técnicos. Desde el punto de vista teórico, introduce nuevas variantes del problema que suponen un notable avance hacia una formulación más realista. Desde el punto de vista técnico, presenta modelos de programación por restricciones que demuestran la eficacia de esta técnica sobre el problema de premarshalling., [CA] En les últimes dècades, el ràpid creixement del transport de mercaderia conteneritzada ha plantejat grans reptes a l'eficiència portuària. L'optimització d'operacions s'ha tornat crucial per a minimitzar els costos de ports i navilieres i reduir l'impacte mediambiental. L'organització i gestió del pati del port són essencials per a garantir l'eficiència del port, ja que s'utilitza per a emmagatzemar contenidors i connecta totes les zones i activitats portuàries. Aquest entorn dinàmic exigeix estratègies efectives per a col·locar i retirar contenidors. En estar apilats, retirar un contenidor pot requerir moure uns altres que estiguen damunt a altres piles, la qual cosa alenteix la retirada. Aquests moviments es poden evitar ordenant els contenidors per endavant, un procés conegut com premarshalling. El problema clàssic d'optimització associat al premarshalling, que tracta de trobar el mínim nombre de recol·locacions necessàries per a ordenar els contenidors, es basa en diverses assumpcions poc realistes. Aquesta tesi pretén facilitar l'aplicació pràctica del premarshalling reformulant algunes d'aquestes assumpcions. Els contenidors del pati s'organitzen en grups anomenats badies, i el problema de premarshalling se centra en organitzar una badia de contenidors cada vegada. La formulació clàssica només permet recol·locacions dins de la badia que s'està ordenant, però aquesta no és una limitació real en la pràctica. Proposem una nova versió del problema en la qual els contenidors es poden moure a una badia adjacent per a facilitar el procés d'ordenació. Un altre aspecte poc realista de la formulació clàssica és el seu objectiu. En literatura prèvia es mostra que minimitzar el temps emprat per la grua durant el premarshalling condueix a solucions més eficients que minimitzar el nombre de recol·locacions. Aquesta tesi va més enllà de la incorporació de temps de grua i assumeix la disponibilitat limitada de la grua. Mentres que la formulació original no proporciona una solució quan el temps necessari per a completar el premarshalling excedeix la disponibilitat de la grua, definim una nova formulació que proporciona un premarshalling complet quan el temps ho permet i parcial quan no. Definir bones ordenacions parcials és un repte, així que explorem tres estratègies alternatives. L'estudi d'aquestes variants del problema requeria un mètode de resolució simple que poguera adaptar-se fàcilment a diverses assumpcions i proporcionar solucions òptimes per a la validació del problema. Per a complir amb tals requeriments, proposem un mètode de resolució que combina l'ús d'un solver de programació per restriccions amb algorismes senzills i fàcils d'implementar. La programació per restriccions ha rebut molt poca atenció en la literatura de premarshalling, malgrat haver demostrat un bon rendiment resolent problemes combinatoris en diversos camps. Aquesta tesi revela l'eficàcia d'aquesta tècnica per al problema de premarshalling en proporcionar models de programació per restriccions que superen als mètodes de programació matemàtica d'avantguarda. En línies generals, aquesta tesi pretén acostar la formulació matemàtica del problema de premarshalling a la seua aplicació en el món real. Per a això, aborda tant aspectes teòrics com tècnics. Des del punt de vista teòric, introdueix noves variants del problema que suposen un notable avanç cap a una formulació més realista. Des del punt de vista tècnic, presenta models de programació per restriccions que demostren l'eficàcia d'aquesta tècnica sobre el problema de premarshalling., [EN] In recent decades, the rapid growth of containerized freight has posed significant challenges to port efficiency. Optimizing operations has become crucial for minimizing costs for ports and shipping companies and reducing environmental impact. The organization and management of the port yard are essential to ensure port efficiency, as it is used for container storage and connects all port areas and activities. This dynamic environment demands effective strategies for placing and retrieving containers. Since containers are stacked, retrieving one may require moving containers above it to other stacks, which slows down the retrieval. These movements can be avoided by arranging the containers beforehand through a process known as container premarshalling. The classical optimization problem associated with premarshalling, which aims to find the minimum number of relocations necessary to arrange the containers, relies on several unrealistic assumptions. This thesis aims to facilitate the practical application of premarshalling by reformulating some of these assumptions. Containers in the yard are organized into groups called bays, and the premarshalling problem focuses on arranging one bay of containers at a time. The classical formulation only allows relocations within the bay being arranged, but this is not a real limitation in practice. We propose a novel version of the problem where containers can be moved to an adjacent bay to facilitate the arrangement process. Another unrealistic aspect of the classical formulation is its objective. Previous literature shows that minimizing the total crane time during premarshalling leads to more efficient solutions than minimizing the number of relocations. This thesis goes beyond incorporating crane times and acknowledges limited crane availability. While the original formulation fails to provide a solution when the required time for completing the arrangement exceeds crane availability, we define a novel formulation that yields a complete premarshalling when time allows and a partial arrangement when it does not. Defining good-quality partial arrangements is challenging, and we explore three alternative strategies. Studying these problem variants required a simple solution method that could be easily adapted to varying assumptions and provide optimal solutions for problem validation. To meet these requirements, we propose a solution method that combines the use of a constraint programming solver with simple algorithms that are easy to implement. Constraint programming has received very little attention in the premarshalling literature despite showing strong performance in solving combinatorial problems in various fields. This thesis reveals the effectiveness of this technique for the premarshalling problem by providing constraint programming models that outperform the state-of-the-art mathematical programming approaches. Overall, this thesis aims to bridge the gap between the mathematical formulation of the premarshalling problem and real-world application. To achieve this, it addresses both theoretical and technical aspects. On the theoretical side, it introduces several novel variants of the problem that represent significant progress toward a more realistic formulation. On the technical side, it presents constraint programming solution methods that demonstrate the efficiency of this technique in addressing the premarshalling problem., This study has been partially supported by the Spanish Ministry of Science and Innovation under predoctoral grant PRE2019-087706, the project “OPTEP-Port Terminal Operations Optimization” (RTI2018-094940-B-I00), and PID2021-124975OB-I00, financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
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 Tesis doctoral (DoctoralThesis)

Algoritmos heurísticos para problemas reales de reubicación dinámica de vehículos de emergencias sanitarias

  • Karpova-Krylova, Yulia|||0000-0002-0512-9562
[ES] La reubicación dinámica de ambulancias es un área de estudio que permite mover los vehículos a lugares de espera diferentes a sus bases habituales cuando el número de vehículos disponibles cambia (disminuye cuando las ambulancias se asignan a las emergencias y aumenta cuando finalizan los servicios). La reubicación dinámica de ambulancias se puede considerar como una alternativa al incremento de la flota para mantener el nivel de servicio adecuado cuando las condiciones del sistema cambian. A lo largo de los últimos treinta años la comunidad científica ha desarrollado una gran cantidad de estrategias de reubicación, pero pocas de estas estrategias han sido implementadas en un Servicio de Emergencias Sanitarias (SES) real. En esta Tesis Doctoral se desarrollan varias estrategias de reubicación dinámica de ambulancias con el objetivo de efectuar menores cambios en el proceso organizativo de un SES real e incluir mayor número de aspectos realistas tanto en los algoritmos de reubicación, como en el proceso de evaluación de su rendimiento. El problema se aborda desde un enfoque mixto, que integra las técnicas de Investigación Operativa con las herramientas de Sistemas de Información Geográfica. La evaluación de las estrategias se realiza con un caso real, del área de Valencia (España). Los resultados muestran que la reubicación permite aumentar el número de llamadas atendidas dentro de 10 minutos, disminuir el tiempo de respuesta y favorecer a la equidad en la carga de trabajo de diferentes equipos. Siendo una importante herramienta para mantener el nivel de cobertura, la reubicación de ambulancias se tiene que realizar con sumo cuidado, dado que no en todos los períodos del día sus ventajas superan los costes implícitos., [CA] La reubicació dinàmica d'ambulàncies és una àrea d'estudi que permet moure els vehicles a llocs d'espera diferents a les seues bases habituals quan el nombre de vehicles disponibles canvia (disminuïx quan les ambulàncies s'assignen a les emergències i augmenta quan finalitzen els servicis). La reubicació dinàmica d'ambulàncies es pot considerar com una alternativa a l'increment de la flota per a mantindre el nivell de servici adequat quan les condicions del sistema canvien. Al llarg dels últim trenta anys la comunitat científica ha desenrotllat una gran quantitat d'estratègies de reubicació, però poques d'estes estratègies han sigut implementades en un Servici d'Emergències Sanitàries (SES) real. En esta Tesi Doctoral es desenrotllen diverses estratègies de reubicació dinàmica d'ambulàncies amb l'objectiu d'efectuar menors canvis en el procés organitzatiu d'un SES real i incloure major nombre d'aspectes realistes tant en els algorismes de reubicació, com en el procés d'avaluació del seu rendiment. El problema s'aborda des d'un enfocament mixt, que integra les tècniques d'Investigació Operativa amb les ferramentes de Sistemes d'Informació Geogràfica. L'avaluació de les estratègies es realitza amb un cas real, de l'àrea de València (Espanya). Els resultats mostren que la reubicació permet augmentar el nombre de trucades ateses dins de 10 minuts, disminuir el temps de resposta i afavorir a l'equitat en la càrrega de treball de diferents equips. Sent una important ferramenta per a mantindre el nivell de cobertura, la reubicació d'ambulàncies s'ha de realitzar amb summa cura, atés que no en tots els períodes del dia els seus avantatges superen els costos implícits., [EN] Dynamic ambulance relocation involves moving vehicles to alternative holding locations as the number of available ambulances varies-decreasing when they are dispatched to emergencies and increasing when they return. This method serves as an alternative to fleet augmentation to maintain or enhance service levels amid changing system conditions. Despite extensive research over the past thirty years, few relocation strategies have been implemented in real Emergency Medical Services (EMS). In this Doctoral Thesis, new strategies are developed to minimally disrupt existing EMS processes while incorporating more realistic aspects in both relocation algorithms and performance evaluations. This study uses a mixed approach, integrating Operations Research techniques with Geographic Information Systems, and evaluates strategies using case studies from Valencia, Spain. Results indicate that relocation increases the number of calls responded to within 10 minutes, reduces response time, and fosters equal workload distribution among teams. However, while relocation is crucial for maintaining coverage, its implementation should be carefully managed, as its benefits may not always justify the incurred costs., Esta Tesis Doctoral se ha desarrollado en el marco de cuatro proyectos de investigación: 1) Innovación en Reubicación de Vehículos de Emergencias Sanitarias: Una Herramienta Inteligente de Decisión (INNACC/2021/26), dirigido por Mª Fulgencia Villa Juliá (I.P.), con la participación de Yulia Karpova-Krylova, Juan Miguel Alberola Oltra, Rubén Ruiz García, Andrea Conchado Peiró, Eva Vallada Regalado, Miguel Ángel Vecina-García, entre otros, financiado por la Agencia Valenciana de la Innovación y desarrollado entre el 05/04/2022 y el 29/09/2023; 2) Optimización Realista en Problemas de Salud Pública (PID2021-124975OB-I00), dirigido por Eva Vallada Regalado (I.P.), con la colaboración de Yulia Karpova-Krylova, Iván Giménez-Palacios, Mª Fulgencia Villa Juliá, Rubén Ruiz García, Andrea Conchado Peiró, Víctor Sánchez-Anguix y otros investigadores, financiado por la Agencia Estatal de Investigación y desarrollado entre el 24/10/2022 y el 31/05/2023; 3) Técnicas heurísticas para el problema de reubicación dinámica de vehículos de emergencias sanitarias (PAID-01-21), dirigido por Mª Fulgencia Villa Juliá (I.P.) y Yulia Karpova-Krylova, con financiación de recursos humanos de la Universitat Politècnica de València, vigente del 01/06/2022 al 31/05/2025; y 4) Hireves: Herramienta Interactiva de Relocalización de Vehículos de Emergencias Sanitarias (INNVA1/2024/91), coordinado por Mª Fulgencia Villa Juliá (I.P.), con la participación de Yulia Karpova-Krylova, Juan Miguel Alberola Oltra, Andrea Conchado Peiró, Eva Vallada Regalado, Víctor Sánchez-Anguix y la Universitat Politècnica de València, financiado por la Agencia Valenciana de la Innovación y en desarrollo entre el 01/01/2024 y el 31/12/2026.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación 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
Publicación 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.