Three pseudo-utility ratio-inspired particle swarm optimization with local search for multidimensional knapsack problem
暂无分享,去创建一个
[1] 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..
[2] Suash Deb,et al. Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization , 2017, Neural Computing and Applications.
[3] Steven Li,et al. Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm , 2015, Comput. Oper. Res..
[4] Gai-Ge Wang,et al. An Improved Hybrid Encoding Firefly Algorithm for Randomized Time-Varying Knapsack Problems , 2015, 2015 Second International Conference on Soft Computing and Machine Intelligence (ISCMI).
[5] Qinghua Hu,et al. Discrete particle swarm optimization approach for cost sensitive attribute reduction , 2016, Knowl. Based Syst..
[6] Wei Shih,et al. A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .
[7] Bijaya K. Panigrahi,et al. A hybridization of an improved particle swarm optimization and gravitational search algorithm for multi-robot path planning , 2016, Swarm Evol. Comput..
[8] Weidong Chen,et al. Hybrid algorithm for the two-dimensional rectangular layer-packing problem , 2014, J. Oper. Res. Soc..
[9] Michel Vasquez,et al. Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..
[10] H. Martin Weingartner,et al. Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem , 2015 .
[11] Athanasios Migdalas,et al. A hybrid Particle Swarm Optimization - Variable Neighborhood Search algorithm for Constrained Shortest Path problems , 2017, Eur. J. Oper. Res..
[12] S. Senju,et al. An Approach to Linear Programming with 0--1 Variables , 1968 .
[13] Gaige Wang,et al. A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems , 2016, Int. J. Comput. Intell. Syst..
[14] Ali Azadeh,et al. A hybrid meta-heuristic algorithm for optimization of crew scheduling , 2013, Appl. Soft Comput..
[15] Arnaud Fréville,et al. The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..
[16] Genichi Taguchi. System Of Experimental Design: Engineering Methods To Optimize Quality And Minimize Costs , 1987 .
[17] Wei-Chang Yeh,et al. A Particle Swarm Optimization Approach Based on Monte Carlo Simulation for Solving the Complex Network Reliability Problem , 2010, IEEE Transactions on Reliability.
[18] Leslie E. Trotter,et al. When the Greedy Solution Solves a Class of Knapsack Problems , 1975, Oper. Res..
[19] Siti Mariyam Hj. Shamsuddin,et al. Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems , 2012, Journal of Global Optimization.
[20] A. Gandomi,et al. A novel improved accelerated particle swarm optimization algorithm for global numerical optimization , 2014 .
[21] Adel M. Alimi,et al. PSO-based analysis of Echo State Network parameters for time series forecasting , 2017, Appl. Soft Comput..
[22] R. Eberhart,et al. Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[23] Maw-Sheng Chern,et al. A binary particle swarm optimization based on the surrogate information with proportional acceleration coefficients for the 0-1 multidimensional knapsack problem , 2016 .
[24] Mingchang Chih,et al. Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem , 2015, Appl. Soft Comput..
[25] Mingchang Chih,et al. Particle swarm optimization for the economic and economic statistical designs of the X control chart , 2011, Appl. Soft Comput..
[26] Kusum Deep,et al. A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..
[27] Min Kong,et al. A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..
[28] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[29] Moncef Gabbouj,et al. Particle swarm clustering fitness evaluation with computational centroids , 2017, Swarm Evol. Comput..
[30] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[31] Wenbin Li,et al. Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem , 2017, Neural Computing and Applications.
[32] Saïd Hanafi,et al. A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem , 2016, Eng. Appl. Artif. Intell..
[33] Farid Nouioua,et al. Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems , 2016, Soft Comput..
[34] Mohammad J. Tarokh,et al. New mathematical model for the bi-objective inventory routing problem with a step cost function: A multi-objective particle swarm optimization solution approach , 2017 .
[35] Saman K. Halgamuge,et al. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.
[36] Maw-Sheng Chern,et al. Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem , 2014 .
[37] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[38] Hasan Pirkul,et al. A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .
[39] Russell C. Eberhart,et al. A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.
[40] Lei Fang,et al. A Quantum-Inspired Artificial Immune System for Multiobjective 0-1 Knapsack Problems , 2010, ISNN.
[41] Andreas Drexl,et al. A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.