Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem

In this paper, the problem of maximizing the median of a convex combination of vectors having important applications in finance is considered. The objective function is a highly nonlinear, nondifferentiable function with many local minima and the problem was shown to be APX hard. We present two hybrid Large Neighborhood Search algorithms that are based on mixed-integer programs and include a time limit for their running times. We have tested the algorithms on three testbeds and showed their superiority compared to other state-of-the-art heuristics for the considered problem. Furthermore, we achieved a significant reduction in running time for large instances compared to solving it exactly while retaining high quality of the solutions returned.

[1]  Allen T. Craig,et al.  Introduction to Mathematical Statistics (6th Edition) , 2005 .

[2]  Jian Hu,et al.  Sample Average Approximation for Stochastic Dominance Constrained Programs , 2009 .

[3]  H. Konno,et al.  Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market , 1991 .

[4]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[5]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[6]  Günther R. Raidl,et al.  A Unified View on Hybrid Metaheuristics , 2006, Hybrid Metaheuristics.

[7]  Romeo Rizzi,et al.  The optimal statistical median of a convex set of arrays , 2009, J. Glob. Optim..

[8]  Donald Goldfarb,et al.  Robust Portfolio Selection Problems , 2003, Math. Oper. Res..

[9]  S. Rachev.  Handbook of heavy tailed distributions in finance , 2003 .

[10]  Günther R. Raidi.  A unified view on hybrid metaheuristics , 2006 .

[11]  M. Arulraj,et al.  Global Portfolio Optimization for BSE Sensex using the Enhanced Black Litterman Model , 2012 .

[12]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[13]  Romeo Rizzi,et al.  A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem , 2007, Eur. J. Oper. Res..

[14]  P. Greenwood,et al.  A Guide to Chi-Squared Testing , 1996 .

[15]  Markus Leitner,et al.  Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.

[16]  Christian Blum,et al.  Hybrid Metaheuristics, An Emerging Approach to Optimization , 2008, Hybrid Metaheuristics.

[17]  Robert V. Hogg,et al.  Introduction to Mathematical Statistics. , 1966 .

[18]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[19]  Christian Blum,et al.  Hybrid Metaheuristics: An Introduction , 2008, Hybrid Metaheuristics.

[20]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[21]  Tao Yao,et al.  A robust mean absolute deviation model for portfolio optimization , 2011, Comput. Oper. Res..

[22]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[23]  Stefano Benati,et al.  Heuristic methods for the optimal statistic median problem , 2011, Comput. Oper. Res..

[24]  Francisco J. Nogales,et al.  Portfolio Selection With Robust Estimation , 2007, Oper. Res..

[25]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .