Distributed, Parallel, and Cluster Computing · arXiv:2611.16290 v1 · submitted 12 Nov 2026 · 196 references
Parallel Computing Systems for the Optimal Selection of Process Equipment
The paper says
“This monograph addresses the optimal selection of equipment for chemical-engineering systems of multiproduct batch plants, a large-scale NP-hard discrete optimization problem in which, for each processing stage, a unit of standard size must be chosen so that the total capital …”
more of the abstract
… cost of the equipment is minimized while the system remains operable and produces the required products within a given time horizon. We present the mathematical model of system operation and analyze its computational properties. We then develop a sequential branch-and-bound algorithm and its parallel versions for shared-memory systems (OpenMP), distributed-memory clusters (MPI, master-worker), and graphics processing units (CUDA), including recursive and iterative tree traversal, shared-memory optimization, and branch-divergence reduction. To overcome the exponential growth of the run time, we propose a hybrid metaheuristic in which Ant Colony Optimization finds a feasible initial solution and Simulated Annealing improves it, and we implement it on GPUs with thousands of independent threads. Finally, we propose random, constant, and multi-constant approaches to tuning the parameters of the ant colony algorithm based on statistical analysis of many parallel runs, and we study the program on GPUs of three generations and on nodes with several GPUs. Computational experiments on multi-core processors, clusters, and GPUs show that the parallel hybrid algorithm finds solutions within 0.01% of the branch-and-bound optimum in tens of seconds instead of tens of hours.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. A thorough engineering monograph on parallel algorithms for a specific NP-hard equipment selection problem; the hybrid ACO+SA on GPU is the real contribution, but the cost simplification and the missing variance on the headline claim limit the force of the results. This line is wrong
3 major objections · 7 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 196 references say.
The paper says, at §5.5, Figs. 5.4 and 5.5
The review did not quote this passage.
Pith says: Objection 1 of 3 · major
The claim that the parallel hybrid algorithm 'finds solutions within 0.01% of the branch-and-bound optimum' is based on averaged results of 100 stochastic runs. No measure of variability (standard deviation, worst-case, or fraction of runs exceeding 0.01%) is reported. Since ACO+SA is stochastic, a single run may deviate more than the average.
more of objection 1
The authors should report the distribution of results (e.g., min, max, percentiles) or at least state the worst observed deviation. Without this, the categorical wording overstates the reliability of the algorithm. This is a load-bearing issue for the central claim.
The paper says, at §1.3 and §5.5
The review did not quote this passage.
Pith says: Objection 2 of 3 · major
The paper uses a single test case (a specific CES with 16 stages, synthetic costs). While the problem size is varied by changing the number of standard sizes, the underlying structure is fixed. The generality of the results would be strengthened by testing on additional CES configurations or randomly generated instances. The authors should discuss this limitation and, if possible, provide results for at least one more test case.
The paper says, at Chapter 6
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
The proposed tuning methods (random, constant, multi-constant) are simple and the experimental comparison is limited. The paper does not quantify the cost of the tuning study itself (e.g., how many runs were needed to determine the best parameters) relative to the benefit. The tuning is only for ACO parameters; SA parameters are fixed. The authors should clarify the practical utility of the tuning approach and consider discussing its overhead.
7 minor objections
The paper says, at Listings 2.1–5.5
Pith says: minor objection 1 of 7
The pseudocode listings use a non-standard style (e.g., line numbers, '#' for pragma). Consider using a more conventional algorithmic environment for clarity.
The paper says, at Listing 4.4
Pith says: minor objection 2 of 7
The array initialization uses 'i * J * K + j * K + k' but the comment says 'B[i][j][k]'. The indexing is correct for row-major order, but the comment could be clearer to avoid confusion.
show 5 more
The paper says, at §4.2
Pith says: minor objection 3 of 7
The host code uses 'cudaMemcpyHostToDevice' and 'cudaMemcpyDeviceToHost' but the actual CUDA API uses 'cudaMemcpy' with direction enum. The pseudocode is understandable but should be consistent with standard CUDA naming for reproducibility.
The paper says, at §5.4
Pith says: minor objection 4 of 7
The paper uses 'atomicMinDbl' which is not a standard CUDA function; it should be noted that this is a custom implementation (e.g., using atomicCAS for double precision).
The paper says, at Fig. 5.2
Pith says: minor objection 5 of 7
The figure shows ACO and SA run times separately; it would be helpful to also show total run time for clarity.
The paper says, at §4.4
Pith says: minor objection 6 of 7
The paper states that the recursive approach is 2.2 times faster than iterative on average. This is an interesting result that could be highlighted more in the conclusions.
The paper says, at Bibliography
Pith says: minor objection 7 of 7
Some references are cited but not listed in the provided text (e.g., [54], [55]). The authors should ensure all references are complete and correctly formatted.
What would settle it
Recompute from the raw outputs of the 100 runs behind Fig. 5.4, for problem sizes 10^16 to 12^16, the maximum relative deviation, the 95th percentile, and the fraction of runs exceeding 0.01%. If the worst run or a substantial fraction exceeds 0.01%, the central claim must be reworded as 'average deviation within 0.01%' and the spread reported. If every one of the 100 runs is within 0.01%, the categorical claim is supported for this test instance.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic disagrees
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 7 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This is a monograph, not a paper—99 pages, six chapters, full treatment of a specific NP-hard problem (equipment selection for multiproduct batch chemical plants). The real contribution is the hybrid ACO+SA metaheuristic on GPUs, which for the largest test case (1216 variants) finds solutions within 0.01% of the branch-and-bound optimum in ~227 seconds instead of ~134 hours. That is a practical speedup, and the parallel scaling story (OpenMP, MPI, CUDA) is competently told. The parameter-tuning study in Chapter 6 is also a nice addition: they compare random, constant, and multi-constant approaches and show that the multi-constant method reduces the time to find a feasible initial solution by a factor of 2–3.
What the paper does well: the mathematical model of CES operation is clearly laid out, the branch-and-bound lower bound is correctly derived, and the GPU implementation details (shared memory optimization, divergence reduction) are honest about what works and what doesn't. The authors acknowledge that direct B&B on GPU gives only 2.6–5.8× speedup (Section 4.4), which is refreshingly modest.
Soft spots: (1) The cost function is synthetic—cost = size in m³ or m²—because no real cost data were available (Section 1.3). The authors are upfront about this, but it means the objective function may not reflect real capital costs, and the optimal solution for the test case may not be optimal for real plants. This limits the practical significance of the results. (2) The headline claim that the hybrid algorithm finds solutions 'within 0.01% of the branch-and-bound optimum' is supported only by averaged results over 100 runs; no standard deviation, worst-case, or fraction of runs above 0.01% is reported. For a stochastic algorithm, a user running it once might get a worse result. The stress-test note is correct: the categorical wording overstates single-run behavior. (3) No comparison with other metaheuristics (genetic algorithms, particle swarm, etc.) is provided, so it's unclear whether ACO+SA is actually better than alternatives. (4) The parameter tuning in Chapter 6 is done on the same test case used for evaluation, raising a risk of overfitting.
Who this is for: researchers and engineers working on parallel algorithms for discrete optimization, especially those interested in GPU implementations of metaheuristics. The monograph is well-structured and could serve as a reference for similar problems.
Recommendation: The paper deserves a serious referee. The core algorithm is sound, the implementation is careful, and the results are promising despite the limitations. The authors should be asked to report variance on the stochastic runs, to compare with at least one alternative metaheuristic, and to discuss the generalizability of the cost simplification. With those revisions, it would be a solid contribution to the parallel computing and chemical engineering literature.
Best, [Your name]
The strongest objection
The abstract and Chapter 5 claim that the parallel hybrid algorithm 'finds solutions within 0.01%' of the branch-and-bound optimum in tens of seconds. The support is Figures 5.4 and 5.5. Section 5.5 states that 'for each example, the algorithm was run 100 times and the results were averaged.' Only the averaged relative deviation is plotted; the paper does not report the standard deviation, the worst run, or the fraction of runs above 0.01% for the 10^16 to 12^16 cases, which are exactly the cases where the claim matters. ACO+SA is stochastic, so a mean within 0.01% does not imply that a single run is within 0.01%; practical users run the algorithm once. If a non-negligible fraction of the 100 runs deviates by more than 0.01%, the headline claim is true only of the average and should be qualified. This is a gap between the reported statistic and the categorical wording, not an internal inconsistency. The authors' acknowledged cost simplification (Section 1.3) is not the load-bearing issue for an algorithmic study.
The central claim is empirical, so the most load-bearing condition is that the reported statistic matches the claim. The paper averages 100 stochastic runs and then states a categorical 'within 0.01%'. That gap is concrete and testable from existing data. I did not choose the cost-equals-size assumption because the authors explicitly state it and scope it to algorithm testing; external validity is a limitation, but not an internal flaw. The single synthetic test case is likewise acknowledged. The SA acceptance rule differs from textbook SA (deltaCost is measured against the global minCost, Listing 5.5), which is worth noting, but the empirical claim can survive that unless the check shows otherwise. Since the reader already returned CONDITIONAL, this concern does not change the verdict; it adds a specific condition on how the headline should be reported. If the check fails, the correct description is 'average within 0.01%' with variance reported, still under a conditional verdict; if it passes, the current conditional verdict remains appropriate.
The referee's report
The problem is practically important and computationally challenging. The paper provides a comprehensive study of parallel algorithms for this problem, including exact and metaheuristic approaches. The hybrid metaheuristic on GPU achieves impressive speedups for large instances, and the parameter tuning study adds value. If the results hold, the work could be useful for practitioners in chemical engineering and parallel computing. However, the significance is somewhat limited by the use of synthetic costs and a single test case.
Pith's reading of the paper (a machine's summary, not the authors')
This monograph tackles the optimal selection of process equipment for multiproduct batch plants, a large-scale NP-hard discrete optimization problem. The author develops a mathematical model of the chemical-engineering system's operation and proposes a sequential branch-and-bound algorithm, then parallelizes it for shared-memory (OpenMP), distributed-memory (MPI), and GPU (CUDA) systems. Recognizing that exact branch-and-bound becomes impractical for large problem instances (tens of hours), the core contribution is a hybrid metaheuristic that combines Ant Colony Optimization (ACO) to find a feasible initial solution and Simulated Annealing (SA) to refine it. This hybrid is implemented on GPUs with thousands of independent threads. Computational experiments on a test case with up to $12^{16}$ possible CES variants show that the parallel hybrid algorithm finds solutions within 0.01% of the branch-and-bound optimum in tens of seconds, compared to tens of hours for exact B&B. The author also proposes methods for tuning the ACO parameters based on statistical analysis of parallel runs. The work demonstrates that careful hybridization and massive parallelism can make an NP-hard industrial optimization problem tractable in practice.
What carries the argument. The central mechanism is the hybrid metaheuristic combining Ant Colony Optimization (ACO) and Simulated Annealing (SA). ACO is used to find a feasible initial CES variant that satisfies compatibility and processing time constraints, using a fitness function that counts satisfied constraints. SA then refines this solution by randomly perturbing unit selections at individual stages, accepting worse solutions with a probability that decreases with temperature, thereby escaping local optima. The parallel implementation on GPUs uses the Multiple Ant Colonies method for ACO (each thread runs an independent colony) and Multiple Independent Runs for SA (each thread runs an independent SA chain, sharing only the global best cost). The key data structure is the separation of immutable input data (shared by all threads) from mutable working data (per thread), enabling efficient GPU execution.
Core claim. The central claim is that a hybrid metaheuristic (ACO+SA) implemented on a GPU can solve the optimal equipment selection problem for chemical-engineering systems of multiproduct batch plants with near-optimal accuracy (within 0.01% of the global optimum) in a fraction of the time required by exact branch-and-bound. The paper establishes this by developing a mathematical model of CES operation, implementing sequential and parallel B&B algorithms as baselines, and then designing the ACO+SA hybrid. The key result is that for the largest test case ($12^{16}$ variants), the parallel hybrid runs in 227 seconds versus 134 hours for B&B, with a relative deviation of less than 0.01%. The paper argues that this makes the problem tractable for industrial practice.
The premise it rests on. The cost of each equipment unit is set numerically equal to its main size (in $m^{3}$ or $m^{2}$) because no actual cost data were available, meaning the objective function may not reflect real capital costs and the optimal solution found may not be optimal for real plants.
If the paper is right (Pith's inferences, not the authors')
If the hybrid metaheuristic consistently achieves solutions within 0.01% of the global optimum, it can replace exact methods for industrial equipment selection, enabling faster design cycles and exploration of larger search spaces.
The parallel GPU implementation demonstrates that massive thread-level parallelism can offset the computational cost of stochastic search, making NP-hard problems tractable on commodity hardware.
The parameter tuning method (statistical analysis of multiple parallel runs) provides a systematic way to optimize ACO parameters for similar combinatorial optimization problems, potentially reducing manual trial-and-error.
The approach can be extended to other MINLP/MILP problems in chemical engineering, such as process synthesis, scheduling, and supply chain optimization, by adapting the constraint-checking and fitness functions.
The speedup achieved (tens of seconds vs. tens of hours) suggests that real-time or near-real-time optimization of batch plant equipment is feasible, which could impact operational decision-making.
The paper's reliance on a test case where equipment cost equals size (m^3 or m^2) is a significant simplification; real cost data would likely introduce nonlinearities and multi-objective considerations (e.g., operating costs, maintenance), which could alter the optimal solutions found by the metaheuristic.
The hybrid algorithm's success depends on the ability of ACO to find a feasible initial solution; for problems with very tight constraints, ACO may fail to find any feasible solution within the iteration limit, requiring restart or alternative initialization strategies.
The GPU implementation's speedup is modest (2.6-2.9x over sequential) for the hybrid algorithm, but the quality improvement (0.01% vs. 9-14% deviation) is more significant. This suggests that for this problem, the main benefit of parallelism is not raw speed but the ability to run many independent searches and select the best result.
The parameter tuning study (Chapter 6) is motivated by performance degradation for problems larger than 12^16; future work could investigate adaptive online parameter control to handle even larger instances without manual tuning.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
This monograph addresses the optimal selection of equipment for chemical-engineering systems of multiproduct batch plants, a large-scale NP-hard discrete optimization problem in which, for each processing stage, a unit of standard size must be chosen so that the total capital cost of the equipment is minimized while the system remains operable and produces the required products within a given time horizon. We present the mathematical model of system operation and analyze its computational properties. We then develop a sequential branch-and-bound algorithm and its parallel versions for shared-memory systems (OpenMP), distributed-memory clusters (MPI, master-worker), and graphics processing units (CUDA), including recursive and iterative tree traversal, shared-memory optimization, and branch-divergence reduction. To overcome the exponential growth of the run time, we propose a hybrid metaheuristic in which Ant Colony Optimization finds a feasible initial solution and Simulated Annealing improves it, and we implement it on GPUs with thousands of independent threads. Finally, we propose random, constant, and multi-constant approaches to tuning the parameters of the ant colony algorithm based on statistical analysis of many parallel runs, and we study the program on GPUs of three generations and on nodes with several GPUs. Computational experiments on multi-core processors, clusters, and GPUs show that the parallel hybrid algorithm finds solutions within 0.01% of the branch-and-bound optimum in tens of seconds instead of tens of hours.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“Computational experiments on multi-core processors, clusters, and GPUs show that the parallel hybrid algorithm finds solutions within 0.01% of the branch-and-bound optimum in tens of seconds instead of tens of hours.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.20 · human participants 0.01 · controlled comparison 0.35 · randomized assignment 0.02 · states quantitative result 0.98 · compares with prior results 0.84 · mentions code or data availability 0.03
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| This monograph addresses the optimal selection of equipment for chemical-engineering systems of multiproduct batch plants, a large-scale NP-hard discrete optimization problem in which, for each processing stage, a unit of standard size must be chosen so that the total capital cost of the equipment is minimized while the system remains operable and produces the required products within a given time horizon. | background 0.98 | 0.16 | 0.04 | asserted 0.98 |
| We present the mathematical model of system operation and analyze its computational properties. | method 0.56 | 0.92 | 0.02 | asserted 0.92 |
| We then develop a sequential branch-and-bound algorithm and its parallel versions for shared-memory systems (OpenMP), distributed-memory clusters (MPI, master-worker), and graphics processing units (CUDA), including recursive and iterative tree traversal, shared-memory optimization, and branch-divergence reduction. | method 0.77 | 0.95 | 0.04 | asserted 0.98 |
| To overcome the exponential growth of the run time, we propose a hybrid metaheuristic in which Ant Colony Optimization finds a feasible initial solution and Simulated Annealing improves it, and we implement it on GPUs with thousands of independent threads. | method 0.65 | 0.95 | 0.10 | asserted 1.00 |
| Finally, we propose random, constant, and multi-constant approaches to tuning the parameters of the ant colony algorithm based on statistical analysis of many parallel runs, and we study the program on GPUs of three generations and on nodes with several GPUs. | contribution 0.54 | 0.95 | 0.04 | asserted 0.98 |
| Computational experiments on multi-core processors, clusters, and GPUs show that the parallel hybrid algorithm finds solutions within 0.01% of the branch-and-bound optimum in tens of seconds instead of tens of hours. | result 1.00 | 0.97 | 0.82 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.91
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 5,193 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (6)
Figures are the authors', reproduced from the paper.
References (196)
- [2] Michał Czapiński. An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform.Journal of Parallel and Distributed Computing, 73(11): 1461–1468, 2013. doi: 10.1016/j.jpdc.2012.07.014 on Pithdoi:10.1016/j.jpdc.2012.07.014
- [3] Vincent Boyer, Didier El Baz, and Moussa Elkihel. Solving knapsack problems on GPU. Computers & Operations Research, 39(1):42–47, 2012. doi: 10.1016/j.cor.2011.03.014 on Pithdoi:10.1016/j.cor.2011.03.014
- [4] Robert Pellerin, Nathalie Perrier, and François Berthaut. A survey of hybrid metaheuristics for the resource-constrained project scheduling problem.European Journal of Operational Research, 280(2):395–416, 2020. doi: 10.1016/j.ejor.2019.01.063 on Pithdoi:10.1016/j.ejor.2019.01.063
- [5] M. Gavanelli and T. Mancini.Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion: RCRA 2007. Elsevier Incorporated, 2009. Special Issue on Pith
- [6] Gerhard J. Woeginger.Exact Algorithms for NP-Hard Problems: A Survey, pages 185– on Pith
- [7] Janez Žerovnik. Heuristics for NP-hard optimization problems – simpler is better!?Logistics & Sustainable Transport, 6(1):1–10, 2015. doi: 10.1515/jlst-2015-0006 on Pithdoi:10.1515/jlst-2015-0006
- [8] E.-G. Talbi.Metaheuristics: from design to implementation. John Wiley & Sons, 2009. ISBN 978-0-470-27858-1 on Pith
- [9] Jürg Nievergelt. Exhaustive Search, Combinatorial Optimization and Enumeration: Ex- ploring the Potential of Raw Computing Power. In Václav Hlaváč, Keith G. Jeffery, and Jiří Wiedermann, editors,SOFSEM 2000: Theory and Practice of Informatics, pages 18–35, Berlin, Heidelberg, ... on Pithdoi:10.1007/3-540-44411-4_2
- [10] Caio Paziani Tomazella and Marcelo Seido Nagano. A comprehensive review of Branch- and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem.Expert Systems with Applications, 158:113556, 2020. doi: 10.1016/j.es wa.2020.113556 on Pithdoi:10.1016/j.es
- [11] Ketan Date and Rakesh Nagi. GPU-accelerated Hungarian algorithms for the Linear Assignment Problem.Parallel Computing, 57:52–72, 2016. doi: 10.1016/j.parco.2016.05.012 on Pithdoi:10.1016/j.parco.2016.05.012
- [12] Paul Bouman, Niels Agatz, and Marie Schmidt. Dynamic programming approaches for the traveling salesman problem with drone.Networks, 72(4):528–542, 2018. doi: 10.1002/net.21864. 86 on Pithdoi:10.1002/net.21864
- [13] Rafael Martí and Gerhard Reinelt.Heuristic Methods, pages 17–40. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011. ISBN 978-3-642-16729-4. doi: 10.1007/978-3-642-167 29-4_2 on Pithdoi:10.1007/978-3-642-167
- [14] A. V. Panteleev.Metaheuristic Algorithms for Global Extremum Search. MAI-Print, Moscow, 2009. ISBN 978-5-7035-2115-1. In Russian on Pith
- [15] Xin-She Yang.Nature-inspired metaheuristic algorithms. Luniver press, 2010 on Pith
- [16] N. M. Ershov and N. N. Popova. Natural Models of Parallel Computations.Computer Research and Modeling, 7(3):781–785, 2015. doi: 10.20537/2076-7633-2015-7-3-781-785. In Russian on Pithdoi:10.20537/2076-7633-2015-7-3-781-785
- [17] Fred Glover and Manuel Laguna. Tabu Search. InHandbook of Combinatorial Optimization, pages 3261–3362. Springer New York, New York, NY, 2013. doi: 10.1007/978-1-4419-799 7-1_17 on Pithdoi:10.1007/978-1-4419-799
- [18] Emile Aarts, Jan Korst, and Wil Michiels. Simulated Annealing. InSearch Methodologies, pages 265–285. Springer US, Boston, MA, 2014. doi: 10.1007/978-1-4614-6940-7_10 on Pithdoi:10.1007/978-1-4614-6940-7_10
- [19] Marco Dorigo and Christian Blum. Ant Colony Optimization Theory: A Survey.Theoretical Computer Science, 344(2–3):243–278, 2005. doi: 10.1016/j.tcs.2005.05.020 on Pithdoi:10.1016/j.tcs.2005.05.020
- [20] Kim-Fung Man, Kit Sang Tang, and Sam Kwong.Genetic Algorithms. Advanced Textbooks in Control and Signal Processing. Springer London, London, 1999. ISBN 978-1-85233-072-9. doi: 10.1007/978-1-4471-0577-0 on Pithdoi:10.1007/978-1-4471-0577-0
- [21] Maurice Clerc.Particle Swarm Optimization. ISTE / John Wiley & Sons, 2013. ISBN 978-1-118-61397-9 on Pith
show 80 more
- [22] Dervis Karaboga, Beyza Gorkemli, Celal Ozturk, and Nurhan Karaboga. A comprehensive survey: artificial bee colony (ABC) algorithm and applications.Artificial Intelligence Review, 42(1):21–57, 2014. doi: 10.1007/s10462-012-9328-0 on Pithdoi:10.1007/s10462-012-9328-0
- [23] Davide Anghinolfi and Massimo Paolucci. Simulated Annealing as an Intensification Component in Hybrid Population-based Metaheuristics. InSimulated Annealing, pages 1–28. InTech, 2008. doi: 10.5772/5570 on Pithdoi:10.5772/5570
- [24] Christian Blum, Jakob Puchinger, Günther R. Raidl, and Andrea Roli. Hybrid metaheuris- tics in combinatorial optimization: A survey.Applied Soft Computing, 11(6):4135–4151, on Pith
- [25] Mauro Birattari.Tuning Metaheuristics, volume 197 ofStudies in Computational Intelli- gence. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009. ISBN 978-3-642-00482-7. doi: 10.1007/978-3-642-00483-4 on Pithdoi:10.1007/978-3-642-00483-4
- [26] Susheel Kumar Joshi and Jagdish Chand Bansal. Parameter Tuning for Meta-Heuristics. Knowledge-Based Systems, 189:105094, 2020. doi: 10.1016/j.knosys.2019.105094 on Pithdoi:10.1016/j.knosys.2019.105094
- [27] Changwu Huang, Yuanxiang Li, and Xin Yao. A Survey of Automatic Parameter Tuning Methods for Metaheuristics.IEEE Transactions on Evolutionary Computation, 24(2): 201–216, 2020. doi: 10.1109/TEVC.2019.2921598 on Pithdoi:10.1109/tevc.2019.2921598
- [28] V. V. Voevodin and Vl. V. Voevodin.Parallel Computing. BHV-Peterburg, Saint Petersburg, on Pith
- [29] Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar.Introduction to Parallel Computing, Design and Analysis of Algorithms. Pearson Education, second edition, 2003. ISBN 9788131708071 on Pith
- [30] Fayez Gebali.Algorithms and parallel computing, volume 84. John Wiley & Sons, 2011 on Pith
- [31] R. G. Strongin, V. P. Gergel, V. A. Grishagin, and K. A. Barkalov.Parallel Computations in Global Optimization Problems. Moscow University Press, Moscow, 2013. ISBN 978-5- 211-06479-9. In Russian on Pith
- [32] David Padua, editor.Encyclopedia of Parallel Computing. Springer US, Boston, MA, 2011. ISBN 978-0-387-09765-7. doi: 10.1007/978-0-387-09766-4 on Pithdoi:10.1007/978-0-387-09766-4
- [33] Imen Chakroun, Nordine Melab, Mohand Mezmaz, and Daniel Tuyttens. Combining multi-core and GPU computing for solving combinatorial optimization problems.Journal of Parallel and Distributed Computing, 73(12):1563–1577, 2013. doi: 10.1016/j.jpdc.2013. 07.023 on Pithdoi:10.1016/j.jpdc.2013
- [34] A. A. Kolpakov and Yu. A. Kropotov.Improving the Performance of Heterogeneous Computer Data Processing Systems. Direkt-Media, Moscow; Berlin, 2019. ISBN 978-5- 4475-8156-5. In Russian on Pith
- [35] E. V. Semenov, A. V. Starchenko, E. A. Danilkin, and S. A. Prokhanov. Choosing a Parallelization Technology for the Numerical Solution of the Convection–Diffusion Equation on a Hybrid Multiprocessor Computing System.Tomsk State University Journal of Control and Computer Scienc... on Pithdoi:10.17223/19988605/51/13
- [36] Davor Sluga, Tomaz Curk, Blaz Zupan, and Uros Lotric. Heterogeneous computing architecture for fast detection of SNP-SNP interactions.BMC bioinformatics, 15(1):216, 2014 on Pith
- [37] Gabriela Sandoval, Daniel Espinoza, Nicolas Figueroa, and Juan A. Asenjo. Optimization of a biotechnological multiproduct batch plant design for the manufacture of four different products: A real case scenario.Biotechnology and Bioengineering, 114(6):1252–1263, 2017. doi: 10.1... on Pithdoi:10.1002/bit.26260
- [38] A. B. Borisenko and S. V. Karpushkin. Hierarchy of processing equipment configuration design problems for multiproduct chemical plants.Journal of Computer and Systems Sciences International, 53(3):410–419, 2014. doi: 10.1134/S1064230714030046. Translated from Izvestiya Rossiis... on Pithdoi:10.1134/s1064230714030046
- [39] S. V. Karpushkin, M. N. Krasnyanskiy, and A. B. Borisenko. Retrofitting the Chemical- Engineering Systems of an Operating Multiproduct Plant When Production Plans Change. Khimicheskaya Promyshlennost’ Segodnya [Chemical Industry Today], (1):26–32, 2012. In Russian on Pith
- [40] V. V. Kafarov and V. V. Makarov.Flexible Automated Production Systems in the Chemical Industry. Khimiya, Moscow, 1990. ISBN 5-7245-0236-4. In Russian on Pith
- [41] R. Fletcher, J. A. J. Hall, and W. R. Johns. Flexible retrofit design of multiproduct batch plants.Computers & Chemical Engineering, 15(12):843–852, 1991. doi: 10.1016/0098-135 4(91)80029-u on Pithdoi:10.1016/0098-135
- [42] E. N. Malygin, S. V. Karpushkin, and A. B. Borisenko. Design of Multiproduct Chemical Plants: Determining the Equipment Configuration of Chemical-Engineering Flowsheets. 88 Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical... on Pith
- [43] E. N. Malygin, A. B. Borisenko, and S. V. Karpushkin. A Method for Determining the Equipment Configuration of Multiproduct Chemical-Engineering Systems.Khimicheskaya Promyshlennost’ Segodnya [Chemical Industry Today], (5):43–50, 2003. In Russian on Pith
- [44] S. V. Karpushkin, M. N. Krasnyanskiy, and A. B. Borisenko. A Method for Assessing the Efficiency of Equipment Configurations of Chemical-Engineering Systems of a Multiproduct Plant.Informatsionnye Sistemy i Tekhnologii [Information Systems and Technologies], (5(67)):96–105, 20... on Pith
- [45] E. N. Malygin, S. V. Karpushkin, and P. G. Mikhailova. Selection of Auxiliary Process Equipment for Multiproduct Chemical Plants.Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical University], 17(2): 483–487, 2011. In Russian on Pith
- [46] A. B. Borisenko, A. V. Antonenko, A. V. Osovskiy, and O. A. Filimonova. A System for the Computer-Aided Selection of Auxiliary Equipment for Multiproduct Chemical Plants.Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical Un... on Pith
- [47] Youness El Hamzaoui, J. A. Hernandez, M. A. Cruz-Chavez, and A. Bassam. Search for Optimal Design of Multiproduct Batch Plants under Uncertain Demand using Gaussian Process Modeling Solved by Heuristics Methods.Chemical Product and Process Modeling, 5(1), 2010. doi: 10.2202/19... on Pithdoi:10.2202/1934-2659.1426
- [48] Antonin Ponsich, Catherine Azzaro-Pantel, Serge Domenech, and Luc Pibouleau. Mixed- integer nonlinear programming optimization strategies for batch plant design problems. Industrial and Engineering Chemistry Research, 46(3):854–863, 2007. doi: 10.1021/ie0607 33d on Pithdoi:10.1021/ie0607
- [49] Yunfei Chu and Fengqi You. Integrated Planning, Scheduling, and Dynamic Optimization for Batch Processes: MINLP Model Formulation and Efficient Solution Methods via Surrogate Modeling.Industrial & Engineering Chemistry Research, 53(34):13391–13411, on Pith
- [50] G. Sandoval, D. Espinoza, N. Figueroa, and J. A. Asenjo. MILP reformulations for the design of biotechnological multi-product batch plants using continuous equipment sizes and discrete host selection.Computers & Chemical Engineering, 84:1–11, 2016. doi: 10.1016/j.compchemeng.2... on Pithdoi:10.1016/j.compchemeng.2015.08.001
- [51] Yanina Fumero, Gabriela Corsano, and Jorge M. Montagna. A Mixed Integer Linear Programming model for simultaneous design and scheduling of flowshop plants.Applied Mathematical Modelling, 37(4):1652–1664, 2013. doi: 10.1016/j.apm.2012.04.043 on Pithdoi:10.1016/j.apm.2012.04.043
- [52] Xiaoxia Lin and C. A. Floudas. Design, synthesis and scheduling of multipurpose batch plantsviaaneffectivecontinuous-timeformulation. InComputers and Chemical Engineering, volume 25, pages 665–674. Elsevier, 2001. doi: 10.1016/S0098-1354(01)00663-9 on Pithdoi:10.1016/s0098-1354(01)00663-9
- [53] Esmael R. Seid and Thokozani Majozi. Design and Synthesis of Multipurpose Batch Plants Using a Robust Scheduling Platform.Industrial & Engineering Chemistry Research, 52 (46):16301–16313, 2013. doi: 10.1021/ie4022495 on Pithdoi:10.1021/ie4022495
- [54] Andrey Borisenko, Philipp Kegel, and Sergei Gorlatch. Optimal Design of Multi-product Batch Plants Using a Parallel Branch-and-Bound Method. In Victor Malyshkin, editor, 89 Parallel Computing Technologies (PaCT 2011), volume 6873 ofLecture Notes in Computer Science, pages 417–... on Pithdoi:10.1007/978-3-642-23178
- [55] A. B. Borisenko and S. V. Karpushkin. Application of the Branch-and-Bound Method to the Optimal Equipment Selection for Chemical-Engineering Systems.Vychislitel’nye Tekhnologii [Computational Technologies], 17(1):35–43, 2012. In Russian on Pith
- [56] João Luís de Miranda. The design and scheduling of chemical batch processes: Computa- tional complexity studies.Computers & Chemical Engineering, 121:367–374, 2019. doi: 10.1016/j.compchemeng.2018.11.011 on Pithdoi:10.1016/j.compchemeng.2018.11.011
- [57] Andrey Borisenko and Sergei Gorlatch. Optimal Batch Plants Design on Parallel Systems: A Comparative Study. In2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pages 549–558, 2019. ISBN 978-1-7281-3510-6. doi: 10.1109/IPDPSW.2019.00097 on Pithdoi:10.1109/ipdpsw.2019.00097
- [58] E. N. Malygin, S. V. Karpushkin, and A. B. Borisenko. A mathematical model of the functioning of multiproduct chemical engineering systems.Theoretical Foundations of Chemical Engineering, 39(4):429–439, 2005. doi: 10.1007/s11236-005-0099-z. Translated from Teoreticheskie Osnov... on Pithdoi:10.1007/s11236-005-0099-z
- [59] D. W. T. Rippin. Design and Operation of Multiproduct and Multipurpose Batch Chemical Plants. – Analysis of Problem Structure.Computers & Chemical Engineering, 7(4):463–481, on Pith
- [60] A. P. Barbosa-Póvoa. A Critical Review on the Design and Retrofit of Batch Plants. Computers & Chemical Engineering, 31(7):833–855, 2007. doi: 10.1016/j.compchemeng.20 06.08.003 on Pithdoi:10.1016/j.compchemeng.20
- [61] G. R. Kocis and I. E. Grossmann. Global Optimization of Nonconvex Mixed-Integer Nonlinear Programming (MINLP) Problems in Process Synthesis.Industrial & Engineering Chemistry Research, 27(8):1407–1421, 1988. doi: 10.1021/ie00080a013 on Pithdoi:10.1021/ie00080a013
- [62] D. E. Ravemark and D. W. T. Rippin. Predesigning a Multiproduct Batch Plant by Mathematical Programming. In G. V. Reklaitis, A. K. Sunol, D. W. T. Rippin, and Ö. Hortaçsu, editors,Batch Processing Systems Engineering, volume 143 ofNATO ASI Series, pages 114–149. Springer, Berl... on Pithdoi:10.1007/978-3-642-60972-5
- [63] J. M. Montagna, A. R. Vecchietti, O. A. Iribarren, J. M. Pinto, and J. A. Asenjo. Op- timal Design of Protein Production Plants with Time and Size Factor Process Models. Biotechnology Progress, 16(2):228–237, 2000. doi: 10.1021/bp990145d on Pithdoi:10.1021/bp990145d
- [64] M. S. Moreno, O. A. Iribarren, and J. M. Montagna. Optimal Design of Multiproduct Batch Plants Considering Duplication of Units in Series.Chemical Engineering Research and Design, 87:1497–1508, 2009. doi: 10.1016/j.cherd.2009.04.014 on Pithdoi:10.1016/j.cherd.2009.04.014
- [65] E. N. Malygin and S. V. Karpushkin. Design of Multiproduct Chemical Plants: Determining the Cycle Times for Processing Product Batches.Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical University], 5(2): 201–212, 1999. In Russian on Pith
- [66] S. V. Karpushkin.Equipment Selection for Multiproduct Chemical Plants. Mashinostroenie- 1, Moscow, 2006. ISBN 5-94275-262-1. In Russian. 90 on Pith
- [67] S. V. Karpushkin.A Methodology for the Equipment Design of Multiproduct Chemical Plants. Dr. sci. (eng.) dissertation, Tambov State Technical University, Tambov, 2007. In Russian on Pith
- [68] Gilles Brassard and Paul Bratley.Fundamentals of Algorithmics. Prentice Hall, 1996 on Pith
- [69] David R. Morrison, Sheldon H. Jacobson, Jason J. Sauppe, and Edward C. Sewell. Branch- and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19:79–102, 2016. doi: 10.1016/j.disopt.2016.01.005 on Pithdoi:10.1016/j.disopt.2016.01.005
- [70] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein.Introduction to Algorithms. MIT Press, Cambridge, MA, 3rd edition, 2009. ISBN 978-0-262-03384-8 on Pith
- [71] D. E. Knuth.The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison- Wesley, Reading, MA, 2nd edition, 1998. ISBN 978-0-201-89685-5 on Pith
- [72] Sven Leyffer, Jeff Linderoth, James Luedtke, Andrew Miller, and Todd Munson. Appli- cations and algorithms for mixed integer nonlinear programming.Journal of Physics: Conference Series, 180:012014, 2009. doi: 10.1088/1742-6596/180/1/012014 on Pithdoi:10.1088/1742-6596/180/1/012014
- [73] Pierre Bonami, Mustafa Kilinç, and Jeff Linderoth. Algorithms and software for convex mixed integer nonlinear programs. InMixed Integer Nonlinear Programming, pages 1–39. Springer, 2012. doi: 10.1007/978-1-4614-1927-3_1 on Pithdoi:10.1007/978-1-4614-1927-3_1
- [74] Samuel Burer and Adam N. Letchford. Non-convex mixed-integer nonlinear programming: A survey.Surveys in Operations Research and Management Science, 17(2):97–106, 2012. doi: 10.1016/j.sorms.2012.08.001 on Pithdoi:10.1016/j.sorms.2012.08.001
- [75] M. A. Posypkin and I. Kh. Sigal. Investigation of Algorithms for Parallel Computations in Knapsack-Type Discrete Optimization Problems.Computational Mathematics and Mathematical Physics, 45(10):1735–1742, 2005. Translated from Zhurnal Vychislitel’noi Matematiki i Matematichesk... on Pith
- [76] A. B. Borisenko, D. V. Kutuzov, and A. V. Osovskiy. Application of Parallel Computing to the Calculation of the Equipment Configuration of Chemical-Engineering Systems.Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical Univ... on Pith
- [77] N. A. Ezhova and L. B. Sokolinsky. Parallel Computational Model for Multiprocessor Systems with Distributed Memory.Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering, 7(2):32–49, 2018. doi: 10.14529/c mse180203. In Russian on Pithdoi:10.14529/c
- [78] Ananth Grama and Vipin Kumar. State of the Art in Parallel Search Techniques for Discrete Optimization Problems.IEEE Transactions on Knowledge and Data Engineering, 11(1):28–35, 1999. doi: 10.1109/69.755612 on Pithdoi:10.1109/69.755612
- [79] Bernard Gendron and Teodor Gabriel Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis.Operations Research, 42(6):1042–1066, 1994. doi: 10.1287/opre.42.6. 1042 on Pithdoi:10.1287/opre.42.6
- [80] Vipin Kumar, Ananth Y. Grama, and Nageshwara Rao Vempaty. Scalable Load Balancing Techniques for Parallel Computers.Journal of Parallel and Distributed Computing, 22(1): 60–79, 1994 on Pith
- [81] N. E. Timoshevskaya. Parallel Tree Traversal Methods.Matematicheskoe Modelirovanie [Mathematical Modeling], 16(1):105–114, 2004. In Russian. 91 on Pith
- [82] A. B. Borisenko, S. V. Karpushkin, and A. O. Glebov. A Parallel Algorithm for Solving the Three-Dimensional Unsteady Heat Equation with an Explicit Difference Scheme.Vestnik Tambovskogo Gosudarstvennogo Tekhnicheskogo Universiteta [Transactions of Tambov State Technical Univer... on Pith
- [83] Teodor Gabriel Crainic, Bertrand Le Cun, and Catherine Roucairol. Parallel Branch-and- Bound Algorithms. In El-Ghazali Talbi, editor,Parallel Combinatorial Optimization, pages 1–28. Wiley, Hoboken, 2006. doi: 10.1002/9780470053928.ch1 on Pithdoi:10.1002/9780470053928.ch1
- [84] Wei Shu and L. V. Kale. A Dynamic Scheduling Strategy for the Chare-Kernel System. In Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pages 389–398, 1989 on Pith
- [85] V. Nageshwara Rao and Vipin Kumar. Parallel Depth First Search. Part I. Implementation. International Journal of Parallel Programming, 16(6):479–499, 1987 on Pith
- [86] Alexander Reinefeld and Volker Schnecke. Work-Load Balancing in Highly Parallel Depth- First Search. InProceedings of the Scalable High-Performance Computing Conference, pages 773–780, 1994 on Pith
- [87] Raphael Finkel and Udi Manber. DIB – A Distributed Implementation of Backtracking. ACM Transactions on Programming Languages and Systems, 9(2):235–256, 1987 on Pith
- [88] Peter Sanders. Better Algorithms for Parallel Backtracking. InParallel Algorithms for Irregularly Structured Problems, volume 980 ofLecture Notes in Computer Science, pages 333–347. Springer, 1995 on Pith
- [89] Robert D. Blumofe and Charles E. Leiserson. Scheduling Multithreaded Computations by Work Stealing.Journal of the ACM, 46(5):720–748, 1999 on Pith
- [90] V. Nageshwara Rao and Vipin Kumar. On the Efficiency of Parallel Backtracking.IEEE Transactions on Parallel and Distributed Systems, 4(4):427–437, 1993 on Pith
- [91] Ten-Hwang Lai and Sartaj Sahni. Anomalies in Parallel Branch-and-Bound Algorithms. Communications of the ACM, 27(6):594–602, 1984 on Pith
- [92] N. E. Timoshevskaya. Development and Study of Parallel Combinatorial Algorithms. Prikladnaya Diskretnaya Matematika [Applied Discrete Mathematics], (2(4)):96–103, 2009. In Russian on Pith
- [93] Mohamed Esseghir Lalami and Didier El-Baz. GPU Implementation of the Branch and Bound Method for Knapsack Problems. In2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pages 1763–1771, 2012. doi: 10.1109/IPDPSW.2012.219 on Pithdoi:10.1109/ipdpsw.2012.219
- [94] Andrey Borisenko, Michael Haidl, and Sergei Gorlatch. Parallelizing Branch-and-Bound on GPUs for Optimization of Multiproduct Batch Plants. In Victor Malyshkin, editor, Parallel Computing Technologies (PaCT 2015), volume 9251 ofLecture Notes in Computer Science, pages 324–337,... on Pithdoi:10.1007/978-3-319-21909-7_33
- [95] Andrey Borisenko, Michael Haidl, and Sergei Gorlatch. A GPU parallelization of branch- and-bound for multiproduct batch plants optimization.The Journal of Supercomputing, 73 (2):639–651, 2017. doi: 10.1007/s11227-016-1784-x on Pithdoi:10.1007/s11227-016-1784-x
- [96] Jan Gmys, Mohand Mezmaz, Nouredine Melab, and Daniel Tuyttens. A GPU-based Branch- and-Bound Algorithm using Integer-Vector-Matrix Data Structure.Parallel Computing, 59:119–139, 2016. doi: 10.1016/j.parco.2016.01.008. 92 on Pithdoi:10.1016/j.parco.2016.01.008
- [97] Nouredine Melab, Jan Gmys, Mohand Mezmaz, and Daniel Tuyttens. Multi-core versus Many-core Computing for Many-task Branch-and-Bound Applied to Big Optimization Problems.Future Generation Computer Systems, 82:472–481, 2018 on Pith
- [98] Ashkan Tousimojarad and Wim Vanderbauwhede. Number of Tasks, not Threads, is Key. In2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pages 128–136. IEEE, 2015. doi: 10.1109/PDP.2015.81 on Pithdoi:10.1109/pdp.2015.81
- [99] A. B. Borisenko and S. V. Karpushkin. Using OpenMP for the Optimal Equipment Selection of Multiproduct Plants.Vychislitel’nye Tekhnologii [Computational Technologies], 20(4):17–28, 2015. In Russian on Pith
- [100] OpenMP Architecture Review Board. The OpenMP API Specification for Parallel Pro- gramming, 2022. URLhttps://www.openmp.org/. Accessed 2026-10-18 on Pith
- [101] K. Aida, W. Natsume, and Y. Futakata. Distributed computing with hierarchical master- worker paradigm for parallel branch and bound algorithm. InCCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., pages 156–163. IEEE, 2003. ... on Pithdoi:10.1109/ccgrid.2003.1199364
The first 100 of 196 references are listed here. All of them are in this paper's citation record.
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment