Arangú, Marlene; Salido Gregorio, Miguel Angel(Universidad Centroccidental "Lisandro Alvarado" - Decanato de Ciencias Económicas y Empresariales, 2014-05)
El transporte ferroviario tiene un rol importante y creciente en muchos países,
lo cual crea la necesidad de optimizar el uso de la infraestructura ferroviaria y
los métodos y herramientas para su administración. La ...
Arangú Lobig, Marlene Alicia(Universitat Politècnica de València, 2011-12-23)
Hoy en día, muchos problemas reales pueden ser modelados como problemas de
satisfacción de restricciones (CSPs) y ser resueltos utilizando técnicas de programación de restricciones. Estos problemas pertenecen a diferentes ...
Rodríguez Molins, Mario(Universitat Politècnica de València, 2011-09-02)
Several AI techniques are applied to achieve optimal solutions to different combinatorial problems of Container Terminals. We presented a domain-dependent heuristic planner for Container Stacking Problem. A GRASP metaheuristic ...
[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 ...
Sayago Martín, David(Universitat Politècnica de València, 2018-09-14)
[ES] Este trabajo se basa en el desarrollo de un sistema de seguimiento solar en tiempo real con la finalidad de orientar la placa solar fotovoltaica hasta la posición deseada en la que se obtenga un rendimiento máximo ...
Rodríguez Molins, Mario(Universitat Politècnica de València, 2015-03-31)
Despite the continuous evolution in computers and information technology, real-world
combinatorial optimization problems are NP-problems, in particular in the domain of
planning and scheduling. Thus, although exact ...
Abril López, Montserrat(Universitat Politècnica de València, 2008-05-07)
Hoy en día, muchos problemas reales pueden modelarse como problemas de satisfacción de restricciones (CSPs) y se resuelven usando técnicas específicas de satisfacción de restricciones.
Estos problemas pertenecen a áreas ...
Morillo Torres, Daniel; Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Sociedad Iberoamericana de Inteligencia Artificial (IBERAMIA), 2014)
[EN] Scheduling problems is one of the core areas in the planning and development of any project, with a wide applicability to real-world situations. Due to the high complexity of these problems, the solving process is ...
[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, ...
[EN] Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some ...
Climent Aunés, Laura Isabel; Wallace, Richard; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico(Association for the Advancement of Artificial Intelligence, 2014)
[EN] Many real life problems that can be solved by constraint programming, come from uncertain and dynamic environments. Because of the dynamism, the original problem may change over time, and thus the solution found for ...
Climent Aunés, Laura Isabel(Universitat Politècnica de València, 2014-01-07)
Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. It is well-known that many real life problems can be modeled as Constraint Satisfaction Problems (CSPs). Much ...
Salido Gregorio, Miguel Angel; Barber Sanchís, Federico; Ingolotti Hetter, Laura Paola(Elsevier, 2012-12-15)
[EN] Railway scheduling has been a significant issue in the railway industry. Over the last few years, numerous approaches and tools have been developed to compute railway scheduling. However, robust solutions are necessary ...
Climent Aunés, Laura Isabel; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico(ICIC International, 2012)
[EN] Constraint programming is a successful technology for solving combinatorial
problems modeled as constraint satisfaction problems (CSPs). Many real life problems are
dynamic, which means that the initial description ...
Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Universitat Politècnica de València, 2013-05-17)
Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world ...
Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Universitat Politècnica de València, 2011-04-11)
Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world ...
Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Springer, 2015-09)
Many real-world problems in Artificial Intelligence (AI) as well as in other areas of
computer science and engineering can be efficiently modeled and solved using constraint programming
techniques. In many real-world ...
[EN] A new optimization method namely the Search and Rescue optimization algorithm (SAR) is presented here to solve constrained engineering optimization problems. This metaheuristic algorithm imitates the explorations ...
García Cantos, José Francisco(Universitat Politècnica de València, 2016-09-08)
[ES] El trabajo consiste en el desarrollo de una herramienta de ayuda a la decisión para abordar
un problema de optimización combinatoria concreto. Este problema es el corte de vidrio plano
flotante unidimensional y la ...
Ferrer Sánchez, Sergio(Universitat Politècnica de València, 2016-09-02)
[ES] En este proyecto se plantea el diseño, desarrollo e implementación de un
sistema capaz de resolver el ampliamente conocido problema de asignación de
turnos de forma genérica, adaptable y en tiempos computacionalme ...