Pasar al contenido principal

OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS

RTI2018-094940-B-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2018
Plan Estatal 2017-2020 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): 24
Encontrada(s) 1 página(s)

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

Simulation-Based Analysis on Operational Control of Batch Processors in Wafer Fabrication

  • Koo, Pyung-Hoi
  • Ruiz García, Rubén
[EN] In semiconductor wafer fabrication (wafer fab), wafers go through hundreds of process steps on a variety of processing machines for electrical circuit building operations. One of the special features in the wafer fabs is that there exist batch processors (BPs) where several wafer lots are processed at the same time as a batch. The batch processors have a significant influence on system performance because the repetitive batching and de-batching activities in a reentrant product flow system lead to non-smooth product flows with high variability. Existing research on the BP control problems has mostly focused on the local performance, such as waiting time at the BP stations. This paper attempts to examine how much BP control policies affect the system-wide behavior of the wafer fabs. A simulation model is constructed with which experiments are performed to analyze the performance of BP control rules under various production environments. Some meaningful insights on BP control decisions are identified through simulation results., This work was supported by the Pukyong National University Research Abroad Fund (C-D-2016-0843).
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)

Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Fanjul-Peyro, Luis
[EN] A Scatter Search algorithm together with an enriched Scatter Search and an enriched Iterated Greedy for the unrelated parallel machine problem with one additional resource are proposed in this paper. The optimisation objective is to minimise the maximum completion of the jobs on the machines, that is, the makespan. All the proposed methods start from the best known heuristic for the same problem. Non feasible solutions are allowed in all the methods and a Repairing Mechanism is applied to obtain a feasible solution from a resource constraint point of view. All the proposed algorithms apply different local search procedures based on insertion, swap and restricted neighbourhoods. Computational experiments are carried out using an exhaustive benchmark of instances. After analysing the results, we can conclude that the enriched methods obtain superior results, outperforming the best known solutions for the same problem., The authors are supported by the Spanish Ministry of Economy and Competitiveness, under the projects "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI201565895-R) and "OPTEMAC -Optimizacion de Procesos en Terminales Maritimas de Contenedores" (No. DPI2014-53665-P), all of them partially financed with FEDER funds. The authors are also partially supported by the EU Horizon 2020 research and innovation programme under grant agreement no. 731932 "Transforming Transport: Big Data Value in Mobility and Logistics". Interested readers can download contents from http://soa.iti.es, like the instances used and a software for generating further instances. Source codes are available upon justified request from the authors.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Multi-Queue Request Scheduling for Profit Maximization in IaaS Clouds

  • Wang, Shuang
  • Li, Xiaoping
  • Sheng, Quan Z.
  • Ruiz García, Rubén
  • Zhang, Jinquan
  • Beheshti, Amin
[EN] In cloud computing, service providers rent heterogeneous servers from cloud providers, i.e., Infrastructure as a Service (IaaS), to meet requests of consumers. The heterogeneity of servers and impatience of consumers pose great challenges to service providers for profit maximization. In this article, we transform this problem into a multi-queue model where the optimal expected response time of each queue is theoretically analyzed. A multi-queue request scheduling algorithm framework is proposed to maximize the total profit of service providers, which consists of three components: request stream splitting, requests allocation, and server assignment. A request stream splitting algorithm is designed to split the arriving requests to minimize the response time in the multi-queue system. An allocation algorithm, which adopts a one-step improvement strategy, is developed to further optimize the response time of the requests. Furthermore, an algorithm is developed to determine the appropriate number of required servers of each queue. After statistically calibrating parameters and algorithm components over a comprehensive set of random instances, the proposed algorithms are compared with the state-of-the-art over both simulated and real-world instances. The results indicate that the proposed multi-queue request scheduling algorithm outperforms the other algorithms with acceptable computational time., This work was supported in part by the National Key Research and Development Program of China under Grant 2017YFB1400800, in part by the National Natural Science Foundation of China under Grants 61872077 and 61832004, and in part by the Collaborative InnovationCenter of Wireless Communications Technology. The work of Quan Z. Sheng was supported in part by Australian Research Council Future Fellowship under Grant FT140101247 and in part by Discovery Project under Grant DP180102378. The work of Ruben Ruiz was supported in part by the Spanish Ministry of Science, Innovation, and Universities through the project OPTEP-Port Terminal Operations Optimization under Grant RTI2018-094940-B-I00 financed with FEDER funds
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems

  • Alfaro-Fernandez, Pedro
  • Ruiz García, Rubén
  • Pagnozzi, Federico
  • Stützle, Thomas
