Research trends in combinatorial optimisation

Jann Michael Weinand; Kenneth S\"orensen; Max Kleinebrahm; Pablo San Segundo; Russell McKenna

arxiv: 2012.01294 · v1 · submitted 2020-12-02 · 💰 econ.GN · q-fin.EC

Research trends in combinatorial optimisation

Jann Michael Weinand , Kenneth S\"orensen , Pablo San Segundo , Max Kleinebrahm , Russell McKenna This is my paper

Pith reviewed 2026-05-24 14:49 UTC · model grok-4.3

classification 💰 econ.GN q-fin.EC

keywords combinatorial optimisationbibliometric analysismetaheuristicsgenetic algorithmsenergy sectorproduction sectorresearch trendsdata management

0 comments

The pith

Analysis of 8393 papers shows combinatorial optimisation research centres on metaheuristics while shifting toward energy and production applications.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper performs a bibliometric study of 8393 articles to map dominant patterns in combinatorial optimisation. It concludes that the bulk of work develops or refines metaheuristics such as genetic algorithms. At the same time, an increasing share of studies targets concrete problems in the energy sector, production sector, and data management. These patterns are linked to broader global developments that raise the practical demand for such methods. The resulting overview is intended to help researchers locate the most active issues in a growing field.

Core claim

Publications on combinatorial optimisation focus mainly on the development or enhancement of metaheuristics like genetic algorithms. The increasingly problem-oriented studies deal particularly with real-world applications within the energy sector, production sector or data management, which are of increasing relevance due to various global developments.

What carries the argument

A corpus of 8393 articles examined with mathematical methods and a novel keyword analysis algorithm that identifies the most relevant problems, solution methods and application areas.

If this is right

The emphasis on metaheuristics such as genetic algorithms is expected to persist as the core activity in the field.
Problem-oriented work will continue to grow in the energy, production and data-management sectors.
Global developments will keep raising the relevance of these application areas.
Researchers can use the identified trends to locate active issues within the expanding research area.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

If the observed shift toward applications holds, training programs may place greater weight on domain-specific modelling alongside algorithmic development.
The same bibliometric approach could be applied to sub-fields such as scheduling or routing to test whether the metaheuristic dominance appears there as well.
Rising energy-sector applications may create demand for benchmark instances drawn from real grid or renewable data rather than synthetic test sets.

Load-bearing premise

The 8393 articles chosen by the search criteria plus the keyword analysis algorithm capture the true dominant trends without meaningful selection or classification bias.

What would settle it

A repeat of the analysis on a different database or with altered search terms that produces a substantially different ranking of the leading solution methods or application sectors.

read the original abstract

Real-world problems are becoming highly complex and, therefore, have to be solved with combinatorial optimisation (CO) techniques. Motivated by the strong increase of publications on CO, 8,393 articles from this research field are subjected to a bibliometric analysis. The corpus of literature is examined using mathematical methods and a novel algorithm for keyword analysis. In addition to the most relevant countries, organisations and authors as well as their collaborations, the most relevant CO problems, solution methods and application areas are presented. Publications on CO focus mainly on the development or enhancement of metaheuristics like genetic algorithms. The increasingly problem-oriented studies deal particularly with real-world applications within the energy sector, production sector or data management, which are of increasing relevance due to various global developments. The demonstration of global research trends in CO can support researchers in identifying the relevant issues regarding this expanding and transforming research area.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This is a standard bibliometric mapping of combinatorial optimisation literature that flags a tilt toward metaheuristics and energy/production applications, but the corpus selection and keyword algorithm lack the transparency needed to trust the trends.

read the letter

The main takeaway is that this paper runs a bibliometric scan on 8393 CO articles and reports that work is concentrating on metaheuristics such as genetic algorithms, with growing attention to real applications in energy, production, and data management. It also lists top countries, organisations, authors, and collaboration patterns. That is the core output. The paper does a straightforward job of pulling together publication counts and keyword patterns into one overview, which can save someone time when they want a quick sense of activity levels across the field. The use of a keyword analysis step on top of basic counts is the only element that goes beyond the most common bibliometric templates. The soft spots sit in the methods. The abstract states the corpus size and the headline trends but gives no search strings, databases, date filters, or document-type rules. The novel keyword algorithm is named but not laid out, so there is no way to judge whether it improves on standard co-word or topic-model approaches or whether it introduces its own classification errors. If the retrieval step over-samples certain journals or the algorithm tags application keywords inconsistently, the reported dominance of metaheuristics and the three application sectors could shift. The work stays purely descriptive; it does not test new CO methods or resolve any open optimisation question. This kind of paper is mainly useful to researchers who are already inside combinatorial optimisation and want a literature map for spotting collaboration or topic ideas. Readers outside the subfield or those looking for methodological advances will find little to take away. It deserves a serious referee provided the full text supplies the missing retrieval details and at least basic validation or sensitivity checks on the algorithm. Without those, it is too opaque for most journals that handle bibliometric studies.

