Discrete Programming Model Research Articles

The model of choosing a microcontroller for the environmental monitoring system module

Problem. The development and application of modern digital technologies for environmental monitoring is an extremely relevant issue. Such environmental monitoring systems allow for dynamic monitoring of the current state of the studied territories in order to further analyze changes and make decisions on their conservation and development. To improve the environmental situation, it is necessary to constantly improve environmental monitoring systems by creating local environmental monitoring systems operating in real time. Goal. The aim of the study is to develop a model for selecting a microcontroller for an environmental monitoring module based on many functional and cost criteria, which will reduce the time of information collection for a regional environmental monitoring system. Methodology. To achieve this goal, we analyzed the characteristics of microcontrollers. A model for selecting a microcontroller for an environmental monitoring module has been developed based on many functional and cost criteria. An example of using the microcontroller selection model for the environmental monitoring module is given. The method of multicriteria optimization allows the selection of a microcontroller for the module of the environmental monitoring system by calculating the utility function. Results. The paper considers the main tasks of the environmental monitoring system. A mathematical model for selecting a microcontroller for the module of an environmental monitoring system has been developed. It belongs to the class of multicriteria discrete programming models and, unlike the known ones, takes into account the system requirements for the module of the environmental monitoring system as a whole. Originality. The developed model allows us to make a microcontroller according to many functional and cost criteria under conditions of fuzzy input information. Practical value. The use of the proposed model for selecting a microcontroller for the module of the environmental monitoring system will reduce the time of collecting information for the regional environmental monitoring system.

Pick up plan in the case of a shuttle racks warehouse – an optimization approach

The shuttle racks system is dedicated to storing fast-moving goods on homogeneous pallets, while ensuring high efficiency in the use of storage space. The radioshuttle system consist of shuttle channels and a remote controlled transfer trolley. The research problem considered scientifically is to develop the tools to plan collecting products from the location of shuttle racks that guarantee a minimum number of blockages. The linear programming model ensures that the goods are picked up from the shuttle location which minimizes the number of blockages or completely eliminates them. The main aim is to present a method and an algorithm of the shuttle racks system that will plan storage location before storing goods on the racks based on backorders. As a result, goods are located lengthwise in the shuttle tunnel according to the order in linear, discrete programming models. The work presents the model and verifies the basic characteristics of the problems analysed and the solution obtained

Optimal sea floor placement of the oil/gas production equipment

In the construction designing of oil field surface facilities, exists a problem of the seabed production equipment optimal placement. As an initial approximation, we can represent this task in the form of the linear Boolean programming problem. An application of routine methods of discrete programming can theoretically give the desired solution. However, these methods do not take into account the specific nature of the problem. This problem belongs to the NP class. So we can run into significant computational difficulties. This situation is typical for construction of the ground surface or subsea located facilities for real oil/gas fields. To overcome it, we propose to replace a discrete programming model with a linear programming one, which takes into account problem-specific properties. Also, we present examples of the application of the proposed parallel optimization algorithms. Input data for them: the seabed profile, geometry, and space distribution of oil/gas reserves. Optimization problem objective function is the penalty for the irrational placement of seabed production equipment elements.

Research of Enterprise Storage Ecosystem Based on Storage Theory and Nonlinear Discrete Optimization

Warehousing and transferring strategies are an important part of business operations. The issue of optimal warehousing and transferring strategy is studied in this paper. Wal-Mart in Wuhan serves as an example to establish a (s, S) random storage strategy model, a Markov chain model, and a nonlinear discrete programming model, aiming at maximizing the profit per cycle of every branch and further maximizing the company’s total profit per cycle. Among them, the random storage strategy model establishes a security zone of inventory for every branch, that is, it can meet consumers’ demand without spending too much storage costs. The Markov chain model is used to get the probability of losing sales opportunities in every branch. The nonlinear discrete programming model takes into account the horizontal transferring among branches, which further maximizes the company’s overall profit expectations. The three models above can be used to formulate inventory strategies, assess risks, and provide advice for every branch in order to form a complete storage ecosystem and provide constructive suggestions for the company’s operations.