[EN] Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are ATP-hard. As a result, researchers resort to metaheuristics to obtain effective and efficient solutions. The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems and objectives. In this paper, we use an Automatic Algorithm Design (AAD) methodology to eliminate these limitations. AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed MD for three different optimization objectives in the hybrid flowshop. Comprehensive computational and statistical testing demonstrates that automatically designed algorithms outperform specifically tailored state-of-the-art methods for the tested objectives in most cases., Pedro Alfaro-Fernandez and Ruben Ruiz are partially supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER funds and under grants BES-2013-064858 and EEBB-I-15-10089. This work was supported by the COMEX project (P7/36) within the Interuniversity Attraction Poles Programme of the Belgian Science Policy Office. Thomas Stiitzle acknowledges support from the Belgian F.R.S.-FNRS, of which he is a Research Director.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Weighted General Group Lasso for Gene Selection in Cancer Classification

  • Wang, Yadi
  • Li, Xiaoping
  • Ruiz García, Rubén
[EN] Relevant gene selection is crucial for analyzing cancer gene expression datasets including two types of tumors in cancer classification. Intrinsic interactions among selected genes cannot be fully identified by most existing gene selection methods. In this paper, we propose a weighted general group lasso (WGGL) model to select cancer genes in groups. A gene grouping heuristic method is presented based on weighted gene co-expression network analysis. To determine the importance of genes and groups, a method for calculating gene and group weights is presented in terms of joint mutual information. To implement the complex calculation process of WGGL, a gene selection algorithm is developed. Experimental results on both random and three cancer gene expression datasets demonstrate that the proposed model achieves better classification performance than two existing state-of-the-art gene selection methods., This work was supported in part by the National Natural Science Foundation of China under Grant 61572127, in part by the National Key Research and Development Program of China under Grant 2017YFB1400801, in part by the Key Research and Development Program in Jiangsu Province under Grant BE2015728, and in part by the Collaborative Innovation Center of Wireless Communications Technology. The work of R. Ruiz was supported by the Spanish Ministry of Economy and Competitiveness through the Project "SCHEYARD-Optimization of Scheduling Problems in Container Yards" partly financed with FEDER funds under Grant DPI2015-65895-R. This paper was recommended by Associate Editor S. Yang.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Benders decomposition for the mixed no-idle permutation flowshop scheduling problem

  • Bektas, Tolga
  • Hamzadayi, Alper
  • Ruiz García, Rubén
[EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition with a simple yet effective enhancement mechanism that entails the generation of additional cuts by using a referenced local search to help speed up convergence. Using only a single additional optimality cut at each iteration, and combined with combinatorial cuts, the algorithm can optimally solve instances with up to 500 jobs and 15 machines that are otherwise not within the reach of off-the-shelf optimization software, and can easily surpass ad-hoc existing metaheuristics. To the best of the authors' knowledge, the algorithm described here is the only exact method for solving the mixed no-idle permutation flowshop scheduling problem., This research project was partially supported by the Scientific and Technological Research Council of Turkey (TuBITAK) under Grant 1059B191600107. While writing this paper, Dr Hamzaday was a visiting researcher at the Southampton Business School at the University of Southampton. Ruben Ruiz is supported by the Spanish Ministry of Science, Innovation and Universities, under the Project 'OPTEP-Port Terminal Operations Optimization' (No. RTI2018-094940-B-I00) financed with FEDER funds. Thanks are due to two anonymous reviewers for their careful reading of the paper and helpful suggestions.
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)

Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm

  • Perea Rojas Marcos, Federico
  • Menezes, Mozart B. C.
  • Mesa, Juan A.
  • Rubio-Del-Rey, Fernando
