Výsledky vyhledávání - branch AND bound knapsack problem multiobjective evolution algorithms*

Improvement of genetic algorithms with decomposition procedures for large-scale multiobjective multidimensional 0-1 knapsack problems incorporating fuzzy goals.

Autoři: Kato, Kosuke Sakawa, Masatoshi Ikegame, Toshinori

Zdroj: Electronics & Communications in Japan, Part 3: Fundamental Electronic Science; Dec2000, Vol. 83 Issue 12, p62-69, 8p

Témata: KNAPSACK problems, INTEGER programming, BRANCH & bound algorithms, MATHEMATICAL programming, GENETIC algorithms

A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem.

Autoři: Zheng, Fuyuan Cheng, Kanglong Yang, Kai a další

Zdroj: Algorithms; May2025, Vol. 18 Issue 5, p295, 31p

Témata: SEARCH algorithms, RANDOM operators, KNAPSACK problems, ALGORITHMS, BACKPACKS, HEURISTIC

An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis.

Autoři: Abdel-Basset, Mohamed Mohamed, Reda Sallam, Karam M. a další

Zdroj: Journal of Big Data; 1/28/2025, Vol. 12 Issue 1, p1-56, 56p

Témata: GENETIC algorithms, NP-hard problems, TRANSFER functions, RESEARCH personnel, WASPS, KNAPSACK problems

TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems.

Autoři: Kang, Yan Wang, Haining Pu, Bin a další

Zdroj: Neural Computing & Applications; Jun2023, Vol. 35 Issue 17, p12691-12713, 23p

Témata: KNAPSACK problems, GREEDY algorithms, DIFFERENTIAL operators, ALGORITHMS, METAHEURISTIC algorithms, DIFFERENTIAL evolution, NP-hard problems

On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques.

Autoři: Gallardo, José E. Cotta, Carlos Fernández, Antonio J.

Zdroj: IEEE Transactions on Systems, Man & Cybernetics: Part B; Feb2007, Vol. 37 Issue 1, p77-83, 7p

Témata: COMBINATORIAL optimization, ALGORITHMS, MEMETICS, HEURISTIC, KNAPSACK problems, COMPUTATIONAL complexity

Developing a New Approach for Assessing and Improving Business Excellence: Integrating Fuzzy Analytic Hierarchical Process and Constraint Programming Model.

Autoři: Petrović, Tijana Tadić, Danijela Marinković, Dragan a další

Zdroj: Symmetry (20738994); Apr2025, Vol. 17 Issue 4, p607, 22p

Témata: ANALYTIC hierarchy process, CONSTRAINT programming, FUZZY numbers, ORGANIZATIONAL performance, RESOURCE allocation, KNAPSACK problems

An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem.

Autoři: Etminaniesfahani, Alireza Gu, Hanyu Naeni, Leila Moslemi a další

Zdroj: Annals of Operations Research; Jul2024, Vol. 338 Issue 1, p41-68, 28p

Témata: MATHEMATICAL programming, KNAPSACK problems, NP-hard problems, SCHEDULING, CONSTRAINT programming

Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.

Autoři: Olivas, Frumen Amaya, Ivan Ortiz-Bayliss, José Carlos a další

Zdroj: Computational Intelligence & Neuroscience; 1/25/2021, p1-17, 17p

Témata: FUZZY logic, PARTICLE swarm optimization, KNAPSACK problems, BACKPACKS, FUZZY numbers, FUZZY systems, DYNAMIC programming

On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.

Autoři: Cerqueus, Audrey Gandibleux, Xavier Przybylski, Anthony a další

Zdroj: Journal of Heuristics; Oct2017, Vol. 23 Issue 5, p285-319, 35p

Témata: HEURISTIC, BACKPACKS, LEARNING, POLYNOMIALS, ALGORITHMS

Compressed representation for higher-level meme space evolution: a case study on big knapsack problems.

Autoři: Feng, Liang Gupta, Abhishek Ong, Yew-Soon

Zdroj: Memetic Computing; Mar2019, Vol. 11 Issue 1, p3-17, 15p

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects.

Autoři: Fréville, Arnaud Hanafi, SaÏd