Referee Report

3 major / 2 minor

Summary. The paper conducts a bibliometric analysis of 8,393 articles on combinatorial optimisation (CO), employing mathematical methods and a novel keyword analysis algorithm to identify dominant countries, organisations, authors, CO problems, solution methods (primarily metaheuristics such as genetic algorithms), and application areas (energy, production, data management). It concludes that research is shifting toward problem-oriented real-world applications driven by global developments.

Significance. If the corpus construction and keyword classification prove robust and reproducible, the work would offer a descriptive map of CO research trends that could help scholars prioritise metaheuristic development and sector-specific applications. No machine-checked proofs, reproducible code, or falsifiable predictions are presented.

major comments (3)

[Abstract and §2] Abstract and §2 (Data collection): the corpus of exactly 8,393 articles is stated without any description of the database(s), search strings, date range, document-type filters, language restrictions, or inclusion/exclusion criteria. Because every subsequent count and trend rests on this retrieval step, the absence of these details prevents verification that the reported dominance of metaheuristics and the three application sectors is not an artefact of selection bias.
[§3] §3 (Keyword analysis algorithm): the paper introduces a “novel algorithm for keyword analysis” whose mechanics, pseudocode, validation against gold-standard co-word or topic-model methods, and robustness/sensitivity checks are not supplied. The central claims—that publications focus mainly on genetic algorithms and that applications cluster in energy/production/data management—depend directly on the outputs of this unvalidated procedure.
[§4] §4 (Results on solution methods): quantitative evidence supporting the claim that metaheuristics dominate (e.g., share of articles, top keywords with frequencies, or comparison tables) is presented without confidence intervals, inter-rater reliability for the novel algorithm, or alternative classifications that would test whether the dominance finding survives different keyword groupings.

minor comments (2)

[Abstract] The abstract and introduction repeat the same high-level conclusions without distinguishing descriptive statistics from interpretive claims.
[Figures/Tables] Figure and table captions lack sufficient detail on how keyword frequencies were aggregated or normalised.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments, which highlight important aspects of reproducibility and methodological transparency in our bibliometric study. We address each major comment below and will revise the manuscript to strengthen these elements.

read point-by-point responses

Referee: [Abstract and §2] Abstract and §2 (Data collection): the corpus of exactly 8,393 articles is stated without any description of the database(s), search strings, date range, document-type filters, language restrictions, or inclusion/exclusion criteria. Because every subsequent count and trend rests on this retrieval step, the absence of these details prevents verification that the reported dominance of metaheuristics and the three application sectors is not an artefact of selection bias.

Authors: We agree that explicit documentation of the corpus construction is essential for reproducibility. In the revised manuscript, §2 will be expanded to specify the database(s) used, the exact search strings and Boolean operators, the date range, document-type filters (e.g., articles only), language restrictions, and all inclusion/exclusion criteria that yielded the 8,393 articles. revision: yes
Referee: [§3] §3 (Keyword analysis algorithm): the paper introduces a “novel algorithm for keyword analysis” whose mechanics, pseudocode, validation against gold-standard co-word or topic-model methods, and robustness/sensitivity checks are not supplied. The central claims—that publications focus mainly on genetic algorithms and that applications cluster in energy/production/data management—depend directly on the outputs of this unvalidated procedure.

Authors: The current description in §3 outlines the conceptual steps of the keyword analysis algorithm but omits implementation details. We will add pseudocode, a step-by-step mechanics explanation, and a new subsection on validation (including comparison to standard co-word analysis and topic modeling) plus sensitivity checks to confirm that the dominance of genetic algorithms and the three application sectors remain stable under alternative parameter settings. revision: yes
Referee: [§4] §4 (Results on solution methods): quantitative evidence supporting the claim that metaheuristics dominate (e.g., share of articles, top keywords with frequencies, or comparison tables) is presented without confidence intervals, inter-rater reliability for the novel algorithm, or alternative classifications that would test whether the dominance finding survives different keyword groupings.

Authors: Bibliometric studies are primarily descriptive, so classical confidence intervals are not standard; however, we will add explicit frequency tables and percentage shares for solution-method keywords. For the novel algorithm we will include robustness checks via alternative keyword groupings and report any inter-algorithm agreement metrics. We maintain that inter-rater reliability metrics are less applicable to deterministic keyword algorithms than to manual coding. revision: partial

