Skip to main content
Log in

Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

Process-network synthesis is the determination of the optimal network structure of a process system together with optimal configurations and capacities of the operating units incorporated into the system. The aim of developing more and more sophisticated solver algorithms is to find the optimum as fast as possible and increase the circle of practically solvable process synthesis problems. The P-graph framework can effectively reduce the number of structures to be examined and accelerate the computation searching for the optimum due to the exploitation of combinatorial characteristics of candidate solution structures. A cooperative parallel implementation of P-graph algorithms have been published recently to exploit the capabilities of multi-core and multiprocessor systems (Bartos and Bertok in De Gruyter Ser Logic Appl 1:303–313, 2015). The parallel implementation has increased performance significantly but this can be further improved by fine tuning the parameters of the parallel algorithm. Outcomes of experiments on parameter optimization are to be presented herein.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. p-graph.org, “P-Graph Studio”, Available: http://p-graph.org.

  2. p-graph.org, “test base.zip”, Available: http://p-graph.org/wp-content/uploads/2017/12/test_base.zip.

  3. projects.coin-or.org, “COIN-OR Branch-and-Cut MIP-Solver”, http://projects.coin-or.org/Cbc.

References

  • Aviso KB, Cayamanda CD, Solis FDB, Danga AMR, Promentilla MAB, Yu KDS, Santos JR, Tan RR (2015) P-graph approach for GDP-optimal allocation of resources, commodities and capital in economic systems under climate change-induced crisis conditions. J Clean Prod 92:308–317

    Article  Google Scholar 

  • Bader DA, Hart WE, Phillips CA (2005) Parallel algorithm design for branch and bound. Tutor Emerg Methodol Appl Oper Res 76:5-1

    Google Scholar 

  • Barreto L, Bauer M (2010) Parallel branch and bound algorithm—a comparison between serial, OpenMP and MPI implementations. J Phys Conf Ser 256(1):012018

    Article  Google Scholar 

  • Bartos A, Bertok B (2014) Analysis of search strategies for parallel implementation of a process-network synthesis solver. In: ASCONIKK 2014: extended abstracts I. Information technologies for logistic systems, pp 5–10

  • Bartos A, Bertok B (2015) Synchronization and load distribution strategies for parallel implementations of P-graph optimizer. De Gruyter Ser Logic Appl 1:303–313

    Google Scholar 

  • Bernini R, Bondavalli A, Lollini P, Montecchi L (2016) Combining SAN and P-graphs for the analysis and optimization of industrial processes. In: 2016 12th European dependable computing conference (EDCC), pp 97–207

  • Bertok B, Friedler F, Fan LT (1998) Random generation of test problems for process synthesis. In: Presented at the CHISA ’98 (13th international congress of chemical and process engineering), Praha, Czech Republic, August 23–28

  • Bertok B, Barany M, Friedler F (2013) Generating and analyzing mathematical programming models of conceptual process design by p-graph software. Ind Eng Chem Res 52(1):166–171

    Google Scholar 

  • Bourbeau B, Crainic TG, Gendron B (2000) Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Comput 26(1):27–46

    Article  Google Scholar 

  • Cartis C, Fowkes JM, Gould NI (2015) Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J Glob Optim 61(3):429–457

    Article  Google Scholar 

  • Chakroun I, Melab N (2013) Operator-level gpu-accelerated branch and bound algorithms. Proc Comput Sci 18:280–289

    Article  Google Scholar 

  • Clausen J, Perregaard M (1999) On the best search strategy in parallel branch-and-bound: best-first search versus lazy depth-first search. Ann Oper Res 90:1–17

    Article  Google Scholar 

  • Crainic TG, Cun BL, Roucairol C (2006) Parallel branch-and-bound algorithms. Parallel Comb Optim 1:1–28

    Google Scholar 

  • Dastghaibifard G, Ansari E, Sheykhalishahi S, Bavandpouri A, Ashoor E (2008) A parallel branch and bound algorithm for vehicle routing problem. Lect Notes Eng Comput Sci 2:1891–1896

    Google Scholar 

  • Eckstein J (1997) Distributed versus centralized storage and control for parallel branch and bound: mixed integer programming on the CM-5. Comput Optim Appl 7(2):199–220

    Article  Google Scholar 

  • Evtushenko Y, Posypkin M, Sigal I (2009) A framework for parallel large-scale global optimization. Comput Sci Res Dev 23(3–4):211–215

    Article  Google Scholar 

  • Fan LT, Bertok B, Friedler F, Shafie S (2001) Mechanisms of ammonia-synthesis reaction revisited with the aid of a novel graph-theoretic method for determining candidate mechanisms in deriving the rate law of a catalytic reaction. Hung J Ind Chem 29:71–80

    Google Scholar 

  • Friedler F, Tarjan K, Huang Y, Fan LT (1993) Graph-theoretic approach to process synthesis: polynomial algorithm for maximal structure generation. Comput Chem Eng 17:929

    Article  Google Scholar 

  • Friedler F, Varga J, Fan LT (1995) Decision-mapping: a tool for consistent and complete decisions in process synthesis. Chem Eng Sci 50:1755

    Article  Google Scholar 

  • Friedler F, Varga J, Feher E, Fan LT (1996) Combinatorially accelerated branch-and-bound method for solving the MIP model of process network synthesis. In: State of the art in global optimization, pp 609–626

  • García-Ojeda JC, Bertok B, Friedler F, Argoti A, Fan LT (2015) A preliminary study of the application of the P-graph methodology for organization-based multiagent system designs: assessment. Acta Polytech Hung 12(2):103–122

    Google Scholar 

  • Honig U, Schiffmann W (2004) A parallel branch and bound algorithm for computing optimal task graph schedules. In: International conference on grid and cooperative computing, pp 18–25

  • Lam HL, Varbanov PS, Klemeš JJ (2010) Optimisation of regional energy supply chains utilising renewables: P-graph approach. Comput Chem Eng 34(5):782–792

    Article  Google Scholar 

  • Mezmaz M, Melab N, Tuyttens D (2013) A multithreaded branch-and-bound algorithm for solving the flow-shop problem on a multicore environment. In: Large scale network-centric distributed systems, pp 53–70

  • Miller D, Pekny J (1989) Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Oper Res Lett 8(3):129–135

    Article  Google Scholar 

  • Pruul EA, Nemhauser GL, Rushmeier RA (1988) Branch-and-bound and parallel computation: a historical note. Oper Res Lett 7(2):65–69

    Article  Google Scholar 

