Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model

Hinkelmann, 2012, vol. 3 Koza, 2010, Human-competitive results produced by genetic programming, Genet Program Evol M, 11, 251, 10.1007/s10710-010-9112-3 Adamo, 2017, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, Comput Oper Res, 83, 106, 10.1016/j.cor.2017.01.021 Hansen, 2010, Variable neighborhood search, 61 Fischetti, 2003, Local branching, Math Prog Ser-B, 98, 23, 10.1007/s10107-003-0395-5 Danna, 2005, Exploring relaxation induced neighborhoods to improve MIP solutions, Math Prog Ser-A, 102, 71, 10.1007/s10107-004-0518-7 Parisini, 2012, Sliced neighborhood search, Expert Syst Appl, 39, 5739, 10.1016/j.eswa.2011.11.096 Ghiani, 2015, Model-based automatic neighborhood design by unsupervised learning, Comput Oper Res, 54, 108, 10.1016/j.cor.2014.09.006 Adamo, 2016, Neighborhood synthesis from an ensemble of MIP and CP models, vol. 10079, 221 2009 Hansen, 2006, Variable neighborhood search and local branching, Comput Oper Res, 33, 3034, 10.1016/j.cor.2005.02.033 Lazić, 2010, Variable neighbourhood decomposition search for 0–1 mixed integer programs, Comput Oper Res, 37, 1055, 10.1016/j.cor.2009.09.010 Pillac, 2014, 71 Blum, 2016, Construct, merge, solve & adapt a new general algorithm for combinatorial optimization, Comput Oper Res, 68, 75, 10.1016/j.cor.2015.10.014 Van Hentenryck, 2007, Synthesis of constraint-based local search algorithms from high-level models, vol. 22, 273 Elsayed, 2011, Synthesis of search algorithms from high-level CP models, vol. 6876, 256 Van Hentenryck, 2009 Mouthuy, 2012, Constraint-based very large-scale neighborhood search, Constraints, 87, 87, 10.1007/s10601-011-9114-7 Kiziltan, 2012, Bounding, filtering and diversification in CP-based local branching, J Heuristics, 18, 353, 10.1007/s10732-011-9190-2 Burke, 2010, A classification of hyper-heuristic approaches, 449 Fukunaga, 2008, Automated discovery of local search heuristics for satisfiability testing, Evol Comput, 16, 31, 10.1162/evco.2008.16.1.31 Burke, 2009, Exploring hyper-heuristic methodologies with genetic programming, 177 van Lon, 2012, Evolutionary synthesis of multi-agent systems for dynamic dial-a-ride problems, 331 Hutter, 2007, Automatic algorithm configuration based on local search, vol. 22, 1152 Birattari, 2009 Hoos, 2012, Programming by optimization, Commun ACM, 55, 70, 10.1145/2076450.2076469 Birattari, 2002, A racing algorithm for configuring metaheuristics, 11 Balaprakash, 2007, Improvement strategies for the F-Race algorithm: sampling design and iterative refinement, vol. 4771, 108 Adenso-Díaz, 2006, Fine-tuning of algorithms using fractional experimental designs and local search, Oper Res, 54, 99, 10.1287/opre.1050.0243 Hutter, 2009, Paramils: an automatic algorithm configuration framework., J Artif Intell Res, 36, 267, 10.1613/jair.2861 López-Ibánez, 2016, The irace package: iterated racing for automatic algorithm configuration, Oper Res Perspect, 3, 43, 10.1016/j.orp.2016.09.002 Mascia, 2014, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, Comput Oper Res, 51, 190, 10.1016/j.cor.2014.05.020 Russell, 2010 Fourer, 1990, A modeling language for mathematical programming, Manage Sci, 36, 519, 10.1287/mnsc.36.5.519 Rosenthal, 2017 Van Hentenryck, 1999 Batini, 1992 Miller, 1960, Integer programming formulations and traveling salesman problems, J ACM, 7, 326, 10.1145/321043.321046 Parr, 2013 Reinelt, 1991, TSPLIB - a traveling salesman problem library, ORSA J Comput, 3, 376, 10.1287/ijoc.3.4.376 Fischetti, 1997, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Oper Res, 45, 378, 10.1287/opre.45.3.378 Desrochers, 1988, Vehicle routing with time windows: optimization and approximation, 65 Solomon, 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper Res, 35, 254, 10.1287/opre.35.2.254 CP Optimizer Forum. 2017. Last accessed on March, 23rd 2017; URL https://www.ibm.com/developerworks/community/forums/ajax/download/77777777-0000-0000-0000-000014932402/b9379ac1-721e-4d9f-aa4f-e768de6502b4/attachment_14932402_CVRPTW.mod. Nascimento, 2010, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, Eur J Oper Res, 200, 747, 10.1016/j.ejor.2009.01.047