Wyniki wyszukiwania - BazTech

1

Epidemiology-constrained Seating Plan Problem

Dąbkowski Jakub, Kacperski Przemysław, Kaleta Mariusz

Foundations of Computing and Decision Sciences

|

2022

|

Vol. 47, No. 3

235--246

EN

The emergence of an infectious disease pandemic may result in the introduction of restrictions in the distance and number of employees, as was the case of COVID-19 in 2020/2021. In the face of fluctuating restrictions, the process of determining seating plans in office space requires repetitive execution of seat assignments, and manual planning becomes a time-consuming and error-prone task. In this paper, we introduce the Epidemiology-constrained Seating Plan problem (ESP), and we show that it, in general, belongs to the NP-complete class. However, due to some regularities in input data that could affect computational complexity for practical cases, we conduct experiments for generated test cases. For that reason, we developed a computational environment, including the test case generator, and we published generated benchmarking test cases. Our results show that the problem can be solved to optimality by CPLEX solver only for specific settings, even in regular cases. Therefore, there is a need for new algorithms that could optimize seating plans in more general cases.

2

The Tabu Search approach in coherent co-synthesis of multiprocessors systems

Drabowski M., Czajkowski K.

Studia Informatica : systems and information technology

|

2006

|

Vol. 1(7)

31--45

EN

This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.

3

Survivability issues in IP-MPLS networks

Molisz W.

Systems Science

|

2005

|

Vol. 31, no 4

87-107

EN

A model for survivability assessment of IP-MPLS networks implemented directly in optical transport networks OTN (WDM) is described under assumptions as follows: end-to-end path protection; preplanned node-disjoint, dedicated or shared, backup path for each working path: distributed control of all top-down restoration actions: LSP-to-lightpath mapping minimizing the number of wavelengths converters. Survivability of such networks has a fundamental importance, since a single link cut can affect extremely large traffic volumes. The optimization problem ofsurvivable routing and wavelength assignment (SRWA) can be decomposed into a survivable routing followed by a wavelength assignment optimization problem. They are stated as the mixed integer and integer programming problems, respectively. Unfortunately, they both are NP-complete. Heuristic algorithms are proposed to solve the problems. The presented approach has been verified by means of simulation. Some results of the large number of simulation experiments investigating networks: DARPA. and NSF are described and discussed. Conclusions help in better understanding of survivability issues in IP-MPLS networks. All results are the original contribution and are published for the first time.