Page 1

Displaying 1 – 11 of 11

Showing per page

On approximation in multistage stochastic programs: Markov dependence

Vlasta Kaňková, Martin Šmíd (2004)

Kybernetika

A general multistage stochastic programming problem can be introduced as a finite system of parametric (one-stage) optimization problems with an inner type of dependence. Evidently, this type of the problems is rather complicated and, consequently, it can be mostly solved only approximately. The aim of the paper is to suggest some approximation solution schemes. To this end a restriction to the Markov type of dependence is supposed.

On heuristic optimization.

Ciobanu, Camelia, Marin Gheorghe (2001)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

On the application of insertion techniques for job shop problems with setup times

Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (2010)

RAIRO - Operations Research

Constructive heuristics for shop scheduling problems are often based on priority (or dispatching) rules. However, recent work has demonstrated that insertion algorithms that step by step insert operations or jobs into partial schedules usually clearly outperform priority rules. In this paper, we consider various job shop scheduling problems with setup times. For each job a specific technological route and a release date are given. Moreover, the jobs are partitioned into groups. A sequence independent...

On the solution of the constrained multiobjective control problem with the receding horizon approach

Daniele De Vito, Riccardo Scattolini (2008)

Kybernetika

This paper deals with a multiobjective control problem for nonlinear discrete time systems. The problem consists of finding a control strategy which minimizes a number of performance indexes subject to state and control constraints. A solution to this problem through the Receding Horizon approach is proposed. Under standard assumptions, it is shown that the resulting control law guarantees closed-loop stability. The proposed method is also used to provide a robustly stabilizing solution to the problem...

Optimization of touristic distribution networks using genetic algorithms.

Josep R. Medina, Víctor Yepes (2003)

SORT

The eight basic elements to design genetic algorithms (GA) are described and applied to solve a low demand distribution problem of passengers for a hub airport in Alicante and 30 touristic destinations in Northern Africa and Western Europe. The flexibility of GA and the possibility of creating mutually beneficial feed-back processes with human intelligence to solve complex problems as well as the difficulties in detecting erroneous codes embedded in the software are described. A new three-parent...

Currently displaying 1 – 11 of 11

Page 1