Morillo Torres, Daniel(Universitat Politècnica de València, 2017-11-07)
In the field of operations research, the set of scheduling problems of activities is considered as one of the most relevant ones due to its great applicability and complexity. Within the broad variety of problems in this ...
[EN] Many real-world problems are known as planning and scheduling problems, where resources must be allocated so as
to optimize overall performance objectives. The traditional scheduling models consider performance ...
Barón Lozano, Julen(Universitat Politècnica de València, 2020-10-13)
[ES] El TFM consiste en la evaluación experimental de diversas metaheurísticas en la resolución de problemas. Para ello, se definirá a priori el problema objetivo y sus diversos grados de escala. A continuación se diseñarán ...
Climent Aunés, Laura Isabel; Wallace, Richard J.; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico(Springer Verlag (Germany), 2013-08)
Constraint programming is a paradigm wherein relations between variables are
stated in the form of constraints. Many real life problems come from uncertain and dynamic
environments, where the initial constraints and ...
Ariño Sales, Juan Francisco(Universitat Politècnica de València, 2020-10-15)
[EN] The boolean satisfiability problem is a very important problem in computer
science, affecting a great variety of fields, this work attempts to study how well
genetic algorithms perform when applied to the SAT problem ...
[EN] Maritime container terminals are facilities where cargo containers are transshipped between ships or between ships and land vehicles (trucks or trains). These terminals involve a large number of complex and combinatorial ...
Maritime container terminals are facilities where cargo containers are transshipped between ships or between ships and land vehicles (tucks or trains). These terminals involve a large number of complex and combinatorial ...
Lorente Llinares, David(Universitat Politècnica de València, 2019-09-09)
[EN] Monte Carlo Tree Search (MCTS) is a heuristic method used in decision-making
that aims to simulate all possible outcomes that result from choosing a given action, assigning a value to each of them and choosing the ...
Morillo-Torres, Daniel; Barber, Federico; Salido, Miguel A.(Hindawi Limited, 2017)
[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 ...
CERVANTES POSADA, Mª MARGARITA(Universitat Politècnica de València, 2010-04-23)
Los problemas de optimización y satisfacción de restricciones son
extraordinariamente complejos y variados. Al mismo tiempo, son problemas
de alto interés, tanto en el aspecto científico-técnico como en el aplicado. ...
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 ...