An effective genetic algorithm approach to large scale mixed integer programming problems
DOI10.1016/j.amc.2005.05.017zbMath1090.65070OpenAlexW2017220060MaRDI QIDQ2489337
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
numerical experimentsmixed integer programminggenetic algorithmlarge scale problemsoptimization algorithmsearch spacestructure propertyvariable grouping
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Stochastic programming (90C15)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic algorithms and traveling salesman problems
- Exact solution procedures for certain planning problems in flexible manufacturing systems
- A multiperiod two-echelon multicommodity capacitated plant location problem
- 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 effective genetic algorithm approach to multiobjective routing problems (MORPs)
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Genetic algorithms with double strings for 0-1 programming problems
- A solution to the optimal power flow using genetic algorithm
- A variable-grouping based genetic algorithm for large-scale integer programming
- Aggregate line capacity design for PWB assembly systems
This page was built for publication: An effective genetic algorithm approach to large scale mixed integer programming problems