Decomposition Algorithms for a Multi-Hard Problem

Real-world optimization problems have been studied in the past, but the work resulted in approaches tailored to individual problems that could not be easily generalized. The reason for this limitation was the lack of appropriate models for the systematic study of salient aspects of real-world problems. The aim of this article is to study one of such aspects: multi-hardness. We propose a variety of decomposition-based algorithms for an abstract multi-hard problem and compare them against the most promising heuristics.

[1]  Adam Wierzbicki,et al.  Multi-hard Problems in Uncertain Environment , 2016, GECCO.

[2]  A. Booth.  Numerical Methods , 1957, Nature.

[3]  Z. Michalewicz,et al.  A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[5]  El-Ghazali Talbi,et al.  Metaheuristics for Bi-level Optimization , 2013 .

[6]  Michael Kearns,et al.  Experiments in social computation , 2012, KDD.

[7]  Piotr Turek,et al.  Learning about team collaboration from Wikipedia edit history , 2010, Int. Sym. Wikis.

[8]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[9]  Kris Braekers,et al.  The vehicle routing problem: State of the art classification and review , 2016, Comput. Ind. Eng..

[10]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[11]  Paolo Toth,et al.  The vehicle routing problem , 2001 .

[12]  Simon M. Lucas,et al.  Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[13]  Adam Wierzbicki,et al.  Socially inspired algorithms for the travelling thief problem , 2014, GECCO.

[14]  Monique Snoeck,et al.  Classification With Ant Colony Optimization , 2007, IEEE Transactions on Evolutionary Computation.

[15]  Zbigniew Michalewicz,et al.  Evolutionary computation for multicomponent problems: opportunities and future directions , 2016, Optimization in Industry.

[16]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[17]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[18]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[19]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[20]  Ralf Funke.  From Gobble to Zen: The Quest for Truly Intelligent Software and the Monte Carlo Revolution in Go , 2015 .

[21]  P. Toint,et al.  Local convergence analysis for partitioned quasi-Newton updates , 1982 .

[22]  B. Abramson.  The expected-outcome model of two-player games , 1990 .

[23]  Master Thesis,et al.  Applying Monte Carlo Techniques to the Capacitated Vehicle Routing Problem , 2010 .

[24]  Ryan B. Hayward,et al.  MOHEX Wins Hex Tournament , 2012, J. Int. Comput. Games Assoc..

[25]  H. R. Lourenço,et al.  Adaptive search heuristics for the generalized assignment problem , 2002 .

[26]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[27]  P. Turek,et al.  WikiTeams: How Do They Achieve Success? , 2011, IEEE Potentials.

[28]  Zbigniew Michalewicz,et al.  Quo Vadis, Evolutionary Computation? - On a Growing Gap between Theory and Practice , 2012, WCCI.

[29]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[30]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[31]  A. Rapoport,et al.  Connectivity of random nets , 1951 .

[32]  Simon M. Lucas,et al.  Monte-Carlo Tree Search for the Physical Travelling Salesman Problem , 2012, EvoApplications.

[33]  Vela Ela Velupillai.  The unreasonable ineffectiveness of mathematics in economics , 2005 .

[34]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..

[35]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[36]  Xiaodong Li,et al.  Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms , 2009, 2009 IEEE Congress on Evolutionary Computation.

[37]  Abdelaziz Bouras,et al.  Supply chain management: a framework to characterize the collaborative strategies , 2008, Int. J. Comput. Integr. Manuf..

[38]  David Pisinger,et al.  Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[39]  Zbigniew Michalewicz,et al.  Evolutionary Computation for Real-World Problems , 2016, Challenges in Computational Statistics and Data Mining.

[40]  Stefka Fidanova,et al.  ACO Algorithm for MKP Using Various Heuristic Information , 2002, Numerical Methods and Application.

[41]  Zbigniew Michalewicz,et al.  The travelling thief problem: The first step in the transition from theoretical problems to realistic problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

[42]  Alexandre V. Borovik.  Mathematics under the Microscope , 2009 .