최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Journal of information processing systems, v.18 no.5, 2022년, pp.665 - 676
Zhang, Yan (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications) , Wu, Tengyu (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications) , Ding, Xiaoyue (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications)
In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization met...
J. H. Drake, M. Hyde, K. Ibrahim, and E. Ozcan, "A genetic programming hyper-heuristic for the multidimensional knapsack problem," Kybernetes, vol. 43, no. 9/10, pp. 1500-1511, 2014.
Z. Beheshti, S. M. Shamsuddin, and S. Hasan, "Memetic binary particle swarm optimization for discrete optimization problems," Information Sciences, vol. 299, pp. 58-84, 2015.
F. Glover, "Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems," European Journal of Operational Research, vol. 230, no. 2, pp. 212-225, 2013.
I. B. Mansour and I. Alaya, "Indicator based ant colony optimization for multi-objective knapsack problem," Procedia Computer Science, vol. 60, pp. 448-457, 2015.
S. C. Leung, D. Zhang, C. Zhou, and T. Wu, "A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem," Computers & Operations Research, vol. 39, no. 1, pp. 64-73, 2012.
B. Haddar, M. Khemakhem, H. Rhimi, and H. Chabchoub, "A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem," Natural Computing, vol. 15, no. 1, pp. 153-164, 2016.
C. Sachdeva and S. Goel, "An improved approach for solving 0/1 knapsack problem in polynomial time using genetic algorithms," in Proceedings of International Conference on Recent Advances and Innovations in Engineering (ICRAIE), Jaipur, India, 2014, pp. 1-4.
R. Merkle and M. Hellman, "Hiding information and signatures in trapdoor knapsacks," IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 525-530, 1978.
Y. Li, Y. He, H. Li, X. Guo, and Z. Li, "A binary particle swarm optimization for solving the bounded knapsack problem," in Computational Intelligence and Intelligent Systems. Singapore: Springer, 2018, pp. 50-60.
Y. He, H. Xie, T. L. Wong, and X. Wang, "A novel binary artificial bee colony algorithm for the set-union knapsack problem," Future Generation Computer Systems, vol. 78, pp. 77-86, 2018.
Y. Zhang, X. Y. Wu, and O. K. Kwon, "Research on Kruskal crossover genetic algorithm for multi-objective logistics distribution path optimization," International Journal of Multimedia and Ubiquitous Engineering, vol. 10, no. 8, pp. 367-378, 2015.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
오픈액세스 학술지에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.