Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem
暂无分享,去创建一个
Thomas Stützle | Armin Fügenschuh | Henning Homfeld | Prasanna Balaprakash | Zhi Yuan | Michael Schoch | T. Stützle | Prasanna Balaprakash | A. Fügenschuh | H. Homfeld | M. Schoch | Z. Yuan
[1] Armin Fügenschuh. Parametrized Greedy Heuristics in Theory and Practice , 2005, Hybrid Metaheuristics.
[2] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[3] Thomas Stützle,et al. The MAX–MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization , 1997 .
[4] Armin Fügenschuh,et al. Scheduling Locomotives and Car Transfers in Freight Transport , 2008, Transp. Sci..
[5] Thomas Stützle,et al. Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement , 2007, Hybrid Metaheuristics.
[7] Thomas Stützle,et al. Iterated Ants: An Experimental Study for the Quadratic Assignment Problem , 2006, ANTS Workshop.
[8] Thomas Stützle,et al. Ant Colony Optimization and Swarm Intelligence , 2008 .
[9] Christian Blum,et al. Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.
[10] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[11] Irène Charon,et al. The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..
[12] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .