Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "linear constraints" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Deployment of a predictive-like optimal control law on a servo drive system using linear programming approach
Autorzy:
Horla, Dariusz
Pinczewski, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/27309954.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
constraints
linear programming
optimal control
servo drive
Opis:
Current drive control systems tend to push control loops to the limits of their performance. One of the ways of doing so is to use advanced optimization algorithms, usually related to model-based off-line calculations, such as genetic algorithms, the particle swarmoptimisation or the others. There is, however, a simpler way, namely to use predictive control formalism and by formulation of a simple linear programming problem which is easy to solve using powerful solvers, without excessive computational burden, what is a reliable solution, as whenever the optimization problem has a feasible solution, a global minimizer can be efficiently found. This approach has been deployed for a servo drive system operated by a real-time sampled-data controller, verified between model-in-the-loop and hardwarein- the-loop configurations, for a range of prediction horizons, as an attractive alternative to classical quadratic programming-related formulation of predictive control task.
Źródło:
Archives of Electrical Engineering; 2023, 72, 4; 1005--1016
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/206283.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
flowshop
parallel machines
resource constraints
heuristics
linear programming
genetic algorithms
simulated annealing
tabu search
Opis:
This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1209-1230
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies