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

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.

Download Full-text

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

Environment and Planning A Economy and Space ◽

10.1068/a211195 ◽

1989 ◽

Vol 21 (9) ◽

pp. 1195-1203 ◽

Cited By ~ 8

Author(s):

P Gordon ◽

J E Moore

Keyword(s):

Economic Theory ◽

Programming Model ◽

Programming Models ◽

Adequate Model ◽

Transportation Services ◽

Modern Cities ◽

Urban Analysis ◽

Discrete Programming

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.

Download Full-text

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

Informatyka Ekonomiczna ◽

10.15611/ie.2020.1.03 ◽

2020 ◽

Vol 2020 (1(55)) ◽

pp. 38-59

Author(s):

Dawid Kansy

Keyword(s):

High Efficiency ◽

Programming Model ◽

Research Problem ◽

Programming Models ◽

Optimization Approach ◽

Storage Space ◽

Storage Location ◽

Minimum Number ◽

Basic Characteristics ◽

Discrete Programming

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

Download Full-text