[EN] In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced in the literature. All problems studied have a common objective: the maximization of the number of travelers using the new network to be built. The differences between them are due to two factors. The first one is the constraints that the new network should satisfy: (1) budget constraint, (2) no-cycle constraint, (3) both constraints. The second factor is the topology of the network formed by the feasible links and stations: (1) a general network, (2) a forest. By combining these two factors, in total we analyze six problems, five of them are shown to be NP-hard, the sixth being trivial. Due to the NP-hardness of these problems, a genetic algorithm is proposed. Computational experiments show the applicability of this algorithm., Mozart Menezes and Juan A. Mesa were partially supported by project MTM2015- 67706-P (MINECO/FEDER,UE). Federico Perea was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under projects "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) and MTM2016-74983, fnanced with FEDER funds, and by the Universitat Politècnica de València under grant SP20180164 of the program Primeros Proyectos de Investigaciòn (PAID-06-18), Vicerrectorado de Investigaciòn, Innovaciòn y Transferencia. All this support is gratefully acknowledged.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

OR Models in Urban Service Facility Location: A Critical Review of Applications and Future Developments

  • Farahani, Reza Zanjirani
  • Fallah, Samira
  • Ruiz García, Rubén
  • Hosseini, Sara
  • Asgari, Nasrin
[EN] Facility location models are well established in various application areas with more than a century of history in academia. Since the 1970s the trend has been shifting from manufacturing to service industries. Due to their nature, service industries are frequently located in or near urban areas that results in additional assumptions, objectives and constraints other than those in more traditional manufacturing location models. This survey focuses on the location of service facilities in urban areas. We studied 110 research papers across different journals and disciplines. We have analyzed these papers on two levels. On the first, we take an Operations Research perspective to investigate the papers in terms of types of decisions, location space, main assumptions, input parameters, objective functions and constraints. On the second level, we compare and contrast the papers in each of these applications categories: (a) Waste management systems (WMS), (b) Large-scale disaster (LSD), (c) Small-scale emergency (SSE), (d) General service and infrastructure (GSI), (e) Non-emergency healthcare systems (NEH) and (f) Transportation systems and their infrastructure (TSI). Each of these categories is critically analyzed in terms of application, assumptions, decision variables, input parameters, constraints, objective functions and solution techniques. Gaps, research opportunities and trends are identified within each category. Finally, some general lessons learned based on the practicality of the models is synthesized to suggest avenues of future research., Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD - Optimization of Scheduling Problems in Container Yards (No. DPI2015-65895-R) financed by FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources

  • Yepes-Borrero, Juan C.
  • Perea Rojas Marcos, Federico
  • Caballero-Villalobos, Juan Pablo
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making in realistic settings. More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. This is a more realistic extension of the traditional problem, in which the setups are assumed to be done without using additional resources (e.g. workers). We propose three metaheuristics following two approaches: a first approach that ignores the information about additional resources in the constructive phase, and a second approach that takes into account this information about the resources. Computational experiments are carried out over a benchmark of small and large instances. After the computational analysis we conclude that the second approach shows an excellent performance, overcoming the first approach., The first three authors would like to acknowledge the support from Spanish "Ministerio de Economia y competitividad" throughout grant number MTM2016-74983 and grant "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R), financed by FEDER funds, the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No.RTI2018-094940-B-100). Thanks are also due to the Universitat Politecnica de Valencia under grant SP20180164 of the program Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia. Juan C. Yepes-Borrero acknowledges financial support by the El Instituto Colombiano de Credit Educativo y Estudios Tecnicos en el Exterior - ICETEX under program Pasaporte a la ciencia - Doctorado. Special thanks are due to two anonymous referees for their valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: A multi-objective approach

  • Zhang, Zikai
  • Tang, QiuHua
  • Ruiz García, Rubén
  • Zhang, Liping
