Dmitry Krushinsky

• PhD
• Lecturer at Wageningen University & Research

Additive manufacturing opens promising perspectives for realizing acoustic metamaterials to control sound in multiple application scenarios. Especially attractive are hybrid flexible-rigid 3D-printed metastructures as they combine the advantages of rigid designs (e.g., load-bearing performance) and an increased number of structural degrees of freed...

Artificial wings composed of rigid and flexible materials enable flapping flight accompanied by sound. Understanding the acoustics of natural insect wings allowed to explain basic mechanisms of sound generation by artificial wings. This work proposes the use of metamaterial surface patterns to control the acoustic and aerodynamic characteristics of...

Insect wings are formed by intricate combinations of flexible membranes and rigid veins; such a structure enables excellent flight performance, adaptability to aerodynamic forces, and different biological functions. A comprehensive understanding of the interplay between wing patterning and flight dynamics has however not been achieved yet due to th...

Phononic materials are artificial composites with unprecedented abilities to control acoustic waves in solids. Their performance is mainly governed by their architecture, determining frequency ranges in which wave propagation is inhibited. However, the dynamics of phononic materials also depends on the mechanical and material properties of their co...

Phononic materials are artificial composites with unprecedented abilities to control acoustic waves in solids. Their performance is mainly governed by their architecture, determining frequency ranges in which wave propagation is inhibited. However, the dynamics of phononic materials also depends on the mechanical and material properties of their co...

In traditional parcel delivery operations, customers determine delivery locations and, hence, the performance of a transporter. We exploit this idea and show that customers can improve the efficiency of a transporter by giving the latter flexibility in choosing the delivery locations. Two possible policies to enable this flexibility are presented a...

In this chapter we introduce the notion of a “pattern” in the Linear Assignment Problem and show that patterns may be useful to create new insights and approaches for many combinatorial optimization problems defined on a rectangular input matrix. We define a pattern as a specific collection of cells in the rectangular matrix reflecting the structur...

We consider two stochastic variants of the Share-a-Ride problem: one with stochastic travel times and one with stochastic delivery locations. Both variants are formulated as a two-stage stochastic programming model with recourse. The objective is to maximize the expected profit of serving a set of passengers and parcels using a set of homogeneous v...

New city logistics approaches are needed to ensure efficient urban mobility for both people and goods. Usually, these are handled independently in dedicated networks. This paper considers conceptual and mathematical models in which people and parcels are handled in an integrated way by the same taxi network. From a city perspective, this system has...

The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study the problem of determining the time slack in a SARP schedule. Our proposed solution approach is tes...

Despite the fact that the Capacitated Arc Routing Problems (CARPs) received substantial attention in the literature, most of the research concentrates on the symmetric and single-depot version of the problem. In this paper, we fill this gap by proposing an approach to solving a more general version of the problem and analysing its properties. We pr...