Математическая модель распределения технологических операций по рабочим местам поточно-конвейерной системы

The problem of optimal allocation of jobs by work stations of flow-line conveyor system boils down to a class of extremum problems, which, in turn, can be narrowed down to discrete programming models. The paper offers a mathematical model designed to allocate operations for manufacturing certain product by flow-line conveyor work stations. The model is built with due regard to operations procedure limitations and can be used to design flow-line conveyor system for the purpose of parameters optimization.

Planning the Trajectories of Land and Development Rights Rents via Discrete Programming Models

The Koopmans and Beckmann assignment model approach to problems of urban economics has led to considerable discussion. In our recent papers some of the issues raised were reviewed and also extensions that resolve many of the dilemmas suggested by the original model were proposed. Most of the approaches surveyed in our previous paper make little use of the duality properties of the assignment model. In the present paper it is argued that, under certain circumstances, dual variables interpretable as site rents and other dual variables that suggest the values of transferable development rights (TDRs) appear with model solutions. This view enhances the importance of assignment models to city planners and sheds light on how planners can guide optimal development along with the implementation of TDR policies.

Shape considerations in spatial optimization

Abstract The land allocation problem is one of selecting, from a set of available land units or parcels, a subset of units displaying certain desirable characteristics or having special morphology. Several discrete programming models are presented for the problem of allocating an area of land for development when the shape of the resulting land area is a primary concern. The solution procedure is shown to be satisfactory for small to medium sized problems and can accommodate simple (rectangular) shapes.

Iterative procedure for equilibrium network traffic signal setting

The Equilibrium Network Traffic Signal Setting problem is an open research area. It can be approached using global optimization models or iterative procedures. In this paper, after a brief review of the state of the art, the main characteristics of the iterative procedure ENETS are described. In this procedure, traffic signal setting is performed in two successive steps: green timing and scheduling at each junction, and signal coordination on the network. Green timing and scheduling at a single junction is based on a mixed-binary linear program with capacity factor maximization. Signal coordination for the whole network is performed by solving a discrete programming model with total delay minimization. The flow assignment stage refers to the separable user equilibrium model with fixed demand, and uses a feasible direction algorithm, which can also be adopted to cover the cases of elastic demand and/or asymmetric equilibrium. An experimental test of ENETS on a small network and a graphical explanation of the procedure are described and discussed.

Endogenizing the Rise and Fall of Urban Subcenters via Discrete Programming Models

Models that represent the polycentric and dispersed nature of modern cities should be able to account for the rise and fall of subcenters. Based on a review of the programming models applied to urban analysis, five properties are suggested that an adequate model should include. It should: 1 confront the simultaneity between markets for land and transportation services; 2 accommodate the reality of cities as places where externalities and common properties abound; 3 emulate the intertemporal albeit bounded nature of planning and decisionmaking; 4 fully exploit principles of economic theory; and, 5 offer computability. We develop a discrete programming model with these five properties, comparing its capabilities with those of previous approaches.

Method for solving A special integer programming problem

The solution of discrete progra11~ing problems is attracting ever increasing attention, primarily due to their importance for various scientific and engineering subjects. Various discrete programming models have been used to describe many important problems of planning, management, and design. In particular, a wide variety of transportation scheduling problems may be formally represented by models of this kind.

Discrete Programs for Moving Known Cargos from Origins to Destinations on Time at Minimum Bargeline Fleet Cost

A bargeline which accepts various cargos for timely delivery between pairs of ports in its district must determine the routing and timing of movements of barges and towboats to execute the agreed freight movements at minimum fleet cost. A linear discrete programming model of this optimization problem is developed. The cargo movements to be made and the times needed for transit, loading, and unloading are assumed known. A solution of the model gives the numbers of barges and towboats of each size required to provide the service, with the consequent minimal cost. It also provides a complete schedule for the bargeline, specifying the location and status of the barges, boats, and freight at every time unit of the scheduling period.