Circularity Check

0 steps flagged

No circularity: purely descriptive bibliometric study with no derivations or self-referential predictions.

full rationale

The paper conducts a bibliometric analysis of 8393 articles on combinatorial optimisation, identifying trends in methods and applications via a novel keyword algorithm. No equations, fitted parameters, predictions, or derivations appear in the provided text or abstract. The central claims rest on corpus selection and keyword classification rather than any chain that reduces to its own inputs by construction. None of the six enumerated circularity patterns apply, as there are no self-citations invoked as load-bearing uniqueness theorems, no ansatzes smuggled via citation, and no renaming of known results presented as novel derivations. This is a standard descriptive literature review whose validity hinges on external validation of the corpus and algorithm, not internal circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on the representativeness of the chosen article corpus and the correctness of the keyword algorithm; both are domain assumptions with no independent verification supplied in the abstract.

axioms (2)

domain assumption The 8393 articles retrieved constitute a representative sample of combinatorial optimisation research.
All trend statements depend on this premise being true.
ad hoc to paper The novel keyword analysis algorithm produces unbiased and complete trend classifications.
The paper introduces this algorithm as the basis for its keyword findings.

pith-pipeline@v0.9.0 · 5684 in / 1273 out tokens · 26856 ms · 2026-05-24T14:49:12.574904+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

[1]

Abido, M. A. (2002) ‘Optimal power flow using particle swarm optimization’, International Journal of Electrical Power & Energy Systems, vol. 24, no. 7, pp. 563–571. Akiba, T. and Iwata, Y. (2016) ‘Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover’, Theoretical Computer Science, vol. 609, pp. 211–225. Alharbi, F., Tian,...

work page 2002
[2]

Computers and intractability: A guide to the theory of NP-completeness, 27th edn, New York u.a, Freeman. Geem, Z. W., Kim, J. H. and Loganathan, G. V. (2001) ‘A New Heuristic Optimization Algorithm: Harmony Search’, SIMULATION, vol. 76, no. 2, pp. 60–68. Gendreau, M. and Potvin, J.-Y. (2005) ‘Metaheuristics in Combinatorial Optimization’, Annals of Operat...

work page 2001
[3]

(1976) ‘Integer programming formulation of combinatorial optimization problems’, Discrete Mathematics, vol

Ibaraki, T. (1976) ‘Integer programming formulation of combinatorial optimization problems’, Discrete Mathematics, vol. 16, no. 1, pp. 39–52. Jaqaman, K., Loerke, D., Mettlen, M., Kuwata, H., Grinstein, S., Schmid, S. L. and Danuser, G. (2008) ‘Robust single-particle tracking in live-cell time-lapse sequences’, Nature Methods, vol. 5, no. 8, pp. 695–702. ...

work page 1976
[4]

and Xu, K

Li, C.-M., Fang, Z., Jiang, H. and Xu, K. (2018) ‘Incremental Upper Bound for the Maximum Clique Problem’, INFORMS Journal on Computing, vol. 30, no. 1, pp. 137–153. Loiola, E. M., Abreu, N. M. M. de, Boaventura-Netto, P. O., Hahn, P. and Querido, T. (2007) ‘A survey for the quadratic assignment problem’, European Journal of Operational Research, vol. 176...

work page arXiv 2018
[5]

improved Clarke and Wright savings algorithm

Mohammadi Bidhandi, H., Mohd. Yusuff, R., Megat Ahmad, M. M. H. and Abu Bakar, M. R. (2009) ‘Development of a new approach for deterministic supply chain network design’, European Journal of Operational Research, vol. 198, no. 1, pp. 121–128. Mundi, I., Alemany, M. M. E., Poler, R. and Fuertes-Miquel, V. S. (2019) ‘Review of mathematical models for produc...

work page arXiv 2009
[6]

Watson, J.-P., Beck, J.C., Howe, A. E. and Whitley, L.D. (2003) ‘Problem difficulty for tabu search in job-shop scheduling’, Artificial Intelligence, vol. 143, no. 2, pp. 189–217. Weinand, J. M. (2020) ‘Reviewing Municipal Energy System Planning in a Bibliometric Analysis: Evolution of the Research Field between 1991 and 2019’, Energies, vol. 13, no. 6, p

work page 2003
[7]

M., Kleinebrahm, M., McKenna, R., Mainzer, K

