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

• 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