Putting continuous metaheuristics to work in binary search spaces
From MaRDI portal
Publication:2012877
DOI10.1155/2017/8404231zbMATH Open1367.90122OpenAlexW2612309817WikidataQ57782094 ScholiaQ57782094MaRDI QIDQ2012877FDOQ2012877
Publication date: 3 August 2017
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/8404231
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- BGSA: Binary gravitational search algorithm
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A Note on the Generation of Random Normal Deviates
- Title not available (Why is that?)
- Ant colony optimization for continuous domains
- GSA: A gravitational search algorithm
- Metaheuristics. From design to implementation.
- Title not available (Why is that?)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Dynamical and spatial disorder in an intermittent search process
- A typology of cutting and packing problems
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Metaheuristics: A bibliography
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
- Title not available (Why is that?)
- Combinatorial optimization. Networks and matroids
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Title not available (Why is that?)
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- Application of the firefly algorithm for solving the economic emissions load dispatch problem
- Title not available (Why is that?)
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- Introduction to evolutionary computing
- Differential Evolution for Binary Encoding
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
Cited In (5)
- Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space
- Binary peacock algorithm: a novel metaheuristic approach for feature selection
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Binarization of the swallow swarm optimization for feature selection
- A binary monkey search algorithm variation for solving the set covering problem
Uses Software
This page was built for publication: Putting continuous metaheuristics to work in binary search spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012877)
