An integrated model for the transshipment yard scheduling problem

A hub-and-spoke railway system is an efficient way of handling freight transport by land. A modern rail–rail train yard consists of huge gantry cranes that move the containers between the trains. In this context, we consider a rail–rail transshipment yard scheduling problem (TYSP) where the containers arrive to the hub and need to be placed on a train that will deliver them to their destination. In the literature, the problem is decomposed hierarchically into five subproblems, which are solved separately. First, the trains have to be grouped into bundles in which they visit the yard. Next, the trains have to be assigned to tracks within these bundles, namely parking positions. Then the final positions for the containers on trains have to be determined. Next, the container moves that need to be performed are assigned to the cranes. Finally, these moves have to be sequenced for each crane for processing. In this paper, an integrated MILP model is proposed, which aims to solve the TYSP as a single optimization problem. The proposed formulation also enables us to define more robust and complex objective functions that include key characteristics from each of the above-mentioned subproblems. The strength of our proposed formulation is demonstrated via computational experiments using the data from the literature. Indeed, the results show that the TYSP can be solved without the use of decomposition techniques and more insight can be obtained from the same input data used to solve particular single decomposed subproblems.     

Algebraic Constructions: A Simple Framework for Complex Dependencies and Parameterisation

We propose a simple framework of algebraic constructions for software specification, modular design and development. Algebraic constructions generalise (parameterised) modules by allowing on one hand a rather arbitrary collection of elements to form the parameter and on the other hand dependencies between the module elements to be spelled out explicitly. Algebraic constructions are specified in a very natural way by means of ordinary algebraic specifications. They are combined using a sum operation which captures as special cases various operations on (parameterised) modules offered by standard specification and development frameworks. We show the expected composability result for the sum of algebraic constructions and of their specifications.     

The influence of zinc ions discharged in a non-aqueous cell on a copper catalyst on the rate of cyclohexanol dehydrogenation reaction

Results of studies on the influence of a copper catalyst modification with zinc ions on the activity in the reaction of cyclohexanol dehydrogenation are presented. The modification has been performed by electrochemical discharging-insertion of zinc ions on a copper electrode in a non-aqueous cell. It has been demonstrated that the catalyst activity depends on the amount of discharged zinc ions as well as on the nature and concentration of the electrolyte. In the case of zinc ions discharged from a solution of ZnCl₂ in propylene carbonate, the yield of cyclohexanone increased up to five times and using Zn(BF₄)₂ in dimethylformamide almost twenty times. The activity of the system in the competing reaction of dehydration was low, hence the selectivity in the dehydrogenation reaction was high.     

Modeling computational limitations in H-Phy and Overlay-NoC architectures

High performance computing demands constant growth in computational power and services that can be offered by modern supercomputers. It requires technological and designing advances in the multiprocessor internal structures as well as novel computing models considering the very high computing demands. One of the increasingly important requirements of computing platforms is a functionality that allows efficient managing computational resources, i.e., monitor them, restrict an access to some part of the resources, account for computational service, or ensure reliability and quality of service when some resources are broken or disabled. In this paper, we present a new model describing computational limitations for processing tasks on multiprocessor systems. The model is implemented in Hardware-Physical (H-Phy) and Overlay-Network-on-Chip (Overlay-NoC) architectures. Both architectures and the model are described and analyzed. Experimentation system is also presented, together with simulation assumptions, results of research and their study. The paper provides complete models of H-Phy and Overlay-NoC structures with an ability to restrict processing resources.     

Studies on the mechanical properties of steel–TiB2 composites obtained by high pressure sintering

The currently used composites produced by classical sintering methods are characterised by numerous limitations due to the difficulties in combining different materials with extreme properties. One of the ways to overcome these limitations is in the use of modern sintering methods, including the high pressure-high temperature process. This study describes the composite materials based on 316L austenitic steel reinforced with titanium diboride and examines the effect of sintering conditions on the mechanical properties and microstructure of sintered composites. It has been found that the key parameter in the manufacture of composites with optimal properties is the sintering time and temperature, while martensitic transformation taking place in the composite matrix can be controlled by the properly selected pressure applied during the sintering process.     

Physicochemical and electrochemical properties of the carbon materials containing nitrogen and cobalt derived from acetonitrile and Co–Al layered double hydroxides

