Structurally-Parametrical Optimization Technological Process by Dijkstra's Method in System Mathcad

Abstract:

The article describes the procedure of structurally-parametrical optimization of technological process by Dijkstra's method with using of Dijkstra’s functional (recurrent) equation and Mathcad system. The technological process includes n of operations and each operation can be executed by various types of equipment. Expenses (cost, time, ...) on execution of i operation by k equipment after execution by j equipment (i-1) operation are known - c (i, j, k). The algorithm of the decision of a problem by Dijkstra’s method includes two phases. The first phase is calculations of the minimum expenses for execution of all partial technological processes, from first operation of process to the last. The second phase is definition of the required optimum set of equipment which is carrying out all technological process with the minimum expenses from last operation of process to the first. The proposed procedure of structurally-parametrical optimization of technological process using Dijkstra’s method and Mathcad software significantly decreases time and labour costs on execution of such calculations and efficiently to execute investigations related with change of equipment parameters.

• Periodical: Materials Science Forum (Volume 931)
• Pages: 1238-1244
• DOI: https://doi.org/10.4028/www.scientific.net/MSF.931.1238
• Online since: September 2018
• Authors: Yevgeniy M. Kudryavtsev*
• Keywords: Algorithm, Dejkstra's Recurrence Formula, Mathcad, Program, Structurally-Parametrical Optimization, Technological Process

References

[1] E.M. Kudryavtsev, Mathcad 11. Russian Version Complete Guide, Moscow, DMK Press, (2005).

[2] E.M. Kudryavtsev, Mathcad 2000 Pro.The symbolical and numerical solution of different problems. Moscow, DMK, (2001).

[3] E.M. Kudryavtsev, Mathcad 8.The symbolical and numerical decision of different problems, Moscow, DMK, (2000).

[4] V.A. Ohorzin, Applied mathematics in system Mathcad: The manual, SPb.: Lan Pub., (2009).

[5] E.M. Kudryavtsev, V.V. Stepanov, Execution of final qualifying work on the computer. Moscow, BASTET, (2012).

[6] E.M. Kudryavtsev, Identification of Soil Excavation Operating Zone of Excavator Equipped with Backhoe Attachment, Procedia Engineering. 206 (2017) 1642-1647.

DOI: 10.1016/j.proeng.2017.10.691

[7] E.M. Kudryavtsev, Automatic Calculation Techniques for Soil Digging Force Applied by Bucket Swing, Procedia Engineering. 206 (2017) 1636-1641.

DOI: 10.1016/j.proeng.2017.10.690

[8] E.W. Dijkstra, Discipline of programming, Moscow, Mir, (1978).

[9] E.W. Dijkstra, K. Hoor. Structured Programming, Moscow, Mir, (1975).

[10] R. Bellman, S. Dreyfus, Applied Dynamic Programming, Moscow, Mir, (1962).

[11] R. Bellman, Dynamic programming, Moscow, Mir, (1957).

[12] R. Bellman, S. Dreyfus, Applied Dynamic Programming, Moscow, Mir, (1962).

[13] R. Bellman, Adaptive Control, a Guided Tour. Princeton, New Jersey, Princeton Univer. Press, (1961).

DOI: 10.1002/nav.3800080314

[14] R. Bellman, On a Routing Problem. Quarterly of Applied Mathematics. 16 (1957) 87-90.

[15] R. Ford, Jr., D. R. Fulkerson. Flows in Networks, Princeton University Press, (1962).

[16] E.W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik. 1  (1959) 269-271.

DOI: 10.1007/bf01386390

[17] J.B. Kruskal, On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem, Proc. Amer. Math. Soc. 7 (1956) 43-50.

DOI: 10.1090/s0002-9939-1956-0078686-7

[18] H. Loberman, A. Weinberger. Formal Procedures for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Соmр. Mach. 4 (1957) 428- 437.

DOI: 10.1145/320893.320896

[19] L.R. Ford. Network flow theory. Rand Corp. Paper, (1956).

[20] C. Berger: Theorie des graphes et ses applications, Dunod, Paris, (1958).