Download references

Acknowledgements

This publication has been supported by the ÚNKP-17-3 (IV-PE-1) New National Excellence Program of the Ministry of Human Capacities. The authors acknowledge the financial support of Széchenyi 2020 under the EFOP-3.6.1-16-2016-00015.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aniko Bartos.

Appendix

Appendix

Test base available at “p-graph.org”.

Test base properties:

Name

# of op.units

# of materials

Difficulty

Name

# of op.units

# of materials

Difficulty

Name

# of op.units

# of materials

Difficulty

0

9

14

6

50

18

27

7

100

50

81

7

1

10

20

4

51

18

31

0

101

50

95

14

2

10

25

6

52

18

30

12

102

50

85

8

3

10

18

4

53

24

48

9

103

50

80

9

4

10

15

5

54

24

37

1

104

50

82

0

5

10

14

6

55

29

46

0

105

50

86

12

6

11

14

4

56

29

52

0

106

50

101

0

7

11

21

3

57

30

57

9

107

50

85

0

8

11

17

1

58

30

55

5

108

50

80

8

9

11

18

7

59

30

49

9

109

50

90

0

10

12

23

7

60

30

50

10

110

50

86

0

11

12

20

0

61

30

53

11

111

50

68

5

12

13

16

5

62

30

53

4

112

54

74

25

13

13

22

0

63

30

48

16

113

55

97

3

14

13

26

2

64

30

48

3

114

68

102

5

15

13

20

6

65

30

49

8

115

70

101

30

16

14

22

7

66

30

54

19

116

70

109

24

17

14

25

0

67

30

53

12

117

70

117

0

18

14

28

7

68

30

53

10

118

70

120

13

19

14

14

6

69

30

58

13

119

70

111

2

20

15

27

3

70

30

50

0

120

70

108

15

21

15

28

10

71

30

51

0

121

70

115

11

22

15

26

10

72

30

40

0

122

70

115

14

23

15

24

7

73

30

44

13

123

70

123

0

24

15

31

3

74

30

41

0

124

70

104

19

25

15

23

8

75

30

48

0

125

70

113

18

26

15

24

6

76

30

50

0

126

70

112

30

27

15

27

8

77

35

56

3

127

70

108

20

28

15

31

5

78

35

57

3

128

70

117

18

29

15

31

4

79

38

65

17

129

70

107

19

30

15

22

2

80

38

55

15

130

70

113

6

31

15

26

6

81

40

55

14

131

70

115

4

32

15

22

5

82

43

74

7

132

70

109

4

33

15

33

5

83

46

67

9

133

70

115

14

34

15

29

5

84

46

68

0

134

70

101

26

35

15

29

7

85

47

77

20

135

70

102

7

36

15

24

7

86

50

78

0

136

90

140

5

37

15

30

3

87

50

84

8

137

90

158

13

38

15

27

0

88

50

93

15

138

90

143

3

39

15

26

0

89

50

81

2

139

90

160

26

40

15

25

0

90

50

84

15

140

90

133

4

41

15

29

0

91

50

80

7

141

90

148

3

42

15

22

0

92

50

79

9

142

90

140

1

43

15

23

0

93

50

90

8

143

90

155

41

44

15

26

0

94

50

81

10

144

90

142

23

45

15

25

0

95

50

87

21

145

90

149

28

46

15

23

0

96

50

78

5

146

90

136

4

47

15

33

6

97

50

83

19

147

90

143

2

48

15

21

8

98

50

87

13

148

90

149

3

49

17

28

1

99

50

73

12

149

90

143

8

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bartos, A., Bertok, B. Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms. Cent Eur J Oper Res 27, 551–572 (2019). https://doi.org/10.1007/s10100-018-0576-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-018-0576-1

Keywords

Navigation