Authors
Nechaev P.
|
Degree
|
2nd year student of the Master’s in Degree Development of software and information systems, Far Eastern Federal University |
|---|---|
|
E-mail
|
nechaev.p.v.25@gmail.com |
|
Location
|
Vladivostok |
|
Articles
|
Complex optimization problem of production-transport processesThis article contains a model of generalization of three previously known linear programming problems:
The production problem (Classical setting) — the solution is a vector of the number of produced
final products, found with limitations on the number of resources taking into account of maximization
of profit. The task of accounting for time — this task is rather an additional condition in the general
system of restrictions and relates to the objective function (minimization of the total time spent on the
transportation of goods), the transport task — determination of the ways and volume of transportation
of products on the graph (road system). The statement of the problem, which integrates all three of the
above problems into one integrated one, is exactly suited to the case when the task of determining the
volume of production of various types of products is followed by the determination of the transport
routes to each point of consumption (the consumer) so as to minimize, taking into account of capacity
of the graph roads) transportation costs. This task appeared on the timber-processing complex in the
process of production and sale of goods. This paper is devoted to constructing a linear mixed-integer
model, finding a method and selecting an algorithm for determining the optimal solution to the production
and transportation problem. This problem can be attributed to the class of non-trivial combinatorial
problems when making decisions at an enterprise.
Read more...
|
