IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v27y2019i2d10.1007_s10100-018-0576-1.html
   My bibliography  Save this article

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

Author

Listed:
  • Aniko Bartos

    (University of Pannonia)

  • Botond Bertok

    (University of Pannonia)

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.

Suggested Citation

  • Aniko Bartos & Botond Bertok, 2019. "Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 551-572, June.
    • Handle: RePEc:spr:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0576-1
    DOI: 10.1007/s10100-018-0576-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-018-0576-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-018-0576-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. David A. Bader & William E. Hart & Cynthia A. Phillips, 2005. "Parallel Algorithm Design for Branch and Bound," International Series in Operations Research & Management Science, in: H J. G (ed.), Tutorials on Emerging Methodologies and Applications in Operations Research, chapter 0, pages 5-1-5-44, Springer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hossein Babaei & Sina Alemohammad & Richard Baraniuk, 2021. "Covariate Balancing Methods for Randomized Controlled Trials Are Not Adversarially Robust," Papers 2110.13262, arXiv.org, revised Aug 2022.
    2. Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao, 2018. "Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs," Computational Optimization and Applications, Springer, vol. 69(1), pages 1-24, January.
    3. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0576-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.