Artificial search agents with cognitive intelligence for binary optimization problems
暂无分享,去创建一个
[1] Massimo Paolucci,et al. A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..
[2] Haldun Süral,et al. A review of hierarchical facility location models , 2007, Comput. Oper. Res..
[3] Andrew Lewis,et al. Grey Wolf Optimizer , 2014, Adv. Eng. Softw..
[4] Fehmi Burcin Ozsoydan,et al. Heuristic solution approaches for the cumulative capacitated vehicle routing problem , 2013 .
[5] Xin-She Yang,et al. Firefly Algorithms for Multimodal Optimization , 2009, SAGA.
[6] Shengxiang Yang,et al. A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems , 2009, Soft Comput..
[7] Adil Baykasoglu,et al. Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization , 2017, Inf. Sci..
[8] Ahmed Chiheb Ammari,et al. An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem , 2015, Journal of Intelligent Manufacturing.
[9] Minghe Sun. Solving the uncapacitated facility location problem using tabu search , 2006, Comput. Oper. Res..
[10] Georgios Dounias,et al. A hybrid particle swarm optimization algorithm for the vehicle routing problem , 2010, Eng. Appl. Artif. Intell..
[11] Michael August,et al. AutoMigrate: a framework for developing intelligent, self-managing cloud services with maximum availability , 2016, 2016 International Conference on Cloud and Autonomic Computing (ICCAC).
[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[13] Xizhao Wang,et al. A novel binary artificial bee colony algorithm for the set-union knapsack problem , 2018, Future Gener. Comput. Syst..
[14] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[15] Russell C. Eberhart,et al. A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.
[16] Rajan Batta,et al. On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..
[17] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[18] Adil Baykasoglu,et al. Quantum firefly swarms for multimodal dynamic optimization problems , 2019, Expert Syst. Appl..
[19] Akihiro Yamamura,et al. Application of the firefly algorithm to the uncapacitated facility location problem , 2017, J. Intell. Fuzzy Syst..
[20] Francisco Herrera,et al. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..
[21] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .
[22] R. J. Kuo,et al. Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - A case study on garbage collection system , 2012, Appl. Math. Comput..
[23] Magdalene Marinaki,et al. A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..
[24] Yixin Yin,et al. An algorithmic framework of discrete particle swarm optimization , 2012, Appl. Soft Comput..
[25] Mehmet Sevkli,et al. A Continuous Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem , 2006, ANTS Workshop.
[26] Juan Lin,et al. Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem , 2018, Swarm Evol. Comput..
[27] Zhiming Wu,et al. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..
[28] Ryuichi Hirabayashi,et al. OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS , 1984 .
[29] Adil Baykasoglu,et al. A swarm intelligence-based algorithm for the set-union knapsack problem , 2019, Future Gener. Comput. Syst..
[30] Trevor S. Hale,et al. Location Science Research: A Review , 2003, Ann. Oper. Res..
[31] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[32] Angel A. Juan,et al. Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic , 2017, J. Oper. Res. Soc..
[33] Mehmet Sevkli,et al. A discrete particle swarm optimization algorithm for uncapacitated facility location problem , 2008 .
[34] O. Goldschmidt,et al. Note: On the set-union knapsack problem , 1994 .
[35] Xin-She Yang,et al. Flower Pollination Algorithm for Global Optimization , 2012, UCNC.
[36] K. Jörnsten,et al. Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing , 1990 .
[37] Dongmei Chen,et al. An improved knowledge-informed NSGA-II for multi-objective land allocation (MOLA) , 2018, Geo spatial Inf. Sci..
[38] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[39] P. N. Suganthan,et al. Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.
[40] Jenny Fajardo Calderín,et al. Algorithm portfolio based scheme for dynamic optimization problems , 2015, Int. J. Comput. Intell. Syst..
[41] Alexander Zipf,et al. Routing through open spaces – A performance comparison of algorithms , 2018, Geo spatial Inf. Sci..
[42] Wei Wang,et al. Robust optimization for volume variation in timber processing , 2017, Journal of Forestry Research.
[43] Mustafa Servet Kiran,et al. The continuous artificial bee colony algorithm for binary optimization , 2015, Appl. Soft Comput..
[44] Mohammad Abdulrahman Al-Fawzan,et al. A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..
[45] Ching-Jong Liao,et al. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..
[46] Ashwin Arulselvan,et al. A note on the set union knapsack problem , 2014, Discret. Appl. Math..
[47] Reza Tavakkoli-Moghaddam,et al. A Self-Learning Particle Swarm Optimization for Robust Multi-Echelon Capacitated Location–Allocation–Inventory Problem , 2019, Journal of Advanced Manufacturing Systems.
[48] Bin Jiao,et al. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..
[49] Kaj Holmberg,et al. Exact solution methods for uncapacitated location problems with convex transportation costs , 1999, Eur. J. Oper. Res..
[50] Xin-She Yang,et al. A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.