[EN] Workers still perform the bulk of operations in the manufacturing industry. The consideration of the assignment of workers and the reduction of ergonomic risks in U-shaped assembly lines is of paramount importance. However, the objectives of efficient task and worker assignment and a reduction in ergonomic risks are not usually correlated. Moreover, there is limited research in the existing literature into multi-objective approaches in U-shaped assembly lines. We formulate a U-shaped assembly worker assignment and balancing problem to simultaneously minimize cycle times and ergonomic risks. In addition, and due to its simplicity and successful results in flow shop scheduling problems, a Restarted Iterated Pareto Greedy algorithm is designed to optimize both objectives. In this algorithm, a problem-specific heuristic-based initialization is extended to improve the initial solution. Two precedence-based greedy and local search phases are developed to exploit the space around the current solution. Finally, a restart mechanism is proposed to help the algorithm escape from local optima. Comprehensive computational results, supported by detailed statistical analyses, suggest that the proposed multi-objective algorithm outperforms existing methods on a large number of benchmark instances., The authors would like to thank the anonymous reviewers for their helpful comments and constructive suggestions. This work is supported by National Natural Science Foundation of China (No. 51875421, No. 51875420). Ruben Ruiz is partly supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization"(No.\ RTI2018-094940-B-I00) financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Allocating MapReduce workflows with deadlines to heterogeneous servers in a cloud data center

  • Wang, Jia
  • Li, Xiaoping
  • Ruiz García, Rubén
  • Xu, Hanchuan
  • Chu, Dianhui
[EN] Total profit is one of the most important factors to be considered from the perspective of resource providers. In this paper, an original MapReduce workflow scheduling with deadline and data locality is proposed to maximize total profit of resource providers. A new workflow conversion based on dynamic programming and ChainMap/ChainReduce is designed to decrease transmission times among MapReduce jobs of workflows. A new deadline division considering execution time, float time and job level is proposed to obtain better deadlines of MapReduce jobs in workflows. With the adapted replica strategy in MapReduce workflow, a new task scheduling is proposed to improve data locality which assigns tasks to servers with the earliest completion time in order to ensure resource providers obtain more profit. Experimental results show that the proposed heuristic results in larger total profit than other adopted algorithms., This work is supported by the National Key Research and Development Program of China (No. 2017YFB1400801), the National Natural Science Foundation of China (Nos. 61872077, 61832004) and Collaborative Innovation Center of Wireless Communications Technology. Rubén Ruiz is partly supported by the Spanish Ministry of Science, Innovation, and Universities, under the project ¿OPTEP-Port Terminal Operations Optimization¿ (No. RTI2018-094940-B-I00) financed with FEDER funds¿.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Scheduling Periodical Multi-Stage Jobs With Fuzziness to Elastic Cloud Resources

  • Zhu, Jie
  • Li, Xiaoping
  • Ruiz García, Rubén
  • Li, Wei
  • Huang, Haiping
  • Zomaya, Albert Y.
[EN] We investigate a workflow scheduling problem with stochastic task arrival times and fuzzy task processing times and due dates. The problem is common in many real-time and workflow-based applications, where tasks with fixed stage number and linearly dependency are executed on scalable cloud resources with multiple price options. The challenges lie in proposing effective, stable, and robust algorithms under stochastic and fuzzy tasks. A triangle fuzzy number-based model is formulated. Two metrics are explored: the cost and the degree of satisfaction. An iterated heuristic framework is proposed to periodically schedule tasks, which consists of a task collection and a fuzzy task scheduling phases. Two task collection strategies are presented and two task prioritization strategies are employed. In order to achieve a high satisfaction degree, deadline constraints are defined at both job and task levels. By designing delicate experiments and applying sophisticated statistical techniques, experimental results show that the proposed algorithm is more effective and robust than the two existing methods., This work was supported by the National Key Research and Development Program of China (No. 2017YFB1400800), the National Natural Science Foundation of China (Nos. 61672297, 61872077, and 61832004), the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (Grant No. 18KJB520039) and the National Science Foundation for Post-doctoral Scientists of China (Grant No. 2018M640510). Ruben Ruiz was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER funds. The authors would like to thank the anonymous reviewers for their valuable feedback on this work.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Integer programming models for the pre-marshalling problem

  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramon
  • Ruiz García, Rubén
[EN] The performance of shipping companies greatly depends on reduced berthing times. The trend towards bigger ships and shorter berthing times places severe stress on container terminals, which cannot simply increase the available cranes indefinitely. Therefore, the focus is on optimizing existing resources. An effective way of speeding up the loading/unloading operations of ships at the container terminal is to use the idle time before the arrival of a ship for sorting the stored containers in advance. The pre-marshalling problem consists in rearranging the containers placed in a bay in the order in which they will be required later, looking for a sequence with the minimum number of moves. With sorted bays, loading/unloading operations are significantly faster, as there is no longer a need to make unproductive moves in the bays once ships are berthed. In this paper, we address the pre-marshalling problem by developing and testing integer linear programming models. Two alternative families of models are proposed, as well as an iterative solution procedure that does not depend on a difficult to obtain upper bound. An extensive computational analysis has been carried out over several well-known datasets from the literature. This analysis has allowed us to test the performance of the models, and to conclude that the performance of the best proposed model is superior to that of previously published alternatives., This study has been partially supported by the Spanish Ministry of Education, Culture, and Sport, FPU Grant A-2015-12849 and by the Spanish Ministry of Economy and Competitiveness, under projects DPI2014-53665-P and DPI2015-65895-R, partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Bi-objective parallel machine scheduling with additional resources during setups

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures., The authors would like to acknowledge the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No. RTI2018-094940-B-100) and grant MTM2016-74983, from the "Universitat Politecnica de Valencia" under grant SP20180164 of the program "Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia", and from the "Generalitat Valenciana" under grant "NUevos REtos en SEcuenciacion"(No. AICO/2020/049). Juan C. Yepes-Borrero acknowledges financial support by "El Instituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX" under program "Pasaporte a la ciencia - Doctorado", grant number 3568118.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving the generalized multi-port container stowage problem by a matheuristic algorithm

  • Parreño-Torres, Consuelo
  • Calik, Hatice
  • Álvarez-Valdés, Ramón
  • Ruiz García, Rubén
[EN] We focus on a simplified container stowage planning problem where containers of different size and weight must be loaded and unloaded at multiple ports while maintaining the stability of the ship. We initially investigate how the difficulty in solving the problem changes with and without the consideration of container sizes and weight constraints. For this purpose, we provide integer programming formulations for the general problem as well as some special cases with identical container size and/or identical weights and evaluate their performance in randomly generated small-and medium-scale instances. We develop a matheuristic procedure, namely, an insert-and-fix heuristic, exploiting the special structure of the proposed formulations. The Insert and-Fix method, in combination with a constructive algorithm that gives the solver an initial solution in each iteration, provides solutions with a low number of rehandles for instances with up to 5000 TEUs., We would like to thank the anonymous referees for their comments which have helped to significantly improve this paper. This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under theproject "OPTEPPort Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER, Spain funds. The second author acknowledges the partial support by Datadriven logistics, Spain (FWO-S007318N) and Internal Funds KU Leuven, Spain.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A constraint programming approach for the premarshalling problem

  • Jiménez-Piqueras, Celia
  • Ruiz, Rubén
  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramon
[EN] The enormous amount of containers handled at ports hampers the efficiency of terminal operations. The optimization of crane movements is crucial for speeding up the loading and unloading of vessels. To this end, the premarshalling problem aims to reorder a set of containers placed in adjacent stacks with a minimum number of crane movements, so that a container with an earlier retrieval time is not below one with a later retrieval time. In this study, we present a series of constraint programming models to optimally solve the premarshalling problem. Extensive computational comparisons show that the best proposed constraint programming formulation yields better results than the state-of-the-art integer programming approach. A salient finding in this paper is that the logic behind the model construction in constraint programming is radically different from that of more traditional mixed integer linear programming models., Acknowledgements This study has been partially supported by the Spanish Ministry of Science and Innovation under predoctoral grant PRE2019-087706 and the project 'OPTEP-Port Terminal Operations Opti-mization' (No. RTI2018-094940-B-I00) financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Mass Casualty Management in Disaster Scene: A Systematic Review of OR&amp, MS research in Humanitarian Operations

  • Farahani, Reza Zanjirani
  • Lotfi, M. M.
  • Baghaian, Atefe
  • Ruiz García, Rubén
  • Rezapour, Shabnam
[EN] Disasters are usually managed through a four-phase cycle including mitigation, preparedness, response and recovery. The first two phases happen before a disaster and the last two after it. This survey focuses on casualty management (CM), which is one of the actions taken in the response phase of a disaster. Right after a severe disaster strikes, we may be confronted with a large number of casualties in a very short period of time. These casualties are in need of urgent treatment and their survival depends on a rapid response. Therefore, managing resources in the first few hours after a disaster is critical and efficient CM can significantly increase the survival rate of casualties. Uncertainty in the location of a disaster, disruption to transportation networks, scarcity of resources and possible deaths of rescue and medical teams due to the disaster in such situations make it hard to manage casualties. In this survey, we focus on CM for disasters where the following five steps are taken, respectively: (i) Resource dispatching/search and rescue, (ii) on-site triage, (iii) on-site medical assistance, (iv) transportation to hospitals and (v) triage and comprehensive treatment. With a special focus on Operations Research (OR) techniques, we categorize the existing research papers and case studies in each of these steps. Then, by critically observing and investigating gaps, trends and the practicality of the extant research studies, we suggest future directions for academics and practitioners., Ruben Ruiz is partially supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization"(No. RTI2018-094940-B-I00) financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Iterated Greedy methods for the distributed permutation flowshop scheduling problem

  • Ruiz García, Rubén
  • Pan, Quan-Ke
  • Naderi, Bahman
[EN] Large manufacturing firms operate more than one production center. As a result, in relation to scheduling problems, which factory manufactures which product is an important consideration. In this paper we study an extension of the well known permutation flowshop scheduling problem in which there is a set of identical factories, each one with a flowshop structure. The objective is to minimize the maximum completion time or makespan among all factories. The resulting problem is known as the distributed permutation flowshop and has attracted considerable interest over the last few years. Contrary to the recent trend in the scheduling literature, where complex nature-inspired or metaphor-based methods are often proposed, we present simple Iterated Greedy algorithms that have performed well in related problems. Improved initialization, construction and destruction procedures, along with a local search with a strong intensification are proposed. The result is a very effective algorithm with little problem-specific knowledge that is shown to provide demonstrably better solutions in a comprehensive and thorough computational and statistical campaign., Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds. Quan-Ke Pan is supported by the National Natural Science Foundation of China (Grant No. 51575212).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Performance Analysis for Heterogeneous Cloud Servers Using Queueing Theory

  • Wang, Shuang
  • Li, Xiaoping
  • Ruiz García, Rubén
