A hybrid genetic algorithm for solving 0/1 Knapsack Problem-Reference-Cited by-同舟云学术

A hybrid genetic algorithm for solving 0/1 Knapsack Problem

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications - LOPAL '18
language:
Short-container-title:

Author:

Soukaina Laabadi¹,Mohamed Naimi²,Hassan El Amri¹,Boujemâa Achchab²

Affiliation:

1. ENS- Hassan II University, Laboratory of Mathematics and Applications, Casablanca, Morocco

2. EST- Hassan I University, Laboratory of Analysis, Modeling Systems and Decision Support, Berrechid, Morocco

Publisher

ACM Press

Reference25 articles.

1. J. H. Lorie and L. J. Savage. 1955. Three problems in rationing capital. In the Journal of Business, Vol. 28, 229--239.

2. S. Eilon and N. Christofides. 1971. The loading problem. In Management Science, Vol. 17, 259--268.

3. F. Chen, T. La Porta, and M. B. Srivastava. 2012. Resource Allocation with Stochastic Demands. In proceeding of 8th IEEE International Conference on Distributed Computing in Sensor Systems.

4. J. Pfeiffer and F. Rothlauf. 2007. Analysis of Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions. In Proceedings of the 9th annual conference on Genetic and evolutionary computation. DOI: http://dx.doi.org/10.1145/1276958.1277258

5. H. C. Lau and M. K. Lim. 2004. Multi-Period Multi-Dimensional Knapsack Problem and Its Application to Available-to-Promise. In International Symposium on Scheduling (ISS), 94--99.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Discrete Fireworks Algorithm for Large Scale Knapsack Problem;2024 IEEE Congress on Evolutionary Computation (CEC);2024-06-30

2. A Clustering Based Niching Method for Effectively Solving the 0-1 Knapsack Problem;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023

3. On the adoption of Metaheuristics for Solving 0–1 Knapsack Problems;2021 12th International Symposium on Parallel Architectures, Algorithms and Programming (PAAP);2021-12-10

4. Solving binary multi-objective knapsack problems with novel greedy strategy;Memetic Computing;2021-08-21

5. Multi-objective database queries in combined knapsack and set covering problem domains;Journal of Big Data;2021-03-10