Pasar al contenido principal

TECNOLOGIAS INTELIGENTES PARA LA RESOLUCION CENTRALIZADA Y DISTRIBUIDA DE PROBLEMAS DE SCHEDULING SOSTENIBLE EN PROCESOS INDUSTRIALES Y LOGISTICOS

TIN2016-80856-R

•
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 2016
Plan Estatal 2013-2016 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): 9
Encontrada(s) 1 página(s)

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

A holonic multi-agent methodology to design sustainable intelligent manufacturing control systems

  • Giret Boggino, Adriana Susana|||0000-0002-2311-0785
  • Trentesaux, Damien
  • Salido Gregorio, Miguel Ángel
  • Garcia, Emilia
  • Adam, Emmanuel
[EN] The urgent need for sustainable development is imposing radical changes in the way manufacturing systems are designed and implemented. The overall sustainability in industrial activities of manufacturing companies must be achieved at the same time that they face unprecedented levels of global competition. Therefore, there is a well-known need for tools and methods that can support the design and implementation of these systems in an effective way. This paper proposes an engineering method that helps researchers to design sustainable intelligent manufacturing systems. The approach is focused on the identification of the manufacturing components and the design and integration of sustainability-oriented mechanisms in the system specification, providing specific development guidelines and tools with built-in support for sustainable features. Besides, a set of case studies is presented in order to assess the proposed method., This research was supported by research projects TIN2015-65515-C4-1-R and TIN2016-80856-R from the Spanish government. The authors would like to acknowledge T. Bonte for her contribution to the NetLogo simulator of the AIP PRIMECA cell.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Mode-Based versus Activity-Based Search for a Nonredundant Resolution of the Multimode Resource-Constrained Project Scheduling Problem

  • Morillo-Torres, Daniel
  • Barber, Federico|||0000-0002-3966-5742
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] This paper addresses an energy-based extension of the Multimode Resource-Constrained Project Scheduling Problem (MRCPSP) called MRCPSP-ENERGY. This extension considers the energy consumption as an additional resource that leads to different execution modes (and durations) of the activities. Consequently, different schedules can be obtained. The objective is to maximize the efficiency of the project, which takes into account the minimization of both makespan and energy consumption. This is a well-known NP-hard problem, such that the application of metaheuristic techniques is necessary to address real-size problems in a reasonable time. This paper shows that the Activity List representation, commonly used in metaheuristics, can lead to obtaining many redundant solutions, that is, solutions that have different representations but are in fact the same. This is a serious disadvantage for a search procedure. We propose a genetic algorithm(GA) for solving the MRCPSP-ENERGY, trying to avoid redundant solutions by focusing the search on the execution modes, by using the Mode List representation. The proposed GA is evaluated on different instances of the PSPLIB-ENERGY library and compared to the results obtained by both exact methods and approximate methods reported in the literature. This library is an extension of the well-known PSPLIB library, which contains MRCPSP-ENERGY test cases., This paper has been partially supported by the Spanish Research Projects TIN2013-46511-C2-1-P and TIN2016-80856-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An Enhanced Estimation of Distribution Algorithm for Energy-Efficient Job-Shop Scheduling Problems with Transportation Constraints

  • Dai, Min
  • Zhang, Ziwei
  • Giret Boggino, Adriana Susana|||0000-0002-2311-0785
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] Nowadays, the manufacturing industry faces the challenge of reducing energy consumption and the associated environmental impacts. Production scheduling is an effective approach for energy-savings management. During the entire workshop production process, both the processing and transportation operations consume large amounts of energy. To reduce energy consumption, an energy-efficient job-shop scheduling problem (EJSP) with transportation constraints was proposed in this paper. First, a mixed-integer programming model was established to minimize both the comprehensive energy consumption and makespan in the EJSP. Then, an enhanced estimation of distribution algorithm (EEDA) was developed to solve the problem. In the proposed algorithm, an estimation of distribution algorithm was employed to perform the global search and an improved simulated annealing algorithm was designed to perform the local search. Finally, numerical experiments were implemented to analyze the performance of the EEDA. The results showed that the EEDA is a promising approach and that it can solve EJSP effectively and efficiently., This work was supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (No. 17KJB460018), the Innovation Foundation for Science and Technology of Yangzhou University (No. 2016CXJ020 and No. 2017CXJ018), Science and Technology Project of Yangzhou under (No. YZ2017278), Research Topics of Teaching Reform of Yangzhou University under (No. YZUJX2018-28B), and the Spanish Government (No. TIN2016-80856-R and No. TIN2015-65515-C4-1-R).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Tesis doctoral (DoctoralThesis)

