A Tabu Search heuristic procedure in Markov chain bootstrapping
Journal article
Cerqueti, R, Falbo, P, Guastaroba, G and Pelizzari, C (2013). A Tabu Search heuristic procedure in Markov chain bootstrapping. European Journal of Operational Research. 227 (2), pp. 367-384. https://doi.org/10.1016/j.ejor.2012.11.009
| Authors | Cerqueti, R, Falbo, P, Guastaroba, G and Pelizzari, C |
|---|---|
| Abstract | Markov chain theory is proving to be a powerful approach to bootstrap nite states processes, especially where time dependence is non linear. In this work we extend such approach to bootstrap discrete time continuous-valued processes. To this purpose we solve a minimization problem to partition the state space of a continuous-valued process into a nite number of intervals or unions of intervals (i.e. its states) and identify the time lags which provide \memory" to the process. A distance is used as objective function to |
| Keywords | Markov Chains; Bootstrapping; Heuristic Algorithms; Tabu Search; Electricity Prices |
| Year | 2013 |
| Journal | European Journal of Operational Research |
| Journal citation | 227 (2), pp. 367-384 |
| Publisher | Elsevier BV |
| ISSN | 0377-2217 |
| Digital Object Identifier (DOI) | https://doi.org/10.1016/j.ejor.2012.11.009 |
| Publication dates | |
| 01 Jun 2013 | |
| Online | 26 Nov 2012 |
| Publication process dates | |
| Accepted | 12 Nov 2012 |
| Deposited | 06 Apr 2020 |
| Accepted author manuscript | License File Access Level Controlled |
https://openresearch.lsbu.ac.uk/item/896vx
133
total views1
total downloads0
views this month0
downloads this month