Seite - 151 - in Algorithms for Scheduling Problems
Bild der Seite - 151 -
Text der Seite - 151 -
Algorithms 2018,11, 57
Specialized methods
and algorithms
General methods
and algorithms direct methods
and algorithms Euler method
Ritz-Galerkinâs method
special methods of nonlinear
programming
Methods and algorithms of optimal control
indirect methods
and algorithms methods of reduction
to finite-dimensional
problems
methods of state-
space search
methods of gradient
notion in control
space gradient methods of
unconstrained optimization
methods of gradient projection
gradient methods based on
penalty functions
methods and algorithms based
on Bellmanâs principle of
optimality
methods and algorithms of
variations in a state space
methods and algorithms for
two-point boundary problems
methods of successive
approximations
methods of perturbation theory
methods based on
necessary conditions
of optimal control
methods of state-
space search combined methods
methods and algorithms for linear-
problems of optimal control
approximate analytical methods and
algorithms methods and algorithms for
linear time-minimization
problems
methods and algorithms for
linear problems with
quadratic objective functions
methods and algorithms for
quasi-linear systems
methods and algorithms for
system with weak
controlability
averaging approximate
methods and algorithms
\ \
U\
\ U\
U Figure2.Optimalcontrol computationalmethods.
Newtonâs method and its modiïŹcations. For the ïŹrst iteration of the method, an initial
approximationÏ(T0) = Ï(0)(T0) is set. Then, the successive approximations are received from
theformula:
Ï(r)(T0)=Ï(râ1)(T0)â [
âÏ(râ1)(Tf)
âÏ(râ1)(T0) ]
Ï(râ1)(Tf) (11)
whereÏ(r)(Tf)=aâx(râ1)(Tf), r=1,2, . . . .
Theoperationofpartialderivation,beingperformedatall iterations, is rathercomplicated.Here
thederivativematrix:
Î Ë= (
âÏ(râ1)(Tf)
âÏ(râ1)(T0) )
(12)
shouldbeevaluated.
ThismatrixcanbereceivedeitherviaïŹnite-difference formulasorviaavariational integration
of thesystem.ModiïŹcationof themethodcanalsobeused. The followingmethod is the simplest.
Theformula (11) is substitutedfor:
Ï(r)(T0)=Ï(râ1)(T0)âÎł(r)Î Ëâ1Ï(râ1)(Tf) (13)
151
zurĂŒck zum
Buch Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
- Titel
- Algorithms for Scheduling Problems
- Autoren
- Frank Werner
- Larysa Burtseva
- Yuri Sotskov
- Herausgeber
- MDPI
- Ort
- Basel
- Datum
- 2018
- Sprache
- englisch
- Lizenz
- CC BY 4.0
- ISBN
- 978-3-03897-120-7
- Abmessungen
- 17.0 x 24.4 cm
- Seiten
- 212
- Schlagwörter
- Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
- Kategorien
- Informatik
- Technik