Intelligent Agents Technologies for solving sustainable scheduling problems in industrial and logistics processes

  • Nicoló, Giancarlo
[ES] El creciente requerimiento de procesos de producción eficientes, rentables y sostenibles ha intensificado el estudio de técnicas avanzadas de planificación y programación (scheduling) en los ámbitos industrial y logístico. Los problemas de scheduling, en los que los recursos deben asignarse a lo largo del tiempo para optimizar objetivos específicos, son fundamentales para la eficacia operativa de numerosos escenarios reales. Los métodos tradicionales suelen basarse en formulaciones centralizadas con supuestos fuertes, lo que pasa por alto la naturaleza dinámica y distribuida de los entornos de producción modernos. Además, el aumento de la competitividad y las crecientes preocupaciones por la sostenibilidad han introducido nuevos objetivos, a menudo contrapuestos, como minimizar el consumo energético y reducir el impacto ambiental, dando lugar a la aparición del Green Scheduling. Esta tesis se centra en el diseño y la evaluación de tecnologías inteligentes que abordan la planificación sostenible en entornos industriales complejos, distribuidos y dinámicos. En primer lugar, explora nuevos enfoques de programación matemática y basados en agentes para captar la dependencia energética de distintos recursos, incluyendo consideraciones de tarifas horarias (time-of-use) y características de consumo específicas de cada recurso. A continuación, desarrolla metaheurísticas híbridas que incorporan aprendizaje y comportamientos adaptativos para acomodar cambios en tiempo real, con el objetivo de producir soluciones robustas y, al mismo tiempo, eficientes. El trabajo investiga de forma sistemática estrategias de planificación proactivas y reactivas, demostrando cómo un modelado cuidadoso de la imprevisibilidad (p. ej., averías de máquinas, fluctuaciones en los costes energéticos) puede mejorar la robustez global del sistema., [EN] The growing need for efficient, cost-effective, and sustainable production processes has intensified the study of advanced scheduling techniques in industrial and logistics domains. Scheduling problems, where resources must be allocated over time to optimize specific objectives, are central to the operational effectiveness of many real-world scenarios. Traditional methods typically rely on centralized formulations with strong assumptions, which neglect the dynamic and distributed nature of modern production environments. Moreover, escalating competitiveness and mounting sustainability concerns have introduced new, often conflicting objectives such as minimizing energy consumption and reducing environmental impact leading to the emergence of Green Scheduling. This thesis focuses on designing and evaluating intelligent technologies that address sustainable scheduling in complex, distributed, and dynamic industrial settings. First, it explores novel mathematical programming and agent-based approaches to capture the energy dependence of different resources, including time-of-use considerations and resource-specific consumption characteristics. Next, it develops hybrid metaheuristics that incorporate learning and adaptive behaviors to accommodate real-time changes, aiming to produce robust yet efficient solutions. The work systematically investigates proactive and reactive scheduling strategies, demonstrating how careful modeling of unpredictability (e.g., machine breakdowns, fluctuating energy costs) can enhance overall system robustness. Through a combination of theoretical developments, empirical evaluations on realistic manufacturing data, and multi-agent frameworks tailored to energy-aware scheduling, the thesis shows how distributed optimization and dynamic constraint handling can significantly reduce energy consumption without sacrificing productivity. This research not only contributes new insights to the fields of Artificial Intelligence and Operations Research but also underscores the role of intelligent scheduling solutions in advancing sustainable manufacturing practices., [CA] El creixent necessitat de processos de producció eficients, rendibles i sostenibles ha intensificat l'estudi de tècniques avançades de planificació en els àmbits industrial i logístic. Els problemes de planificació, en què els recursos s'han d'assignar al llarg del temps per a optimitzar objectius específics, són fonamentals per a l'eficàcia operativa de molts escenaris del món real. Els mètodes tradicionals solen basar-se en formulacions centralitzades amb supòsits forts, que no tenen en compte la naturalesa dinàmica i distribuïda dels entorns de producció moderns. A més, l'augment de la competitivitat i les creixents preocupacions per la sostenibilitat han introduït nous objectius, sovint contradictoris, com ara minimitzar el consum d'energia i reduir l'impacte ambiental, cosa que ha donat lloc a l'aparició de la planificació verda. Aquesta tesi se centra en el disseny i l'avaluació de tecnologies intel·ligents que aborden la planificació sostenible en entorns industrials complexos, distribuïts i dinàmics. En primer lloc, explora nous enfocaments de programació matemàtica i basats en agents per a captar la dependència energètica dels diferents recursos, incloent-hi consideracions de tarifació segons l'hora d'ús i característiques de consum específiques de cada recurs. A continuació, desenvolupa metaheurístiques híbrides que incorporen aprenentatge i comportaments adaptatius per a acomodar canvis en temps real, amb l'objectiu de produir solucions robustes però eficients. El treball investiga de manera sistemàtica estratègies de planificació proactiva i reactiva, i demostra com una modelització acurada de la imprevisibilitat (per exemple, avaries de màquines o fluctuacions dels costos energètics) pot millorar la robustesa global del sistema. Mitjançant una combinació de desenvolupaments teòrics, avaluacions empíriques sobre dades realistes de fabricació i marcs multiagent adaptats a la planificació conscient de l'energia, la tesi mostra com l'optimització distribuïda i la gestió dinàmica de restriccions poden reduir significativament el consum energètic sense sacrificar la productivitat. Aquesta investigació no sols aporta noves perspectives als camps de la Intel·ligència Artificial i la Investigació Operativa, sinó que també posa en relleu el paper de les solucions intel·ligents de planificació en l'avanç de les pràctiques de fabricació sostenible., The paper has been partially supported by the Spanish research project TIN2016-80856R and TIN2015-65515-C4-1-R,andtheACIF/2017ProgramoftheConselleriad’Educació (Generalitat Valenciana). The authors gratefully acknowledge the financial support of the European Social Fund (Investing In Your Future), the Spanish Ministry of Science (project PID2021-125919NBI00), and valgrAI- Valencian Graduate School and Research Network of Artificial Intelligence and the Generalitat Valenciana, and co-funded by the European Union.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Rescheduling in job-shop problems for sustainable manufacturing systems

  • Miguel A. Salido|||0000-0002-4835-4057
  • Escamilla-Fuster, Joan
  • Barber, Federico|||0000-0002-3966-5742
  • Giret Boggino, Adriana Susana|||0000-0002-2311-0785
[EN] Manufacturing industries are faced with environmental challenges, so their industrial processes must be optimized in terms of both profitability and sustainability. Since most of these processes are dynamic, the previously obtained solutions cannot be valid after disruptions. This paper focuses on recovery in dynamic job-shop scheduling problems where machines can work at different rates. Machine speed scaling is an alternative framework to the on/off control framework for production scheduling. Thus, given a disruption, the main goal is to recover the original solution by rescheduling the minimum number of tasks. To this end, a new match-up technique is developed to determine the rescheduling zone and a feasible reschedule. Then, a memetic algorithm is proposed for finding a schedule that minimizes the energy consumption within the rescheduling zone but that also maintains the makespan constraint. An extensive study is carried out to analyze the behavior of our algorithms to recover the original solution and minimize the energy reduction in different benchmarks, which are taken from the OR-Library. The energy consumption and processing time of the tasks involved in the rescheduling zone will play an important role in determining the best match-up point and the optimized rescheduling. Upon a disruption, different rescheduling solutions can be obtained, all of which comply with the requirements but that have different values of energy consumption. The results proposed in this paper may be useful for application in real industries for energy-efficient production rescheduling., This research has been supported by the Seventh Framework Programme under the research project TETRACOM-GA609491 and the Spanish Government under research projects TIN2013-46511-C2-1, TIN2015-65515-C4-1-R and TIN2016-80856-R. The authors wish to thank reviewers and editors for their positive comments to improve the quality of the paper.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A New Optimization Algorithm Based on Search and Rescue Operations

  • Shabani, Amir
  • Asgarian, Behrouz
  • Gharebaghi, Saeed Asil
  • Miguel A. Salido|||0000-0002-4835-4057
  • Giret Boggino, Adriana Susana|||0000-0002-2311-0785
