Научная статья на тему 'PATH PLANNING FOR CHEMICAL ENGINEERING'

PATH PLANNING FOR CHEMICAL ENGINEERING Текст научной статьи по специальности «Химические науки»

CC BY
0
0
i Надоели баннеры? Вы всегда можете отключить рекламу.
Журнал
The Scientific Heritage
Область наук
Ключевые слова
химическая инженерия / планирование пути / задача коммивояжёра / имитация отжига / chemical industry / path planning / Travelling salesman problem / Simulated Annealing

Аннотация научной статьи по химическим наукам, автор научной работы — Valbahs E., Dreyer I., Grabusts P.

В данной статье уделяется внимание на возможную область применения алгоритмов планирования пути и классической задачи коммивояжера в химической технологии. Экспериментальная часть, при помощи примеров показывает, что алгоритмы планирования пути и имитации отжига могут быть использованы для моделирования и оптимизации многоступенчатых а также других процессов, которые используются в химической отрасли. В статье обсуждается моделирование и оптимизация трех важных технологических процессов для химической технологии.

i Надоели баннеры? Вы всегда можете отключить рекламу.
iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.
i Надоели баннеры? Вы всегда можете отключить рекламу.

ПЛАНИРОВАНИЕ ПУТИ ДЛЯ ХИМИЧЕСКАЯ ИНЖЕНЕРИЯ

In this article we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of three important chemical-technological processes for the chemical industry are discussed.

Текст научной работы на тему «PATH PLANNING FOR CHEMICAL ENGINEERING»

TECHNICAL SCIENCE

Valbahs E.

Mg. comp. sc, PhD student, Rezekne Academy of Technologies, Latvia

Dreyer I.

PhD, associate profesor, Riga Technical University, Latvia Grabusts P.

PhD, profesor, Rezekne Academy of Technologies, Latvia

PATH PLANNING FOR CHEMICAL ENGINEERING

ПЛАНИРОВАНИЕ ПУТИ ДЛЯ ХИМИЧЕСКАЯ ИНЖЕНЕРИЯ

Валбах Э., Магистр компьютерных наук, докторант, Резекненская Академия Технологий, Латвия

Дрейер И., Доктор наук (PhD), ассоциированный профессор, Рижский Техниче-ский Университет, Латвия

Грабуст П., Доктор наук (PhD), профессор, Резекненская Академия Технологий, Латвия

АННОТАЦИЯ

В данной статье уделяется внимание на возможную область примене-ния алгоритмов планирования пути и классической задачи коммивояжера в химической технологии. Экспериментальная часть, при помощи примеров показывает, что алгоритмы планирования пути и имитации отжига могут быть использованы для моделирования и оптимизации многоступенчатых а также других процессов, которые используются в химической отрасли. В статье обсуждается моделирование и оптимизация трех важных технологических процессов для химической технологии.

ABSTRACT

In this article we would like to draw particular attention to the field of application seems to be unnoticeable for the task such as motion planning and the shortest path problem. Due to quite simple examples used, we would like to show that the task of motion planning can be used for simulation and optimization of multi-staged and restricted processes which are presented in chemical engineering accordingly. In the article the simulation and optimization of three important chemical-technological processes for the chemical industry are discussed.

Ключевые слова: химическая инженерия, планирование пути, задача коммивояжёра, имитация отжига.

Keywords: chemical industry, path planning, Travelling salesman problem, Simulated Annealing.

Introduction

The article is connected to the path planning and "Travelling salesman problem" (TSP) [8] used for decision and process automation in unusual or unexpected field of application, like chemical engineering. Practical importance of path planning is significant in transport, path planning tasks among different geographical objects. However, we would like to mention some unnoticeable cases.

Formation of genetic map - the map includes chromosomes that consist of definite marker sequence. In the given case the markers are unique DNA segments within one genome. In laboratory conditions it is possible to determine and distinguish different markers that allow forming genome maps. In order to prepare a map it is necessary to know the sequence of markers in a genome. The task of searching genome marker sequence can be modelled as TSP task. Marker sequence can be envisaged as a path along all markers. A group of researchers from National Institute of Health developed the methods and software for marker sequence searching problem [2].

Telescope orientation and searching new planets - orientation of large telescopes is rather complicated and takes much energy. To decrease the period of orientation, TSP problem is applied (for example, mentioned 200 galaxies can be investigated with a telescope during one night) [6], [11].

In crystallography - positioning crystal sample in x-ray diffractometer is a procedure happening for a long time. Due to one experiment you can include up to 30 000 different positions. When applying path planning methods, it is possible to decrease the length of experiment by 46% [5].

In electronics for example, boring holes in silicon plate, practically all the electronic silicon devices have silicon plates containing different microcircuits. Path planning application allows improving the productivity of assembly lines up to 10% [15]. One can also name the other applications in electronics: brazing silicon plates, developing computer microcircuits, searching silicon plates from defects.

Data organization in groups of elements with similar properties is the principal element in data interpretation. TSP problem was successfully adapted to solving the problem [7], [18]. TSP was successfully applied to distribute the collection of musical compositions.

German company BOWE CARDTEC develops and delivers identification and credit cards. Customers of the company book various cards. In order to make these cards, it is necessary to reconfigure equipment from one working task to the other working task and this is rather prolonged operation. To improve this process, path planning methods are applied and the entire process was modelled as path planning problem. Working tasks

were presented like cities, but the time required to make the reconfigurations was presented in a kind of distance among the cities. Path planning problem gives the possibility to improve the productivity up to 65% [3].

Our previous article was dedicated to mobile agent that moved across 2D closed premises and path planning was successfully applied [23]. Now we would like to show that path planning can be successfully applied for some chemical engineering processes. More detailed motivations and goals are described in the next section of our article.

Goals

The aim of the article is to describe some chemical engineering approaches to the production of substances as multistaged process. The processes have to be fulfilled in succession, controlling the considerable parameters of processes. The quality and quantity of selected product depends on sequence of the process stages and control of characteristic parameters a great deal. Actually in chemical engineering one or several alternative stages can be selected for any stage of process which deals with substances production. Alternative stages differ from each other with completely definite parameters set which characterizes selected stage. Thus, according to previously mentioned technological processes can be characterized as follows:

• certain branching - each alternative branch can be viewed as alternative path;

• selection among alternative stages - it is possible to select one solution from several paths;

• stage characterized with parameters - there is a possibility to characterize alternative stages with definite parameters set.

Taking into account the above mentioned marks, it can be confirmed that chemical engineering processes are characterized with a tree or graph (i.e. the data structure in a kind of a tree or graph). Therefore, chemical engineering processes can be viewed within path planning task. Our aim is to discuss chemical engineering processes as graph-type data structure for the following substances or groups of substances (that allows programming decision-making and process analysis):

• Borane - it can be used in the area of high-energy fuels for jet planes and rockets. The thermal decomposition of diborane (B2H6) has been used to produce coatings of pure elementary boron for neutron-detecting devices and applications requiring hard, corrosion-resistant surfaces. Boranes can be used as vulcanizing agents for natural and synthetic rubbers, and are particularly effective in the production of silicone rubbers [9], [12], [14];

• Malonic acid derivatives - widely used in biochemistry and biology [20], [25].

The above mentioned compounds have been selected, for there are a lot of scientific sources that describe the obtaining of given compounds and in the same time describe all the possible alternatives as well.

Assumptions

To fulfil the previously mentioned goals, it is necessary to reflect the pro-cesses of obtaining borane and aluminium oxide in a kind of graphs. The structure of graphs allows performing further analysis of processes. Correlation among the substances involved in the process and process stage both can be presented as a table. The process of obtaining borane is described in Table 1.

Table 1

Borane obtaining process

SUBSTANCES BEFORE CON-VERSION (OR CURRENT STAGE OF THE PROCESS) CHARACTERISTIC PARAM-ETERS FOR STAGE: TEMPERATURE OF REACTION (CO) PRODUCT OF STAGE