[EN] In this article, we consider the problem of selecting appropriate heterogeneous servers in cloud centers for stochastically arriving requests in order to obtain an optimal tradeoff between the expected response time and power consumption. Heterogeneous servers with uncertain setup times are far more common than homogenous ones. The heterogeneity of servers and stochastic requests pose great challenges in relation to the tradeoff between the two conflicting objectives. Using the Markov decision process, the expected response time of requests is analyzed in terms of a given number of available candidate servers. For a given system availability, a binary search method is presented to determine the number of servers selected from the candidates. An iterative improvement method is proposed to determine the best servers to select for the considered objectives. After evaluating the performance of the system parameters on the performance of algorithms using the analysis of variance, the proposed algorithm and three of its variants are compared over a large number of random and real instances. The results indicate that proposed algorithm is much more effective than the other four algorithms within acceptable CPU times., This work is supported by the National Key Research and Development Program of China Grant No. 2017YFB1400801, the National Natural Science Foundation of China Grant Nos. 61572127, 61872077, 61832004 and Collaborative Innovation Center of Wireless Communications Technology. Rub~en Ruiz is partly supported by the Spanish Ministry of Science, Innovation, and Universities, under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-BI00) financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A branch and bound approach for large pre-marshalling problems

  • Tanaka, Shunji
  • Tierney, Kevin
  • Parreño-Torres, Consuelo
  • Alvarez-Valdes, Ramón
  • Ruiz García, Rubén
[EN] The container pre-marshalling problem involves the sorting of containers in stacks so that there are no blocking containers and retrieval is carried out without additional movements. This sorting process should be carried out in as few container moves as possible. Despite recent advancements in solving real world sized problems to optimality, several classes of pre-marshalling problems remain difficult for exact approaches. We propose a branch and bound algorithm with new components for solving such difficult instances. We strengthen existing lower bounds and introduce two new lower bounds that use a relaxation of the pre-marshalling problem to provide tight bounds in specific situations. We introduce generalized dominance rules that help reduce the search space, and a memoization heuristic that finds feasible solutions quickly. We evaluate our approach on standard benchmarks of pre-marshalling instances, as well as on a new dataset to avoid overfitting to the available data. Overall, our approach optimally solves many more instances than previous work, and finds feasible solutions on nearly every problem it encounters in limited CPU times., The authors thank the Paderborn Center for Parallel Computation (PC2) for the use of the Arminius cluster for the computational study in this work. This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities FPU Grant A-2015-12849 and by the Spanish Ministry of Economy and Competitiveness, under projects DPI2014-53665-P and DPI2015-65895-R, partially financed with FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Minimizing crane times in pre-marshalling problems

  • Parreño-Torres, Consuelo
  • Álvarez-Valdés, Ramón
  • Ruiz García, Rubén
  • Tierney, Kevin
[EN] The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring process efficiency, and we show that it does not correlate with the number of movements. As a result, we study the problem of minimizing crane times and develop two exact approaches to solve it: an integer linear model, and a branch and bound algorithm, with new upper and lower bounds, dominance criteria, and a heuristic procedure, to provide optimal solutions for problems of practical size, This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER funds.
Repositorio Institucional de la Universidad de Burgos (RIUBU)
Publicación Artículo científico (JournalArticle)

Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm

  • Parreño Torres, Consuelo
  • Çalık, Hatice
  • Álvarez-Valdés Olaguíbel, Ramón
  • Ruiz García, Rubén
We focus on a simplified container stowage planning problem where containers of different size and weight must be loaded and unloaded at multiple ports while maintaining the stability of the ship. We initially investigate how the difficulty in solving the problem changes with and without the consideration of container sizes and weight constraints. For this purpose, we provide integer programming formulations for the general problem as well as some special cases with identical container size and/or identical weights and evaluate their performance in randomly generated small- and medium-scale instances. We develop a matheuristic procedure, namely, an insert-and-fix heuristic, exploiting the special structure of the proposed formulations. The Insert-and-Fix method, in combination with a constructive algorithm that gives the solver an initial solution in each iteration, provides solutions with a low number of rehandles for instances with up to 5000 TEUs., Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under the project “OPTEP-Port Terminal Operations Optimization” (No. RTI2018-094940-B-I00) financed with FEDER, Spain funds. The second author acknowledges the partial support by Data-driven logistics, Spain (FWO-S007318N) and Internal Funds KU Leuven, Spain.