Zdroj: Annals of Operations Research; Oct2005, Vol. 139 Issue 1-4, p195-227, 33p

Témata: COMPUTER software development, KNAPSACK problems, HEURISTIC programming, ARTIFICIAL intelligence, MULTIDISCIPLINARY design optimization, INTEGER programming, GENETIC algorithms, COMPUTER arithmetic

A scatter search method for the multidimensional knapsack problem with generalized upper bound constraints.

Alternate Title: 以散佈搜尋法求解附有一般上限限制式之多維背包問題: 李際偉 國立嘉義大學企業管理學系 60054 嘉義市新民路 580 號 梁韵嘉* 元智大學工業工程與管理學系 32003 桃園縣中壢市遠東路 135 號 孫淯晏 國立東華大學資訊工程學系 97401 花蓮縣壽豐鄉志學村大學路二段一號 陳佑善 國立東華大學運籌管理研究所 97401 花蓮縣壽豐鄉志學村大學路二段一號 (Chinese)

Autoři: Li, VincentC. Liang, Yun-Chia Sun, Yu-Yen a další

Zdroj: Journal of the Chinese Institute of Industrial Engineers; Dec2012, Vol. 29 Issue 8, p559-571, 13p, 1 Diagram, 5 Charts

Témata: KNAPSACK problems, HEURISTIC, MULTIDIMENSIONAL databases, GREEDY algorithms, SEARCH algorithms, ELECTRONIC information resource searching

Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach.

Autoři: Zitzler, Eckart Thiele, Lothar

Zdroj: IEEE Transactions on Evolutionary Computation; Nov1999, Vol. 3 Issue 4, p257, 15p

Témata: ALGORITHMS, KNAPSACK problems, CLUSTER analysis (Statistics), SYSTEMS software, MATHEMATICAL optimization

An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization.

Autoři: Phelps, Selcen Köksalan Jr., Murat

Zdroj: Management Science; Dec2003, Vol. 49 Issue 12, p1726-1738, 13p, 6 Charts

Témata: MULTIPLE criteria decision making, COMBINATORICS, KNAPSACK problems, MEMORY, DECISION making, ALGORITHMS

The multiobjective multidimensional knapsack problem: a survey and a new approach.

Autoři: Lust, Thibaut Teghem, Jacques

Zdroj: International Transactions in Operational Research; Jul2012, Vol. 19 Issue 4, p495-520, 26p, 4 Charts, 4 Graphs

Témata: KNAPSACK problems, COMBINATORIAL optimization, MATHEMATICAL optimization, INTEGER programming, MATHEMATICAL analysis

A PARTHENO-GENETIC ALGORITHM FOR DYNAMIC 0-1 MULTIDIMENSIONAL KNAPSACK PROBLEM.

Autoři: ALI NADI ÜNAL KAYAKUTLU, GÜLGÜN

Zdroj: RAIRO -- Operations Research; Jan2016, Vol. 50 Issue 1, p47-66, 20p

Témata: GENETIC algorithms, KNAPSACK problems, NP-hard problems, COMBINATORIAL optimization, METAHEURISTIC algorithms, PROBLEM solving

Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study.

Autoři: Behmanesh, Reza Rahimi, Iman Gandomi, Amir H.

Zdroj: Archives of Computational Methods in Engineering; 2021, Vol. 28 Issue 2, p673-688, 16p

A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem.

Autoři: Claro, João de Sousa, Jorge Pinho

Zdroj: Computational Optimization & Applications; Jul2010, Vol. 46 Issue 3, p427-450, 24p, 3 Diagrams, 8 Charts, 2 Graphs

Témata: STOCHASTIC analysis, MATHEMATICAL optimization, DISCRETE groups, KNAPSACK problems, INTEGER programming

An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem.

Autoři: Abdollahzadeh, Benyamin Barshandeh, Saeid Javadi, Hatef a další

Zdroj: Engineering with Computers; Oct2022 Suppl 4, Vol. 38, p3423-3444, 22p

An efficient population-based simulated annealing algorithm for 0–1 knapsack problem.

Autoři: Moradi, Nima Kayvanfar, Vahid Rafiee, Majid

Zdroj: Engineering with Computers; Jun2022, Vol. 38 Issue 3, p2771-2790, 20p