Intelligent water drops algorithm
From MaRDI portal
Publication:3526263
DOI10.1108/17563780810874717zbMath1163.90719OpenAlexW1602816180MaRDI QIDQ3526263
Publication date: 25 September 2008
Published in: International Journal of Intelligent Computing and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/17563780810874717
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Random orthocenter strategy in interior search algorithm and its engineering application ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Smart dispatching and metaheuristic swarm flow algorithm ⋮ Nature inspired meta heuristic algorithms for optimization problems
Cites Work
- Optimization by Simulated Annealing
- A probabilistic heuristic for a computationally difficult set covering problem
- A genetic algorithm for the multidimensional knapsack problem
- Variable neighborhood search
- The multidimensional 0-1 knapsack problem: an overview.
- Improved results on the 0--1 multidimensional knapsack problem
- Greedy randomized adaptive search procedures
- An electromagnetism-like mechanism for global optimization
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Tabu Search—Part I
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- The Theory and Computation of Knapsack Functions
This page was built for publication: Intelligent water drops algorithm