Two sets of the carbon materials containing nitrogen and cobalt were prepared by simultaneous carbonization of CH₃CN and decomposition of Co–Al layered double hydroxides (LDHs) (of Co/Al atomic ratios equal to 2 or 3) at 600, 700 and 800 °C followed by treatment with HCl. The physicochemical features of the samples were characterized by means of XRD, TG, EA, XPS, XRF, FT-IR, SEM, Raman spectroscopy and nitrogen sorption. All of the composites were active in oxygen reduction reaction (ORR) in alkaline medium. Their ORR behaviour was determined by the contribution of structural defects and N-doping in graphitic lattice. The beneficial effect of metallic cobalt encapsulated inside the N-CNTs on the ORR performance was also taken into consideration. The studies showed that the likelihood of the existence of Co–N–C species and their participation in ORR seemed to be suppressed by the formation of CoAl₂O₄. The samples prepared at 600 and 700 °C appeared to be more active in ORR than that obtained at 800 °C. The number of electrons involved in ORR (2.89, 2.82 and 2.77) decreased with increasing synthesis temperature for the samples prepared with LDHs of Co/Al?=?2 as a consequence of lowering concentration of nitrogen (3.2, 2.4 and 1.5 wt%), in particular diminishing contribution of pyridinic nitrogen, and decreasing exposure of graphitic edges (I_D1/I_G?~?2.6, 2.0 and 1.0). The ORR performance of the samples prepared with LDHs of Co/Al?=?3 is comparable to that of the corresponding samples prepared with LDHs of Co/Al?=?2.     

Genetic algorithm with binary representation of generating unit start-up and shut-down times for the unit commitment problem

An approach for solving the unit commitment problem based on genetic algorithm with binary representation of the unit start-up and shut-down times is presented. The proposed definition of the decision variables and their binary representation reduce the solution space and computational time in comparison to the classical genetic algorithm approach to unit commitment. The method incorporates time-dependent start-up costs, demand and reserve constraints, minimum up and down time constraints and units power generation limits. Penalty functions are applied to the infeasible solutions. Test results showed an improvement in effectiveness and computational time compared to results obtained from genetic algorithm with standard binary representation of the unit states and other methods.     

Multimodal processes optimization subject to fuzzy operation time constraints: declarative modeling approach

We present an extension of the resource-constrained multi-product scheduling problem for an automated guided vehicle (AGV) served flow shop, where multiple material handling transport modes provide movement of work pieces between machining centers in the multimodal transportation network (MTN). The multimodal processes behind the multi-product production flow executed in an MTN can be seen as processes realized by using various local periodically functioning processes. The considered network of repetitively acting local transportation modes encompassing MTN’s structure provides a framework for multimodal processes scheduling treated in terms of optimization of the AGVs fleet scheduling problem subject to fuzzy operation time constraints. In the considered case, both production takt and operation execution time are described by imprecise data. The aim of the paper is to present a constraint propagation (CP) driven approach to multi-robot task allocation providing a prompt service to a set of routine queries stated in both direct and reverse way. Illustrative examples taking into account an uncertain specification of robots and workers operation time are provided.     

Parallel implementation of background subtraction algorithms for real-time video processing on a supercomputer platform

Results of evaluation of the background subtraction algorithms implemented on a supercomputer platform in a parallel manner are presented in the article. The aim of the work is to chose an algorithm, a number of threads and a task scheduling method, that together provide satisfactory accuracy and efficiency of a real-time processing of high-resolution camera images, maintaining the cost of resources usage at a reasonable level. Two selected algorithms: the Gaussian mixture models and the Codebook, are presented and their computational complexity is discussed. Various approaches to the parallel implementation, including assigning the image pixels to threads, the task scheduling methods and the thread management systems, are presented. The experiments were performed on a supercomputer cluster, using a single machine with 12 physical cores. The accuracy and performance of the implemented algorithms were evaluated for varying image resolutions and numbers of concurrent processing threads. On a basis of the evaluation results, an optimal configuration for the parallel implementation of the system for real-time video content analysis on a supercomputer platform was proposed.     

On aggregation in multiset-based self-assembly of graphs

We continue the formal study of multiset-based self-assembly. The process of self-assembly of graphs, where iteratively new nodes are attached to a given graph, is guided by rules operating on nodes labelled by multisets. In this way, the multisets and rules model connection points (such as “sticky ends”) and complementarity/affinity between connection points, respectively. We identify three natural ways (individual, free, and collective) to attach (aggregate) new nodes to the graph, and study the generative power of the corresponding self-assembly systems. For example, it turns out that individual aggregation can be simulated by free or collective aggregation. However, we demonstrate that, for a fixed set of connection points, collective aggregation is rather restrictive. We also give a number of results that are independent of the way that aggregation is performed.