Výsledky vyhledávání - Branch AND bound Knapsack problem Multiobjective Evolutionary algorithms

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

Autoři: Florios, Kostas Mavrotas, George Diakoulaki, Danae

Zdroj: European Journal of Operational Research. May2010, Vol. 203 Issue 1, p14-21. 8p.

Témata: *ALGORITHMS, *MATHEMATICAL programming, *HEURISTIC, *OPERATIONS research, KNAPSACK problems, EVOLUTIONARY computation, BRANCH & bound algorithms, METRIC system

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

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

Computationally efficient evolutionary optimisation for joint reservoir design-operations.

Autoři: Motevali Bashi Naeini, Elaheh Soltaninia, Shahrokh

Zdroj: Proceedings of ICE: Water Management; Jun2023, Vol. 176 Issue 3, p132-147, 16p

Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ɛ -dominance.

Autoři: Grosan, C.

Zdroj: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753); 2004, p1958-1958, 1p

Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem.

Autoři: Mahrach, Mohammed Miranda, Gara León, Coromoto a další

Zdroj: Mathematics (2227-7390); Nov2020, Vol. 8 Issue 11, p2018-2018, 1p

Témata: TRAVELING salesman problem, KNAPSACK problems, PROBLEM solving, EVOLUTIONARY algorithms, EVOLUTIONARY computation

An exploratory research of elitist probability schema and its applications in evolutionary algorithms.

Autoři: Zhang, Hong-Guang Liu, Yuan-An Tang, Bi-Hua a další

Zdroj: Applied Intelligence; Jun2014, Vol. 40 Issue 4, p695-709, 15p

Témata: COMBINATORIAL optimization, GENETIC algorithms, GENETIC programming, PARTICLE swarm optimization, SWARM intelligence

Players’ selection for basketball teams, through Performance Index Rating, using multiobjective evolutionary algorithms.

Autoři: Pérez-Toledano, Miguel Ángel Rodriguez, Francisco J. García-Rubio, Javier a další

Zdroj: PLoS ONE; 9/4/2019, Vol. 14 Issue 9, p1-20, 20p

Témata: EVOLUTIONARY algorithms, BASKETBALL teams, SPORTS competitions, SPORTS administration, BIOLOGICAL evolution, DIFFERENTIAL evolution

Geografický termín: SPAIN

Korporace: EUROPEAN Union

Multiobjective Optimization and Evolutionary Algorithms for the Application Mapping Problem in Multiprocessor System-on-Chip Design.

Autoři: Erbas, Cagkan Cerav-Erbas, Selin Pimentel, Andy D.

Zdroj: IEEE Transactions on Evolutionary Computation; Jun2006, Vol. 10 Issue 3, p358-374, 17p, 3 Diagrams, 4 Charts, 11 Graphs

Témata: COMPUTER software, EMBEDDED computer systems, INTEGER programming, CASE studies, MATHEMATICAL mappings, INHOMOGENEOUS materials

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

Autoři: Florios, Kostas Mavrotas, George Diakoulaki, Danae

Relation: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00497-4

Dostupnost: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00497-4

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

Considerations in Engineering Parallel Multiobjective Evolutionary Algorithms.

Autoři: Van Veldhuizen, David A. Zydallis, Jesse B. Lamont, Gary B.

Zdroj: IEEE Transactions on Evolutionary Computation; Apr2003, Vol. 7 Issue 2, p144, 30p

Témata: ALGORITHMS, RESEARCH, SYMMETRIC domains, MATHEMATICAL notation

QUANTUMIZED GENETIC ALGORITHM FOR SEGMENTATION AND OPTIMIZATION TASKS.

Autoři: Sabeti, Malihe Karimi, Laleh Honarvar, Naemeh a další

Zdroj: Biomedical Engineering: Applications, Basis & Communications; Jun2020, Vol. 32 Issue 03, pN.PAG-N.PAG, 11p

Témata: IMAGE segmentation, GENETIC algorithms, PARTICLE swarm optimization, MATHEMATICAL optimization, THRESHOLDING algorithms, COMPUTER vision

Concrete hyperheuristic framework for test case prioritization.

Autoři: Bian, Yi Li, Zheng Guo, Junxia a další

Zdroj: Journal of Software: Evolution & Process; Nov2018, Vol. 30 Issue 11, pN.PAG-N.PAG, 1p

Témata: REGRESSION testing (Computer science), ITERATIVE methods (Mathematics), EVOLUTIONARY algorithms, LEARNING strategies, HEURISTIC

Scheduling multi-configuration last-mile delivery logistics by learning from optimisation feedback and customer preferences.

Autoři: Tafakkori, Keivan Tavakkoli-Moghaddam, Reza Siadat, Ali

Zdroj: International Journal of Production Research; Nov2025, Vol. 63 Issue 21, p7835-7864, 30p

Témata: LOGISTICS, SCHEDULING, DELIVERY of goods, PREDICTION models, OPERATIONS research, CONSUMER preferences, EVOLUTIONARY algorithms

Parallel implementation of an exact two-phase method for the biobjective knapsack problem.

Autoři: Chaabane, Khadidja Bouroubi, Sadek Djellouli, Younes

Zdroj: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 4, p3347-3367, 21p

Témata: COMBINATORIAL optimization, PARALLEL programming, TEST methods, ALGORITHMS, KNAPSACK problems, LITERATURE

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

Reinforcement Learning for Solving the Knapsack Problem.

Autoři: Zhang, Zhenfu Yin, Haiyan Zuo, Liudong a další

Zdroj: Computers, Materials & Continua; 2025, Vol. 84 Issue 1, p919-936, 18p

Témata: REINFORCEMENT learning, TIME complexity, DYNAMIC programming, COMBINATORIAL optimization, PROBLEM solving, KNAPSACK problems

Augmenting bi-objective branch and bound by scalarization-based information.

Autoři: Bauß, Julius Stiglmayr, Michael

Zdroj: Mathematical Methods of Operations Research; Aug2024, Vol. 100 Issue 1, p85-121, 37p

Témata: BRANCH & bound algorithms, INTEGER programming, INTEGERS

Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.

Autoři: Aïder, Méziane Gacem, Oussama Hifi, Mhand

Zdroj: Neural Computing & Applications; Jan2023, Vol. 35 Issue 2, p1183-1209, 27p

Témata: KNAPSACK problems, LEARNING strategies, COMBINATORIAL optimization, BACKPACKS, GENETIC algorithms