RiuNet UPV Home
:
Browsing by Subject

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Subject "Metaheuristics"

Now showing items 1-20 of 38

A genetic algorithm for robust berth allocation and quay crane assignment

Rodríguez Molins, Mario; Ingolotti Hetter, Laura Paola; Barber Sanchís, Federico; Salido Gregorio, Miguel Angel; Sierra, María R.; Puente, Jorge (2014-07-01)

[EN] Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial ...
A GRASP for the Mixed Postman Problem

Corberán, A.; Marti, R.; Sanchís Llopis, José María (Elsevier, 2002)

[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed ...
A metaheuristic for the min-max Windy Rural Postman Problem with K vehicles

Benavent, Enrique; Corberán, Angel; Sanchís Llopis, José María (Springer-Verlag, 2010)

[EN] In this paper we deal with the min¿max version of the windy rural postman problem with K vehicles. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of ...
A new genetic algorithm for the asymmetric traveling salesman problem

Yuichi Nagata; Soler Fernández, David (Elsevier, 2012-08)

The asymmetric traveling salesman problem (ATSP) is one of the most important combinatorial optimization problems. It allows us to solve, either directly or through a transformation, many real-world problems. We present ...
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

Fernandez-Viagas, Victor; Ruiz García, Rubén; Framinan, Jose (Elsevier, 2017-03-16)

[EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many ...
Algoritmos para el problema de máquinas paralelas no relacionadas con tiempos de cambio

Gonzalez Esguerra, Diana Carolina (Universitat Politècnica de València, 2015-06-02)

[ES] En el presente trabajo se ha estudiado el problema de máquinas paralelas no relacionadas con tiempos de cambio dependientes de la secuencia, con el objetivo de minimizar el tiempo máximo de finalización.Se ha realizado ...
An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics

García, José; Astorga, Gino; Yepes, V. (MDPI AG, 2021-02)

[EN] The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial ...
An ILS-Based Metaheuristic for the Stacker Crane Problem

Ávila, Thais; Corberán, A.; PLANA, ISAAC; Sanchís Llopis, José María (Springer-Verlag, 2012)

[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation ...
An iterated greedy heuristic for a market segmentation problem with multiple attributes

Huerta-Muñoz, D.L.; Ríos-Mercado, Roger Z.; Ruiz García, Rubén (Elsevier, 2017-08)

[EN] A real-world customer segmentation problem from a beverage distribution firm is addressed. The firm wants to partition a set of customers, who share geographical and marketing attributes, into segments according to ...
Aplicación de técnicas metaheurísticas a problemas de asignación de recursos

Pastor Pastor, Sergio Alejandro (Universitat Politècnica de València, 2016-11-03)

[EN] Resource assignment has been a complex issue since a long time ago because there is an infinite number of solutions and ways to generate them, although none of them is the best technique to employ. Instead, we have ...
Aplicación de técnicas metaheurísticas para la asignación de turnos de trabajo

Ruescas Nicolau, Ana Virginia (Universitat Politècnica de València, 2016-12-07)

[EN] In this career guidance final project, we have contrasted the intelligent computer techniques applicability to solve rostering problems. Such problems are part of the area of combinatorial optimization problems ...
Application of particle swarm optimisation with backward calculation to solve a fuzzy multi-objective supply chain master planning model

Grillo Espinoza, Hanzel; Peidro Payá, David; Alemany Díaz, María del Mar; Mula, Josefa (Inderscience, 2015)

Traditionally, supply chain planning problems consider variables with uncertainty associated with uncontrolled factors. These factors have been normally modelled by complex methodologies where the seeking solution process ...
Desarrollo de una metodología de soporte a la toma de decisiones para la selección y asignación de licitaciones en una consultora tecnológica multinacional

Hortal Segura, Enrique (Universitat Politècnica de València, 2019-07-03)

[ES] El presente TFG se desarrolla en una empresa multinacional con presencia en 18 países especializada en dar soluciones de desarrollo y mantenimiento de aplicaciones tecnológicas, subcontratación y estrategia. Consistirá ...
Discrete swarm intelligence optimization algorithms applied to steel-concrete composite bridges

Martínez-Muñoz, D.; García, J.; Martí Albiñana, José Vicente; Yepes, V. (Elsevier, 2022-09-01)

[EN] Composite bridge optimization might be challenging because of the significant number of variables involved in the problem. The optimization of a box-girder steel¿concrete composite bridge was done in this study with ...
Diseño e implementación de técnicas metaheurísticas en transporte multimodal de mercancías con cadena de frio

Vélez Gutiérrez, Jesús Enrique (Universitat Politècnica de València, 2022-09-15)

[ES] Productos perecederos como lo son las vacunas que requieren mantener una temperatura constante o cadena de frío, proponen un reto a la hora de transportarse, aún más cuando este tipo de mercancía maneja condiciones ...
Diseño y análisis de metaheurísticas basadas en simulación para la optimización de la localización estática de vehículos de emergencias sanitarias

Gallego Andreu, Carlos (Universitat Politècnica de València, 2023-09-11)

[ES] Los vehículos de emergencia sanitaria (i.e., ambulancias) son un recurso escaso y costoso cuyo uso debe ser optimizado para garantizar la mejor calidad de servicio. En términos sanitarios, la calidad del servicio en ...
Diseño y aplicación de técnicas metaheurísticas en transporte multimodal

Claes, Sammy Jonathan (Universitat Politècnica de València, 2022-01-05)

[ES] Este trabajo se centra en el diseño y la implementación de un algoritmo genético que resuelve el problema de la ruta más corta y/o menos contaminante en la ciudad de Valencia y sus alrededores. Para ello, se utilizarán ...
Diseño y aplicación de técnicas metaheurísticas para control de tráfico

Hernández Yáñez, Marcos (Universitat Politècnica de València, 2021-10-07)

[ES] Cada año millones de euros son desperdiciados a nivel mundial a causa de la congestión de tráfico. Los retrasos provocados por esta congestión se traducen en una serie de consecuencias: reducción de la productividad, ...
Enhancing large-scale docking simulation on heterogeneous systems: An MPI vs rCUDA study

Imbernón, Baldomero; Prades Gasulla, Javier; Gimenez Canovas, Domingo; Cecilia, J. M.; Silla Jiménez, Federico (Elsevier, 2018-02)

[EN] Virtual Screening (VS) methods can considerably aid clinical research by predicting how ligands interact with pharmacological targets, thus accelerating the slow and critical process of finding new drugs. VS methods ...
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

Vallada Regalado, Eva; Villa Juliá, Mª Fulgencia; Fanjul-Peyro, Luis (Elsevier, 2019-11)

[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 ...