|
|
|
|
|
Francisco-David Hernandez, Domingo Cortes, Marco Antonio Ramirez-Salinas and Luis Alfonso Villa-Vargas
In control research and design it is frequently necessary to explore, evaluate, tune and compare many control strategies. These activities are assisted by software tools of increasing complexity; however, even with the existing high performance tools the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nasser Lotfi and Mazyar Ghadiri Nejad
Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorit...
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
|
|
|
|
|
|
|
|
|
|
|
Christian Haubelt, Luise Müller, Kai Neubauer, Torsten Schaub and Philipp Wanko
We address the problem of evolutionary system design (ESD) by means of answer set programming modulo difference constraints (AMT). The goal of this design approach is to synthesize new product variants or generations from existing products. We start by f...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pavel V. Matrenin
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stephen A. Adubi, Olufunke O. Oladipupo and Oludayo O. Olugbara
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics fo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Michal Berlinski, Eryk Warchulski and Stanislaw Kozdrowski
This paper presents a logistics problem, related to the transport of goods, which can be applied in practice, for example, in postal or courier services. Two mathematical models are presented as problems occurring in a logistics network. The main objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mingming Xu, Shuning Zhang and Guanlong Deng
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hossein R. Najafabadi, Tiago G. Goto, Mizael S. Falheiro, Thiago C. Martins, Ahmad Barari and Marcos S. G. Tsuzuki
Topology optimization (TO) of engineering products is an important design task to maximize performance and efficiency, which can be divided into two main categories of gradient-based and non-gradient-based methods. In recent years, significant attention ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Uday K. Chakraborty
The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the ...
ver más
|
|
|
|
|
|