|
|
|
|
|
Christoph Laroque, Madlene Leißau, Pedro Copado, Christin Schumacher, Javier Panadero and Angel A. Juan
Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem considers a production where a large number of heterogeneo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Juan Reca, Juan Martínez and Rafael López
This work presents a new approach to increase the efficiency of the heuristics methods applied to the optimal design of water distribution systems. The approach is based on reducing the search space by bounding the diameters that can be used for every ne...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ivana Strumberger, Nebojsa Bacanin , Milan Tuba and Eva Tuba
The cloud computing paradigm, as a novel computing resources delivery platform, has significantly impacted society with the concept of on-demand resource utilization through virtualization technology. Virtualization enables the usage of available physica...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nicolas Dupin, Rémi Parize and El-Ghazali Talbi
This paper considers a variant of the Vehicle Routing Problem with Time Windows, with site dependencies, multiple depots and outsourcing costs. This problem is the basis for many technician routing problems. Having both site-dependency and time window co...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nicolas Dupin and El-Ghazali Talbi
This paper studies the hybridization of Mixed Integer Programming (MIP) with dual heuristics and machine learning techniques, to provide dual bounds for a large scale optimization problem from an industrial application. The case study is the EURO/ROADEF ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stanley Jefferson de Araújo Lima, Sidnei Alves de Araújo, Pedro Henrique Triguis Schimit
Pág. e36708
This work presents a hybrid approach called GA-NN for solving the Capacitated Vehicle Routing Problem (CVRP) using Genetic Algorithms (GA) and Nearest Neighbor heuristic (NN). The first technique was applied to determine the groups of customers to be ser...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stanley Jefferson de Araújo Lima, Sidnei Alves de Araújo, Pedro Henrique Triguis Schimit (Author)
Pág. e36708
This work presents a hybrid approach called GA-NN for solving the Capacitated Vehicle Routing Problem (CVRP) using Genetic Algorithms (GA) and Nearest Neighbor heuristic (NN). The first technique was applied to determine the groups of customers to be ser...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rocco A. Scollo, Antonio G. Spampinato, Georgia Fargetta, Vincenzo Cutello and Mario Pavone
Disease phenotypes are generally caused by the failure of gene modules which often have similar biological roles. Through the study of biological networks, it is possible to identify the intrinsic structure of molecular interactions in order to identify ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bernard Zeigler
The DEVS formalism has been recognized to support generic open architectures that allow incorporating multiple engineering domains within integrated simulation models. What is missing for accelerated adoption of DEVS-based methodology for intelligent cyb...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mattia Neroni, Massimo Bertolini and Angel A. Juan
In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to minimiz...
ver más
|
|
|
|
|
|
|
|
|
|
|
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca...
ver más
|
|
|
|
|
|
|
|
|
|
|
Armin Lüer Villagra, Bárbara Venegas Quintrileo, Jaime Bustos Gómez
El objetivo de este trabajo es poner a prueba distintos enfoques de paralelización (sincrónico, cooperativo, centralizado, etc.) para las metaheurísticas empleadas, en los algoritmos de resolución del problema de las p-medianas. Un análisis posterior arr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yongjun Chen, Wenhao Wu, Pengfei Jiang and Chengpeng Wan
The path planning of unmanned ships in complex waters using heuristics usually suffers from problems such as being prone to fall into the local optimum, slow convergence, and instability in global path planning. Given this, this paper proposes a Self-Ada...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wangwang Yan, Yan Chen, Jinlong Shi, Hualong Yu and Xibei Yang
Attribute reduction is commonly referred to as the key topic in researching rough set. Concerning the strategies for searching reduct, though various heuristics based forward greedy searchings have been developed, most of them were designed for pursuing ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christin Schumacher and Peter Buchholz
In modern production systems, scheduling problems have to be solved in consideration of frequently changing demands and varying production parameters. This paper presents a approach combining forecasting and classification techniques to predict uncertain...
ver más
|
|
|
|
|
|