An effective genetic algorithm approach to large scale mixed integer programming problems
DOI10.1016/J.AMC.2005.05.017zbMATH Open1090.65070OpenAlexW2017220060MaRDI QIDQ2489337FDOQ2489337
Authors: Zhong-Sheng Hua, Feihua Huang 
Publication date: 16 May 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.017
Recommendations
- A variable-grouping based genetic algorithm for large-scale integer programming
- Genetic Programming
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- scientific article; zbMATH DE number 970353
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
numerical experimentsgenetic algorithmmixed integer programmingoptimization algorithmlarge scale problemssearch spacestructure propertyvariable grouping
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genetic algorithms and traveling salesman problems
- An effective genetic algorithm approach to multiobjective routing problems (MORPs)
- A multiperiod two-echelon multicommodity capacitated plant location problem
- A variable-grouping based genetic algorithm for large-scale integer programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
- A solution to the optimal power flow using genetic algorithm
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
- Aggregate line capacity design for PWB assembly systems
- Title not available (Why is that?)
- Genetic algorithms with double strings for 0-1 programming problems
- Exact solution procedures for certain planning problems in flexible manufacturing systems
Cited In (14)
- A comparison of genetic and conventional methods for the solution of integer goal programmes
- A variable-grouping based genetic algorithm for large-scale integer programming
- Optimizing the multiple constrained resources product mix problem using genetic algorithms
- Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
- A new genetic algorithm for solving nonconvex nonlinear programming problems
- Domain reduction using GRASP construction phase for transmission expansion planning problem
- Genetic Programming
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Genetic algorithms for solving mixed-discrete optimization problems
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- A multi-objective production smoothing model with compressible operating times
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
- Stochastic level-value approximation for quadratic integer convex programming
This page was built for publication: An effective genetic algorithm approach to large scale mixed integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489337)