[EN] In this paper, a new optimization algorithm called the search and rescue optimization algorithm (SAR) is proposed for solving single-objective continuous optimization problems. SAR is inspired by the explorations carried out by humans during search and rescue operations. The performance of SAR was evaluated on fifty-five optimization functions including a set of classic benchmark functions and a set of modern CEC 2013 benchmark functions from the literature. The obtained results were compared with twelve optimization algorithms including well-known optimization algorithms, recent variants of GA, DE, CMA-ES, and PSO, and recent metaheuristic algorithms. The Wilcoxon signed-rank test was used for some of the comparisons, and the convergence behavior of SAR was investigated. The statistical results indicated SAR is highly competitive with the compared algorithms. Also, in order to evaluate the application of SAR on real-world optimization problems, it was applied to three engineering design problems, and the results revealed that SAR is able to find more accurate solutions with fewer function evaluations in comparison with the other existing algorithms. Thus, the proposed algorithm can be considered an efficient optimization method for real-world optimization problems., This study was partially supported by the Spanish Research Project (nos. TIN2016-80856-R and TIN2015-65515-C4-1-R).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

A Metaheuristic Search Technique for Solving the Warehouse Stock Management Problem and the Routing Problem in a Real Company

  • Pérez-Bernal, Christian|||0000-0002-9121-7939
  • Miguel A. Salido|||0000-0002-4835-4057
  • Gurrea, David
[EN] In many transport companies, one of the main objectives is to optimize the travel cost of their fleet. Other objectives are related to delivery time, fuel savings, etc. However warehouse stock management is not properly considered. Warehouse stock control is based on the correct allocation of resources to each order. In this paper, we combine the warehouse stock management problem and the routing problem to be applied in a real company that allows negative stock in their warehouses. The proposed multi-objective problem is modeled and solved by the greedy randomized adaptive search (GRASP) algorithm. The results shows that the proposed algorithm outperforms the current search technique used by the company mainly in stock balancing, improving the negative average stock by up to 82%., The paper has been partially funded by the Spanish research project TIN2016-80856-R
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints

  • Min, Dai
  • Tang, Dunbing
  • Giret Boggino, Adriana Susana|||0000-0002-2311-0785
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] Manufacturing enterprises nowadays face huge environmental challenges because of energy consumption and associated environmental impacts. One of the effective strategies to reduce energy consumption is by employing intelligent scheduling techniques. Production scheduling can have significant impact on energy saving in manufacturing system from the operation management point of view. Resource flexibility and complex constraints in flexible manufacturing system make production scheduling a complicated nonlinear programming problem. To this end, a multi-objective optimization model with the objective of minimizing energy consumption and makespan is formulated for a flexible job shop scheduling problem with transportation constraints. Then, an enhanced genetic algorithm is developed to solve the problem. Finally, comprehensive experiments are carried out to evaluate the performance of the proposed model and algorithm. The experimental results revealed that the proposed model and algorithm can solve the problem effectively and efficiently. This may provide a basis for the decision makers to consider energy-efficient scheduling in flexible manufacturing system., This work was supported by the National Natural Science Foundation of China (NSFC) under Grant no. U1637211, Aeronautical Science Foundation of China under Grant no. 20161652015, the Fundamental Research Funds for the Central Universities under Grant no. NP2017105, Jiangsu Province Qing Lan Project, the Natural Science Foundation of the Jiangsu Higher Education Institutions of China under Grant no. 17KJB460018, the Innovation Foundation for Science and Technology of Yangzhou University under Grant nos. 2016CXJ020 and 2017CXJ018, Science and Technology Project of Yangzhou under Grant no. YZ2017278, Research Topics of Teaching Reform of Yangzhou University under Grant YZUJX2018-28B, and the Spanish Government under the grants TIN2016-80856-R and TIN2015-65515-C4-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A new model and metaheuristic approach for the energy-based resource-constrained scheduling problem

  • Morillo-Torres, Daniel
  • Barber, Federico|||0000-0002-3966-5742
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] This article focuses on obtaining sustainable and energy-efficient solutions for limited resource programming problems. To this end, a model for integrating makespan and energy consumption objectives in multi-mode resource-constrained project scheduling problems (MRCPSP-ENERGY) is proposed. In addition, a metaheuristic approach for the efficient resolution of these problems is developed. In order to assess the appropriateness of theses proposals, the well-known Project Scheduling Problem Library is extended (called PSPLIB-ENERGY) to include energy consumption to each Resource-Constrained Project Scheduling Problem instance through a realistic mathematical model. This extension provides an alternative to the current trend of numerous research works about optimization and the manufacturing field, which require the inclusion of components to reduce the environmental impact on the decision-making process. PSPLIB-ENERGY is available at http://gps.webs.upv.es/psplib-energy/., The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was supported by the Spanish Government under the research projects TIN2013-46511-C2-1 and TIN2016-80856-R.