Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Technical Sciences / University of Warmia and Mazury in Olsztyn

2 2018

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications

100%

Miatselski M.

Technical Sciences / University of Warmia and Mazury in Olsztyn

2018

tom nr 21(1)

37--47

A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.

An integer optimization model and algorithms to support the cost-revenue study and provisory designing warehouses or other storage objects

51%

Miatselski M. , Staruch B. , Staruch B.

Technical Sciences / University of Warmia and Mazury in Olsztyn

2018

tom nr 21(4)

257--269

An optimization model for the cost–revenue study at the stage of system analysis and preliminary designs of storage objects such as warehouses, containers, packs and similar objects are developed. Our assumptions motivated by warehouses design lead us to a nonlinear integer optimization problem with the only basic constraint. We present algorithmic methods for obtaining the exact solution to the general problem with emphasizing the special case when both the objective and the constraint functions are increasing. The results of the paper may be used in developing software tools intended for supporting designers.