Weinand, J. M., Kleinebrahm, M., McKenna, R., Mainzer, K. and Fichtner, W. (2019) ‘Developing a combinatorial optimisation approach to design district heating networks based on deep geothermal energy’, Applied Energy, vol. 251, p. 113367. Wen, L., Zhou, K., Yang, S. and Li, L. (2018) ‘Compression of smart meter big data: A survey’, Renewable and Sustainab...

work page 2019
[8]

and Lin, G

Yao, X., Liu, Y. and Lin, G. (1999) ‘Evolutionary programming made faster’, IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82–102. Zäpfel, G., Braune, R. and Bögl, M. (2010) ‘Summarizing Remarks on Metaheuristics’, in Zäpfel, G., Bögl, M. and Braune, R. (eds) Metaheuristic Search Concepts: A Tutorial with Applications to Production and ...

work page 1999

[1] [1]

Abido, M. A. (2002) ‘Optimal power flow using particle swarm optimization’, International Journal of Electrical Power & Energy Systems, vol. 24, no. 7, pp. 563–571. Akiba, T. and Iwata, Y. (2016) ‘Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover’, Theoretical Computer Science, vol. 609, pp. 211–225. Alharbi, F., Tian,...

work page 2002

[2] [2]

Computers and intractability: A guide to the theory of NP-completeness, 27th edn, New York u.a, Freeman. Geem, Z. W., Kim, J. H. and Loganathan, G. V. (2001) ‘A New Heuristic Optimization Algorithm: Harmony Search’, SIMULATION, vol. 76, no. 2, pp. 60–68. Gendreau, M. and Potvin, J.-Y. (2005) ‘Metaheuristics in Combinatorial Optimization’, Annals of Operat...

work page 2001

[3] [3]

(1976) ‘Integer programming formulation of combinatorial optimization problems’, Discrete Mathematics, vol

Ibaraki, T. (1976) ‘Integer programming formulation of combinatorial optimization problems’, Discrete Mathematics, vol. 16, no. 1, pp. 39–52. Jaqaman, K., Loerke, D., Mettlen, M., Kuwata, H., Grinstein, S., Schmid, S. L. and Danuser, G. (2008) ‘Robust single-particle tracking in live-cell time-lapse sequences’, Nature Methods, vol. 5, no. 8, pp. 695–702. ...

work page 1976

[4] [4]

and Xu, K

Li, C.-M., Fang, Z., Jiang, H. and Xu, K. (2018) ‘Incremental Upper Bound for the Maximum Clique Problem’, INFORMS Journal on Computing, vol. 30, no. 1, pp. 137–153. Loiola, E. M., Abreu, N. M. M. de, Boaventura-Netto, P. O., Hahn, P. and Querido, T. (2007) ‘A survey for the quadratic assignment problem’, European Journal of Operational Research, vol. 176...

work page arXiv 2018

[5] [5]

improved Clarke and Wright savings algorithm

Mohammadi Bidhandi, H., Mohd. Yusuff, R., Megat Ahmad, M. M. H. and Abu Bakar, M. R. (2009) ‘Development of a new approach for deterministic supply chain network design’, European Journal of Operational Research, vol. 198, no. 1, pp. 121–128. Mundi, I., Alemany, M. M. E., Poler, R. and Fuertes-Miquel, V. S. (2019) ‘Review of mathematical models for produc...

work page arXiv 2009

[6] [6]

Watson, J.-P., Beck, J.C., Howe, A. E. and Whitley, L.D. (2003) ‘Problem difficulty for tabu search in job-shop scheduling’, Artificial Intelligence, vol. 143, no. 2, pp. 189–217. Weinand, J. M. (2020) ‘Reviewing Municipal Energy System Planning in a Bibliometric Analysis: Evolution of the Research Field between 1991 and 2019’, Energies, vol. 13, no. 6, p

work page 2003

[7] [7]

M., Kleinebrahm, M., McKenna, R., Mainzer, K

Weinand, J. M., Kleinebrahm, M., McKenna, R., Mainzer, K. and Fichtner, W. (2019) ‘Developing a combinatorial optimisation approach to design district heating networks based on deep geothermal energy’, Applied Energy, vol. 251, p. 113367. Wen, L., Zhou, K., Yang, S. and Li, L. (2018) ‘Compression of smart meter big data: A survey’, Renewable and Sustainab...

work page 2019

[8] [8]

and Lin, G

Yao, X., Liu, Y. and Lin, G. (1999) ‘Evolutionary programming made faster’, IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82–102. Zäpfel, G., Braune, R. and Bögl, M. (2010) ‘Summarizing Remarks on Metaheuristics’, in Zäpfel, G., Bögl, M. and Braune, R. (eds) Metaheuristic Search Concepts: A Tutorial with Applications to Production and ...

work page 1999