Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Metaheuristics"

Mostrando ítems 1-20 de 52

Página siguiente

A decision-making tool for algorithm selection based on a fuzzy TOPSIS approach to solve replenishment, production and distribution planning problems

Guzmán-Ortiz, Brunnel Eduardo; Andres, B.; Poler, R. (MDPI AG, 2022-05)

[EN] A wide variety of methods and techniques with multiple characteristics are used in solving replenishment, production and distribution planning problems. Selecting a solution method (either a solver or an algorithm) ...
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 hybrid metaheuristic with learning for a real supply chain scheduling problem

Pérez, Christian; Climent, Laura; Nicoló, Giancarlo; Arbelaez, Alejandro; Salido, Miguel A. (Elsevier, 2023-11)

[EN] In recent decades, research on supply chain management (SCM) has enabled companies to improve their environmental, social, and economic performance.This paper presents an industrial application of logistics that can ...
A Learnheuristic Algorithm for the Capacitated Dispersion Problem with Dynamic Conditions

Gómez, Juan F.; Uguina, Antonio R.; Panadero, Javier; Juan, Angel A. (MDPI AG, 2023-12)

[EN] The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain ...
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 ...
A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances

Kizys, Renatas; Doering, Jana; Juan, Angel A.; Polat, Onur; Calvet, Laura; Panadero, Javier (Elsevier, 2022-03)

[EN] The goal of the portfolio optimization problem is to minimize risk for an expected portfolio return by allocating weights to included assets. As the pool of investable assets grows, and additional constraints are ...
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 adaptive differential evolution algorithm to solve the multi-compartment vehicle routing problem: A case of cold chain transportation problem

Sankul, Supaporn; Supattananon, Naratip; Akararungruangkul, Raknoi; Wichapa, Narong (Universitat Politècnica de València, 2024-01-31)

[EN] This research paper introduces an adaptive differential evolution algorithm (ADE algorithm) designed to address the multi-compartment vehicle routing problem (MCVRP) for cold chain transportation of a case study of ...
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 ...
Assignment and Take-Off Approaches for Large-Scale Autonomous UAV Swarms

Wubben, Jamie; Hernandez, Daniel; Cecilia-Canales, José María; Imberón, Baldomero; Tavares De Araujo Cesariny Calafate, Carlos Miguel; Cano, Juan-Carlos; Manzoni, Pietro; Toh, Chai Keong (Institute of Electrical and Electronics Engineers, 2023-05)

[EN] In the last decade, the popularity of UAVs has increased tremendously. Nowadays, many researchers are interested in UAV swarms. Coordinating a swarm of UAVs is a complicated task and many problems should be addressed ...
Combining production and distribution in supply chains: The hybrid flow-shop vehicle routing problem

do C. Martins, Leandro; Gonzalez-Neira, Eliana M.; Hatami, Sara; Juan, Angel A.; Montoya-Torres, Jairo R. (Elsevier, 2021-09)

[EN] Many supply chains are composed of producers, suppliers, carriers, and customers. These agents must be coordinated to reduce waste and lead times. Production and distribution are two essential phases in most supply ...
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á ...