{"paper_id":"2503.15965","title":"Practical Portfolio Optimization with Metaheuristics: Pre-assignment Constraint and Margin Trading","authors":["Hang Kin Poon"],"paper_date":"2025-03-20","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2503.15965v1","page_url":"https://thequant.space/flowcharts/practical-portfolio-optimization-with-metaheuristicspre-ass/","scores":{"empirical_rigor":3,"math_complexity":7,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes an innovative metaheuristic portfolio optimization method that uses pre‑assignment constraints to limit the search space and incorporates margin‑trading strategies.","quote":"This paper introduces an innovative approach to portfolio optimization that incorporates pre-assignment to limit the search space for investor preferences and better results.","summary":"Portfolio optimization is a critical area in finance, aiming to maximize returns while minimizing risk. Metaheuristic algorithms were shown to solve complex optimization problems efficiently, with Genetic Algorithms and Particle Swarm Optimization being among the most popular methods. This paper…","strategy":"Metaheuristic portfolio optimization with pre-assignment and margin trading"},"assumptions":{"status":"available","items":[{"assumption":"Pre‑assignment constraints reflect real‑world investor limitations and preferences.","type":"model","stated":"implied","quote":"By incorporating pre-assignment constraints, investors can narrow down the search space to reflect real-world limitations and preferences."},{"assumption":"Margin trading can be modeled with initial, maintenance margins and the risk of margin calls.","type":"execution","stated":"implied","quote":"Margin trading offers the potential for amplified returns by allowing investors to borrow funds to purchase assets. However, it also introduces significant risks, particularly the risk of a margin call."},{"assumption":"Single‑objective optimization (e.g., maximizing expected return) is computationally efficient compared to multi‑objective approaches.","type":"model","stated":"implied","quote":"This approach simplifies the optimization process by concentrating on a single criterion, making it computationally efficient and easier to implement compared to multi-objective optimization."},{"assumption":"The benchmark portfolio is the SPY index held 100% with annual rebalancing.","type":"data","stated":"explicit","quote":"Benchmark Period 01/01/2015 to 01/01/2025 Rebalancing frequency Annually Weights"}]},"datasets":{"status":"available","items":[{"name":"Optimized Portfolio vs Benchmark","provider":null,"kind":"market-prices","access":"unknown","period":"01/01/2015 to 01/01/2025","universe":"LLY, NVDA (optimized) and SPY (benchmark)","quote":"Table 1. Optimization Results vs Benchmark Optimized Portfolio Benchmark Period 01/01/2015 to 01/01/2025 Rebalancing frequency Annually Weights LLY 68.2%, NVDA 31.8% SPY 100% CAGR 50.64% 13.01% Maximum Drawdown"}],"known":[],"sample":{"start":"2015-01","end":"2025-01","market":"US equity market","asset_class":"equities","frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"available","modeled":"no","headline_net_of_costs":false,"detail":null,"quote":null,"source":"front_matter","rule":"R1","candidates":{"front_matter":"no","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"a trading or execution result is reported without costs"},"results":{"status":"available","evaluation_type":"trading-pnl","findings":[],"reported_performance":{"strategy":"Metaheuristic portfolio optimization with pre-assignment and margin trading","sharpe":1.18,"sharpe_benchmark":0.38,"annual_return_pct":50.64,"total_return_pct":null,"max_drawdown_pct":null},"out_of_sample":{"method":"none","headline_out_of_sample":false}},"independent_evidence":{"status":"not_extracted","supports":[],"contradicts":[],"qualifies":[],"compared_with":0,"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-14T17:42:12Z"},"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/"}