A variable-grouping based genetic algorithm for large-scale integer programming

DOI10.1016/j.ins.2005.04.009zbMath1098.90041MaRDI QIDQ2509223

Zhongsheng Hua, Feihua Huang

Publication date: 19 October 2006

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2005.04.009

zbMATH Keywords

genetic algorithms; search space; large-scale integer programming; variable-grouping

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures, A unified method for a class of convex separable nonlinear knapsack problems, An effective genetic algorithm approach to large scale mixed integer programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling of design projects with uncertain number of iterations
• Genetic algorithms and traveling salesman problems
• A note on reducing the number of variables in integer programming problems
• The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
• An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
• An evolutionary heuristic for quadratic 0-1 programming
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Genetic algorithms with double strings for 0-1 programming problems
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Aggregate line capacity design for PWB assembly systems
• Bimatrix Equilibrium Points and Mathematical Programming