SUBSTANCE MARKING ON GRAPH NAME OF SUBSTANCE AND FORMULA NAME OF SUBSTANCE AND FORMULA SUBSTANCE MARKING ON GRAPH

1 B4H10 - tetraborane 200 B5H9 - pentaborane 2

60 B5H11 - pentabo-rane 5

2 B5H9 - pentaborane - - -

3 B2H6 - diborane 180 B4H10 - tetraborane 1

130 B5H9 - pentaborane 2

280 B10H14 - decabo-rane 4

115 B5H11 - pentabo-rane 5

4 B10H14 - decabo-rane 95 B4H10 - tetraborane 1

5 B5H11 - pentabo-rane 25 B10H14 - decabo-rane 4

100 B4H10 - tetraborane 1

For example, the two substances (two different pentaboranes) can be ob-tained from tetraborane (Table 1), but at different temperatures (in this case the temperature is an important parameter of current stage). Moreover, tetraborane can be obtained either from decaborane, pentaborane or diborane (Table

1). The graph (Fig. 1) related to borane obtaining process (Table 1) is built up, where graph nodes are substances and graph edges are the temperature in each stage. Each stage has its own weight and is relevant to the temperature.

Fig. 1. Graph for borane obtaining process

As to malonic acid derivatives, the design principle of previously mentioned graph remains with its own specific features, related to stage parameters, i.e., outcome of reaction Table 2.

Table 3 shows the names of malonic acid derivatives in accordance with the names of vertexes in the graph (Fig. 2).

Weights of edges at the graph are proportional to the products of the reaction (Fig. 2).

Fig. 2. Graph for malonic acid derivatives obtaining process

Outcome of reaction is amount of product obtained as a result of chemical process/reaction (it is a very important parameter in chemical engineering) and it is always less than 100 per cent (it characterizes the effectiveness of reaction). It can be seen that the higher outcome of the stage, the better result is achieved

according to the parameter. But we should take into consideration that for path planning it is better to have a total distance which must be the smallest as far as possible. Thus, admittedly, value of edges in the given case is difference between 100 per cent and outcome of current stage.

Table 2

Malonic acid derivatives obtaining process

SUBSTANCES BEFORE CONVERSION (OR CURRENT STAGE OF THE PROCESS) CHARACTERISTIC PARAMETERS FOR STAGE: (100% - OUTCOME OF RE-ACTION) (%) PRODUCT OF STAGE

SUBSTANCE MARKING ON GRAPH SUBSTANCE MARK-ING ON GRAPH

A1 40 A2

A2 35 A3

A3 31 B3

B1 55 B2

B2 30 B3

B3

10 C2

30 D5

C1 2 D4

C2 50 C1

D1 24 D2

D2 45 D3

D3 4 D4

D4 33 D5

D5 5 D6

D6 - -

Table 3

Names of malonic acid derivatives in the graph

SUBSTANCE MARKING ON GRAPH NAME OF SUBSTANCE AND FORMULA (WHERE R IS ALKANE DERIVATIVE)

A1 di(R) 2-((R) oxymethylidene)propanedioate

A2 R 4-hydroxy-2-methylpyrimidine-5-carboxylate

A3 R 4-chloro-2-methylpyrimidine-5-carboxylate

B1 2-((R) oxymethylidene)propanedinitrile

B2 R (2E)-3-[(Z)-(1-aminoethylidene)amino]-2-cyanoprop-2-enoate

B3 R 4-amino-2-methylpyrimidine-5-carboxylate

C1 4-amino-2-methylpyrimidine-5-carboxamide

C2 4-amino-2-methylpyrimidine-5-carbonitrile

D1 4,6-dihydroxy-2-methylpyrimidine-5-carboxamide

D2 4,6-dichloro-2-methylpyrimidine-5-carbonitrile

D3 4-amino-6-chloro-2-methylpyrimidine-5-carbonitrile

D4 5-(aminomethyl)-2-methylpyrimidin-4-amine

D5 (4-amino-2-methylpyrimidin-5-yl)methanol

