Genetic algorithms with double strings for 0-1 programming problems
From MaRDI portal
Publication:1869411
DOI10.1016/S0377-2217(02)00149-2zbMath1012.90033MaRDI QIDQ1869411
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
genetic algorithmsreference solutions0-1 programming problemsdouble stringsreference solution updating
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (9)
A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms ⋮ Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm ⋮ An effective genetic algorithm approach to large scale mixed integer programming problems ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ A variable-grouping based genetic algorithm for large-scale integer programming ⋮ A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem ⋮ Allocation of advertising space by a web service provider using combinatorial auctions
Uses Software
Cites Work
- Fuzzy programming for multiobjective 0-1 programming problems through revised genetic algorithms
- An interactive fuzzy satisfying method for multiobjective 0-1 programming problems with fuzzy numbers through genetic algorithms with double strings
- A tree-search algorithm for mixed integer programming problems
- Decision-Making in a Fuzzy Environment
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Genetic algorithms with double strings for 0-1 programming problems
