Evolutionary Computation in Combinatorial Optimization
暂无分享,去创建一个
[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[2] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .
[3] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .
[4] Jonathan D. Cryer,et al. Time Series Analysis , 1986 .
[5] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[6] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[7] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[8] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[9] M. G. Kantor,et al. The Orienteering Problem with Time Windows , 1992 .
[10] Zbigniew Michalewicz,et al. Genetic Algorithms for the 0/1 Knapsack Problem , 1994, ISMIS.
[11] Zbigniew Michalewicz,et al. Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .
[12] Nicolas Monmarché,et al. On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..
[13] Erick Cantú-Paz,et al. A Survey of Parallel Genetic Algorithms , 2000 .
[14] Francisco Barahona,et al. The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..
[15] Risto Miikkulainen,et al. Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.
[16] Marin Golub,et al. Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .
[17] Hans Kellerer,et al. Knapsack problems , 2004 .
[18] Krzysztof Socha,et al. ACO for Continuous and Mixed-Variable Optimization , 2004, ANTS Workshop.
[19] Natashia Boland,et al. Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..
[20] J. Reese,et al. Solution methods for the p-median problem: An annotated bibliography , 2006 .
[21] Rajeev Kumar,et al. Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem , 2006, Theor. Comput. Sci..
[22] Sreeram Ramakrishnan,et al. A hybrid approach for feature subset selection using neural networks and ant colony optimization , 2007, Expert Syst. Appl..
[23] Yuren Zhou,et al. A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems , 2007, IEEE Transactions on Evolutionary Computation.
[24] Boleslaw K. Szymanski,et al. The Effects of Heterogeneity on Asynchronous Panmictic Genetic Search , 2007, PPAM.
[25] Pierre Hansen,et al. The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..
[26] Marco Dorigo,et al. Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..
[27] César Hervás-Martínez,et al. JCLEC: a Java framework for evolutionary computation , 2007, Soft Comput..
[28] Roberto Montemanni,et al. An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.
[29] Pietro Simone Oliveto,et al. Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems , 2009, IEEE Transactions on Evolutionary Computation.
[30] Kenneth O. Stanley,et al. A Hypercube-Based Encoding for Evolving Large-Scale Neural Networks , 2009, Artificial Life.
[31] Krzysztof Socha,et al. Ant Colony Optimisation for Continuous and Mixed-Variable Domains , 2009 .
[32] David Ardia,et al. DEoptim: An R Package for Global Optimization by Differential Evolution , 2009 .
[33] J. Reese,et al. Fast and robust techniques for the euclidean p-median problem with uniform weights , 2009, Comput. Ind. Eng..
[34] Dirk Van Oudheusden,et al. Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..
[35] Giovanni Righini,et al. Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..
[36] Charles ReVelle,et al. Central Facilities Location , 2010 .
[37] Durdu Ömer Faruk. A hybrid neural network and ARIMA model for water quality time series prediction , 2010, Eng. Appl. Artif. Intell..
[38] Abdullah Bal,et al. Cellular Neural Network training by ant colony optimization algorithm , 2010, 2010 IEEE 18th Signal Processing and Communications Applications Conference.
[39] R. Montemanni,et al. An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows , 2011, 2011 International Symposium on Computer Science and Society.
[40] Martin Lukasiewycz,et al. Opt4J: a modular framework for meta-heuristic optimization , 2011, GECCO '11.
[41] Nacima Labadie,et al. Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.
[42] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[43] Kamala Irene Shetty. Current and Historical Trends in General Aviation in the United States , 2012 .
[44] Nacima Labadie,et al. The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..
[45] Shih-Wei Lin,et al. A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..
[46] Mengjie Han,et al. Does Euclidean distance work well when the p-median model is applied in rural areas? , 2012, Ann. Oper. Res..
[47] Gino J. Lim,et al. GPU-based parallel vertex substitution algorithm for the p-median problem , 2013, Comput. Ind. Eng..
[48] Arun Pandian. Training neural networks with ant colony optimization , 2013 .
[49] Mengjie Han,et al. How Does Different Algorithm Work When Applied on the Different Road Networks When Optimal Location of Facilities Is Searched for in Rural Areas? , 2013, WISE Workshops.
[50] Andrew Lim,et al. An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..
[51] Yuren Zhou,et al. Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem , 2014, IEEE Transactions on Evolutionary Computation.