D6 5-(chloromethyl)-2-methylpyrimidin-4-amine

Results

Temperature plays very important role in chemical technology. Actually, all chemical processes are taking place at definite temperature, which stimulates or suppresses the processes. It means that the temperature within the process should be sustained, i.e. supplied with additional amount of warmth or it can be removed. All manipulations with amount of warmth are directly related to power consumption. Actually, in chemical technology with amount of warmth energy efficiency of process can be characterized. Chemical engineer, designing technological process, is always interested in decreasing heat consumption, i.e. selecting a process where the final product

is obtained with lower consumption of heat as far as possible, increasing energy efficiency of obtaining substance accordingly.

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

Discussing processes of forming borane and aluminium oxide, it can be assumed that all stages take one and the same prolongation of time. If time of reaction is unchangeable in all stages, then difference of stages including amount of warmth will depend only on temperature. It is possible to find the most energy-efficient path studying the graph of process and looking for the shortest path from start vertex to final one. Fig. 3 shows the most energy-efficient path from diborane (vertex 3) to decaborane (vertex 4) in the process of obtaining boranes (Table 1).

Fig. 3. The most energy-efficient path from diborane to decaborane

The production of decaborane (vertex 1) from tetraborane diborane (it can be vividly seen from Fig. 4 that the total length is more beneficial in comparison with the production from of the path is shorter compared with the previous example).

Fig. 4. The most energy-efficient path from diborane to decaborane

If it is necessary to obtain the group of substances tetraborane, pentaborane (vertex 5) and decaborane as energy-efficient path,

it is needed to consider the part of the graph which does not contain vertex 2 (Fig. 5).

Fig. 5. The graph presents the part of boranes obtaining process with the shortest path among all the vertexes

The shortest path among all the vertexes in the graph can be obtained as a part of TSP, i.e. Simulated annealing (SA) can be used to find the energy-efficient path in the graph [1], [4], [10], [13], [16], [17], [19].

Outcome of reaction and temperature are of great practical importance. Outcome of reaction shows what amount of substance of the initial mixture of substances is obtained at the end of conversion to the product of chemical reaction. Outcome of reaction reveals the efficiency of substances consumption in chemical processes. Therefore, it can be confirmed that the given parameter determines exactly economic indicators of the processes (as the substance can be also bought without production, and it is necessary to decide either it should be bought or produced and it will be reflected in terms of money). For stages of the process on obtaining derivatives of malonic acid different alternatives can be viewed which considerably

differ by outcome of reaction, but not by temperature. Let us look at the graph for malonic acid derivatives obtaining process. A graph structure can be extended by assigning a weight to each edge as difference between 100 per cent and outcome of reaction, and by this way the shortest path is explained to be looked for in the graph. As the shortest path is searched the less the edge is the better result is. And on the contrary, it is better when the outcome of reaction reaches to 100 per cent. In order to apply path planning methods, in this case the weight of edge should be calculated as difference between 100 per cent and outcome of reaction, 100 per cent being theoretical maximal value of outcome of reaction. The shortest path from di(R) 2-((R)oxymethylidene)propanedioate (vertex A1 and where R is alkane derivative) to 5-(chloromethyl)-2-methylpyrimidin-4-amine (vertex D6) for malonic acid derivatives obtaining process (Table 2) is presented in Fig. 6.

Fig. 6. The shortest path from di(R) 2-((R)oxymethylidene) propanedi-oate (where R is alkane derivative) to 5-(chloromethyl)-2-methylpyrimidin-4-amine (total path length is 141 per cent)

The shortest path from 2-((R)oxymethylidene) to 5-(chloromethyl)-2-methylpyrimidin-4-amine (vertex D6) is propanedinitrile (vertex B1 and where R is alkane derivative) depicted Fig. 7.

Fig. 7. The shortest path from 2-((R)oxymethylidene) propanedinitrile (where R is alkane derivative) to 5-(chloromethyl)-2-methylpyrimidin-4-amine (total path length is 120 per cent)

