Grouping evolution strategies: an effective approach for grouping problems
DOI10.1016/j.apm.2014.11.001zbMath1443.90242OpenAlexW1980058421MaRDI QIDQ2009978
Ali Husseinzadeh Kashan, Ali Akbari, Bakhtiar Ostadi
Publication date: 3 December 2019
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2014.11.001
grouping genetic algorithmgrouping problemsbin-packing problembatch-processing machine scheduling problemgrouping evolution strategiesgrouping particle swarm optimization
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- A new metaheuristic for optimization: optics inspired optimization (OIO)
- A particle swarm optimizer for grouping problems
- A hybrid grouping genetic algorithm for the cell formation problem
- Lower bounds and reduction procedures for the bin packing problem
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Evolution strategies. A comprehensive introduction
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- A comparison of evolution strategies with other direct search methods in the presence of noise
- Scheduling a single batch processing machine with non-identical job sizes
- CF-GGA: A grouping genetic algorithm for the cell formation problem
- Minimising material handling cost in cell formation with alternative processing routes by grouping genetic algorithm
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
This page was built for publication: Grouping evolution strategies: an effective approach for grouping problems