Buscar recursos académicos

This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overco...

En los algoritmos ACO (del inglés Ant Colony Optimization) las hormigas artificiales iterativamente construyen soluciones a un problema de optimización combinatorio. La construcción de dichas soluciones está guiada p...

The travelling salesman problem (TSP) is a NP-hard problem. Techniques as either Branch and Bound or Dynamic Programming supplied the global optimum solution for instances with more than 7000 cities. But, ther needed mor...

A new issue for combinatorial optimization problems is to incorporate local search into the framework of evolutionary algorithms, leading to hybrid evolutionary algorithms. With the hybrid approach, evolutionary algorith...

Abstract The meta-heuristic algorithm with local search is an excellent choice for the job-shop scheduling problem (JSP). However, due to the unique nature of the JSP, local search may generate infeasible neighbourhood s...

A legal dominating sequence of a graph is an ordered dominating set of vertices where each element dominates at least another one not dominated by its predecessors in the sequence. The length of a largest legal dominatin...

Discriminant Analysis can best be defined as a technique which allows the classification of an individual into several dictinctive populations on the basis of a set of measurements. Stepwise discriminant analysis (SDA) i...

As military aircraft continue to remain in service and age, cannibalization of parts is increasing. Proactive identification of parts that are at high risk for cannibalization will inform engineering processes such as re...

Abstract Biochar yield prediction plays a critical role in optimizing pyrolysis processes and advancing sustainable biomass utilization. This study introduces a hybrid machine learning framework that integrates Decision ...

Abstract The connection between production scheduling and transportation scheduling is getting closer in smart manufacturing system, and both of those problems are summarized as NP-hard problems. However, only a few stud...

Many optimization problems in various fields have been solved using diverse optimization al gorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic program...

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. ...

El objetivo de éste trabajo es analizar el comportamiento de distintos algoritmos de búsqueda incompletos en un problema clásico de optimización combinatoria!. El problema seleccionado es el problema de la mochila, c...

Existen dos conceptos de importancia en el contexto de problemas dinámicos y en particular de scheduling dinámicos: la búsqueda de soluciones robustas y flexibles. El concepto de robustez de las soluciones se refiere ...

The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software E...

The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software E...

El presente trabajo describe una propuesta de investigación para atacar diferentes problemas de scheduling. Dicha tarea es realizada por investigadores de distintas líneas del LIDIC, y en consecuencia, con técnicas di...

Evolutionary algorithms (EAs) offer a robust approach to problem solving. EAs are extremely flexible and can be extended by incorporating alternative approaches to favour he search process. One way is to hybridize an evo...

Las organizaciones industriales frecuentemente están sujetas a diferentes tipos de cambios como pueden ser: que se agregue una nueva tarea, la cancelación de una tarea, la ruptura de una maquina, como así también cam...

El problema general de scheduling representa un desafío para su resolución dado que es un problema inherentemente difícil. Por otro lado, existe una gran variedad de enfoques cuya efectividad depende del tipo, tamaño...

El problema general de scheduling representa un gran desafío computacional dado que es un problema inherentemente difícil. Para su resolución, existe una gran variedad de enfoques cuya efectividad depende del tipo, ta...

Background Researcher identity and positionality shape how studies of health inequalities are conceptualised, conducted, and interpreted, particularly within culturally diverse teams. Yet there is no consolidated map of ...

High-quality health systems must provide accessible, people-centred care to both improve health and maintain population trust in health services. Furthermore, accurate measurement of population perspectives is vital to h...