Fig. 8 shows the shortest and most efficient path for the (vertex D1) to 5-(chloromethyl)-2-methylpyrimidin-4-amine outcome of the reaction (compared with the previously mentioned (vertex D6) . cases) from 4,6-dihydroxy-2-methylpyrimidine-5-carboxamide

Fig. 8. The shortest path from 4,6-dihydroxy-2-methylpyrimidine-5-carboxamide to 5-(chloromethyl)-2-methylpyrimidin-4-amine (total path length is 111 per cent)

The shortest path from 4,6-dihydroxy-2-methylpyrimidine-5-carboxamide (vertex D1) to 5-(aminomethyl)-2-methylpyrimidin-4-amine (vertex D4) is shown in Fig. 9.

Fig. 9. The shortest path from 4,6-dihydroxy-2-methylpyrimidine-5-carboxamide to 5-(aminomethyl)-2-methylpyrimidin-4-amine (total path length is 73 per cent)

The shortest and most efficient path for the outcome of B3 and where R is alkane derivative) to 5-(aminomethyl)-2-the reaction (compared with the previously mentioned cases) methylpyrimidin-4-amine (vertex D4) is depicted in Fig. 10. from R 4-amino-2-methylpyrimidine-5-carboxylate (vertex

Fig. 10. The shortest path from R 4-amino-2-methylpyrimidine-5-carboxylate (where R is alkane derivative) to 5-(aminomethyl)-2-methylpyrimidin-4-amine (total path length is 62 per cent)

Conclusions

Submitted examples show that TSP and path planning can be successfully used in automatizing the analysis and decisionmaking for borane, malonic acid derivatives and other processes for production of chemical substances. Automated decision-making and analysis give the possibility to facilitate the design process. Optimal conditions of the process in selected technological processes are rather easy to be found without using any software, which are done by engineers in industry and searching these optimal conditions extends the design process. If a process contains more alternative stages than those in the selected processes, the design process is expected to be protracted, which will also increase the price of technological process implementation. Design practices can be improved even with a partial atomization of the designing process.

We would like to mention that many linked substances (vertexes) are in-volved in chemical engineering processes. The methods of obtaining substances often change (e.g. production of bioactive substances). Chemical engineering processes are dynamic systems that change from time to time. A lot a scientific researcher is conducted and as a result known products can be obtained in more efficient processes in comparison with technologies that are well know nowadays.

Working out new technologies it is necessary to take into a count the competitive period of time for chemical technology or process developed. It is needed to know the parts of technology that will have to be changed in the nearest future in order to keep the competitiveness of technology. Observing technological process from the point of view of such approach gives the possibility to make necessary changes more efficiently [22]. Taking in to account the previous mentioned it is impossible to find the shortest path (more effective solution) by heart in systems or technology said [24]. In addition, we would like to mention the example of robot scientist Eve which was developed by the researches and engineers from Cambridge and the University of Manchester. Robot Eve is successfully involved in the developing process of new medicines. This work is an excellent combination of robotics, artificial intelligence and pharmacology [21]. We would like to demonstrate that currently, artificial intelligence methods can contribute a considerable for chemical engineering.

The programme product developed in the context of this work simplifies the process of designing for borane and malonic acid derivatives obtaining processes. It is easy to track optimization process using the TSP and path planning because all the selected examples of chemical engineering processes in this article are simple. In our views, TSP, path planning algorithms and methods can be successfully applied to other chemical engineering processes optimization tasks with much more complexity (with the large number of alternative stages and other wider group of

parameters, i.e. not only for temperature).

As it was mentioned in the Introduction, TSP and the shortest path problem have specific field of application which seems to be unnoticeable:

• formation of genetic map;

• telescope orientation and searching new planets;

• positioning crystal sample in x-ray diffractometer;

• boring holes in silicon plate;

• data organization in groups of elements;

• decreasing wallpaper strips;

• cutting templates in glass production;

• investigating the problem in evolution process.

We suppose that the mentioned list can be added with the new application of TSP and the shortest path problem, i.e. application in chemical engineering. As regards the chemical engineering, the implementation of TSP and the shortest path problem give the opportunity of developing new methodology for chemical engineering.

References

1. Aarts E., J. Korst J. Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. - John Wiley and Sons, 1989.

2. Agarwala R., Applegate D.L., Maglott D., Schuler G.D., and Schaffer A.A. A Fast and Scalable Radiation Hybrid Map Construction and Integration Strategy // Genome Research, 10, 350-364, 2000.

3. Applegate D.L., Bixby R., Chvatal V., Cook W. The Traveling Salesman Problem: A Computational Study. -Princeton University Press, 2006.

4. Azencott R. Simulated annealing: parallelization techniques. - John Wiley and Sons, 1992.

5. Bland R.G., Shallcross D.F. Large traveling salesman problems arising from experiments in x-ray crystallography // Operations Research Letters, 8, 123-133, 1989.

6. Carlson S. The Amateur Scientist: Telescopes and a problem for traveling salesmen in space // Scientific American, 276, 121 - 123, 1997.

7. Climer S., Zhang W. Rearrangement clustering: Pitfalls, remedies, and applications // Journal of Machine Learning Research, 7, 919-943,2006.

8. Cook W.J. In Pursuit of the Traveling Salesman. -Princeton: Princeton University Press, USA, 2011.

9. Cotton F.A., Wilkinson G., Murillo C.A., Bochmann M. Advanced Inorganic Chemistry. 6th ed., - John Wiley & Sons: New York, 1999.

10. Davendra D.D. Traveling Salesman Problem, Theory and Applications. - Rijeka: InTech, 2010.

11. E. Kolemen E., Kasdin N.J. Optimal Trajectory Control of an Occulter-Based Planet-Finding Telescope // Advances in

Astronautical Sciences, AAS 07-037, Vol. 128, 215- 233, 2007.

12. Fox M.A., Wade K. Evolving patterns in boron cluster chemistry // Pure Appl. Chem., 75 (9), 1315-1323, 2003.

13. Granville V., Krivanek M., and Rasson J-P. Simulated annealing: A proof of convergence // IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(6), 652-656, 1994.

14. Greenwood N.N., Earnshaw A. Chemistry of the Elements. 2nd ed., - Elsevier - Butterworth-Heinemann, 1997.

15. Grötschel M., Jünger M., Reinelt G. Optimal Control of Plotting and Drilling Machines: A Case Study // Zeitschrift für Operations Research, 35(1), 61-84, 1991.

16. Ingber L. Simulated annealing: Practice versus theory // Math. Comput. Modelling, 18, 29-57, 1993.

17. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by Simulated Annealing // Science, vol. 220, 671-680, 1983.

18. Lenstra J.K. Clustering a data array and the traveling salesman problem // Operations Research, 22, 413-414, 1974.

19. Otten R. H. J. M., Ginneken L. P. P. P. The Annealing Algorithm. - Kluwer Academic Publishers, 1989.

20. Patnaik P. Handbook of Inorganic Chemicals. -McGraw-Hill, 2003.

21. Szondy D. Robot scientist Eve will allow scientists to save time and money in the development of new drugs. [Online]. Available: http://www.gizmag.com/eve-robot-scientist-drugs/35935/ [Accessed: June 10, 2016].

22. Towler G., Sinnott R. Chemical Engineering Design, Second Edition: Principles, Practice and Economics of Plant and Process Design. 2nd ed., -Butterworth-Heinemann, 2012.

23. Valbahs E., Grabusts P. Path Planning Using Non -Euclidean Metric // 8th EUROSIM Congress on Modelling and Simulation EUROSIM2013, Cardiff, Wales, United Kingdom, 10-12 September, 173-178, 2013.

24. Voet D., Voet J.G., Pratt C.W. Principles of Biochemistry. 4th ed., - John Wiley & Sons, Inc., 2012.

25. Weiner N. Malonic acid. Organic Syntheses // Coll. Vol. 2, 376, 1943.

i Надоели баннеры? Вы всегда можете отключить рекламу.