An Algoritm for the Alocation Optimization of Trading Executions

Claudiu Vinte

Theoretical and Applied Economics, 2006, vol. 2(497), issue 2(497), 65-70

Abstract: In this paper, I wish to propose the Integer Allocation employing Tabu Search in conjunction with Simulated Annealing Heuristics for optimizing the distribution of trading executions in investors’ accounts. There is no polynomial algorithm discovered for Integer Linear Programming (a problem which is NP-complete). Generally, the practical experience shows that large-scale integer linear programs seem as yet practically unsolvable or extremely time-consuming. The algorithm described herein proposes an alternative approach to the problem. The algorithm consists of three steps: allocate the total executed quantity proportionally on the accounts, based on the allocation instructions (pro-rata basis); construct an initial solution, distributing the executed prices; improve the solution iteratively, employing Tabu Search in conjunction with Simulated Annealing heuristics.

Keywords: integer allocation; allocation instructions; pro-rata coefficient; optimization. (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
http://store.ectap.ro/articole/39.pdf (application/pdf)
http://www.ectap.ro/articol.php?id=39&rid=2 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:agr:journl:v:2(497):y:2006:i:2(497):p:65-70

Access Statistics for this article

Theoretical and Applied Economics is currently edited by Mircea Dinu

More articles in Theoretical and Applied Economics from Asociatia Generala a Economistilor din Romania / Editura Economica Contact information at EDIRC.
Bibliographic data for series maintained by Mircea Dinu ().