{"paper_id":"2307.04045","title":"Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation","authors":["Alexander Nikiporenko"],"paper_date":"2023-07-08","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2307.04045v1","page_url":"https://thequant.space/flowcharts/time-limited-metaheuristics-for-cardinality-constrained-port/","scores":{"empirical_rigor":4.5,"math_complexity":6.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes evaluating metaheuristics under fixed time limits to compare solution quality directly.","quote":"This study proposes a different way of testing metaheuristics, limiting their computation time to a certain duration, yielding results that differ only in quality.","summary":"A financial portfolio contains assets that offer a return with a certain level of risk. To maximise returns or minimise risk, the portfolio must be optimised - the ideal combination of optimal quantities of assets must be found. The number of possible combinations is vast. Furthermore, to make the…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Execution time for market orders is less than one second, making sub‑second solutions potentially too late for real‑world use.","type":"execution","stated":"explicit","quote":"Given that the execution time for market orders is less than a second[6], a solution found in 5 seconds may already be too late."},{"assumption":"Backtesting on historical data can approximate real trading performance despite risks of overfitting.","type":"model","stated":"explicit","quote":"Backtesting involves a number of risks, the most significant of which is overfitting, which results in the algorithms only performing well on a specific dataset[37]."},{"assumption":"Using multiple datasets with different numbers of assets mitigates overfitting risk.","type":"data","stated":"explicit","quote":"To prevent this, the metaheuristics are tested on five datasets containing different numbers of assets."},{"assumption":"Solution quality is measured by deviation from the unconstrained efficient frontier (UEF).","type":"statistical","stated":"explicit","quote":"These values have been calculated using Numerical Algorithms Group library routine E04NAF[44] for evaluating the quality of solution portfolios by measuring their deviation from the UEF[12]."},{"assumption":"Stochastic metaheuristics require multiple runs and averaging to obtain reliable quality estimates.","type":"model","stated":"explicit","quote":"Furthermore, given that all the metaheuristics chosen for this study make stochastic decisions, the quality of their solutions is not consistent[22]. Therefore, each algorithm is tested several times and the results are averaged."}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_extracted","modeled":"unclear","headline_net_of_costs":null,"detail":null,"quote":null,"source":"none","rule":"R0","candidates":{"front_matter":"unclear","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"the classifier was not confident"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[{"finding":"Simulated annealing (SA) found near‑optimal solutions within 5 seconds for all but one dataset, outperforming the other metaheuristics.","kind":"performance","quote":"Although the metaheuristics could not find a competitive solution in 1 second, simulated annealing found a near-optimal solution in 5 seconds in all but one dataset."},{"finding":"Genetic algorithm (GA) produced the lowest‑quality solutions and failed to find competitive results even at 5 seconds.","kind":"performance","quote":"The lowest quality solutions were obtained by genetic algorithm."},{"finding":"SA showed the smallest percentage improvement between 5‑25 seconds across all datasets, indicating faster convergence.","kind":"performance","quote":"SA offers the lowest percentage of improvement between 5-25 seconds for all datasets."},{"finding":"MPEs obtained under the 25‑second limit were smaller than those reported in prior studies for all but one case (GA on Nikkei‑225).","kind":"performance","quote":"... MPEs obtained under the 25-second time limits in this study are smaller in all but one case, the GA on Nikkei‑225."},{"finding":"Compared to a previous study, SA achieved a lower average MPE (1.2507 vs 1.4391), demonstrating improved solution quality.","kind":"performance","quote":"Compared to the results obtained in [13], only the SA implemented in this study shows better results: in [13] the average MPE is 1.4391 compared to 1.2507 in this study."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":24,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:24:58Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}