The book aimed on a development of optimal, flexible and efficient models for cell formation in group technology. By optimality we mean guaranteed quality of the solutions provided by the model, by flexibility – possibility of taking additional constraints and objectives into account, by efficiency – reasonable running times (e.g., taking into acco...

This chapter focuses on the p-median problem based approach to cell formation. A PMP-based model is described in detail and its performance is analysed theoretically and experimentally, both in terms of the solution quality and running times.

This chapter provides a general overview of the cell formation problem, including the origins of the problem, a discussion on the relevance of a cellular layout together with its advantages and drawbacks, and an overview of the solution approaches. The notions of dissimilarity and performance measures are also considered in this chapter. Furthermor...

In this chapter we propose a bi-criterion branch-and-bound algorithm for the cell formation problem. We demonstrate the performance of the algorithm by solving problems from the literature and comparing the results with complete enumeration as well as with the results of metaheuristic algorithms from the literature.

This chapter discusses the appropriateness of the standard objective of minimising intercell movement, and considers possible alternative objectives for cell formation, including maximisation of intracell movement, minimisation of cross-training costs and minimisation of set-up times. The viable ways of combining several objectives in one formulati...

In this chapter we consider an exact model for cell formation, i.e. the model that directly minimises the amount of intercell movement. We show that the exact model is equivalent to the minimum multicut problem defined on an appropriate graph. Two MILP formulations are proposed and their performance is analysed using instances from the literature a...

In this chapter we introduce a new pattern-based approach within the Linear Assignment Model with the purpose to design heuristics for a combinatorial optimization problem (COP). We assume that the COP has an additive (separable) objective function and the structure of a feasible (optimal) solution to the COP is predefined by a collection of cells...

The book is focused on relevant and effective mathematical models for solving the cell formation (CF) problem, i.e., grouping machines into manufacturing cells such that the principles of group technology are implemented. Despite its long history and hundreds of published papers, very few attempts of solving the problem to optimality are known. At...

This chapter focuses on the p-median problem (PMP) and its properties. We consider a pseudo-Boolean formulation of the PMP, demonstrate its advantages and derive the most compact MILP formulation for the PMP within the class of mixed-Boolean linear programming formulations. Further, we develop two applications of the pseudo-Boolean approach: a cons...

Modern industry puts a lot of challenges on all the people involved. High quality standards and high customisation, tight deadlines and small volumes of orders --- all this already poses a lot of problems to the managers, industrial engineers, and ordinary workers. Add to this a fierce competition in the market, and the picture becomes even more dr...

Lately, the problem of cell formation (CF) has gained a lot of attention in the industrial engineering literature. Since it was formulated (more than 50 years ago), the problem has incorporated additional industrial factors and constraints while its solution methods have been constantly improving in terms of the solution quality and CPU times. Howe...

Despite the long history of the cell formation problem (CF) and availability of dozens of approaches, very few of them explicitly optimize the objective of cell formation. These scarce approaches usually lead to intractable formulations that can be solved only heuristically for practical instances. In contrast, we show that CF can be explicitly mod...

Lately, the problem of cell formation (CF) has gained a lot of attention in the industrial engineering literature. Since it was formulated (more than 50 years ago), the problem has incorporated additional industrial factors and constraints while its solution methods have been constantly improving in terms of the solution quality and CPU times. Howe...

This paper presents and discusses the concept of Periodic Virtual Cell Manufacturing (P-VCM). After giving an illustrative example of the operation and design complexity of a P-VCM system, we present an industrial case to study the applicability of the concept. The illustrative example and the industrial case indicate the context for which P-VCM is...

The paper is aimed at experimental evaluation of the complexity of the p-Median problem instances, defined by m×n costs matrices, from several of the most widely used libraries. The complexity is considered in terms of possible problem size reduction and preprocessing, irrespective of the solution algorithm. We use a pseudo-Boolean representation o...

In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances from OR and some other libraries we are able to solve to opt...

One of the most prospective new methodologies for modelling is the so‐called cellular automata (CA) approach. According to this paradigm, the models are built from simple elements connected into regular structures with local interaction between neighbours. The patterns of connections usually have a simple geometry (lattices). As one of the classica...

Real world models of large-scale crowd movement lead to computationally intractable problems implied by various classes of non-linear stochastic differential equations. Recently, cellular automata (CA) have been successfully applied to model the dynamics of vehicular traffic, ants and pedestrians’ crowd movement and evacuation without taking into a...

Trust management is turning out to be essential for further and wider acceptance of contemporary IT solutions. In IT world it was first addressed some ten years ago when the suggested approaches were actually tackling security and not trust directly. ...

In this paper an issue of mentality simulation in cellular automata (CA) models of pedestrian traffic is addressed. Anticipation, as one of the major mental properties, plays an important role in behavior of real pedestrians, allowing them to use additional information in a form of sensual perception, knowledge and experience, etc. for optimization...

Mechanisms of endowing cellular automata (CA) models with anticipation property are considered. As a background for investigation a widely known Conway’s game of ‘Life’ was chosen. Even within this simple model, introduction of anticipation has a crucial impact on the behavior of the system, resulting in emergence of multiple co-existing solutions....

This article deals with mathematical modeling of cr owd movement using cellular automata (CA) and it possible applications in the optimization, d esign and management problems. The mathematical models of pedestrian motion by means of cellular automata are described with useful accounting of real geometry and geography. Results of calculation are re...