A particle swarm optimizer for grouping problems
DOI10.1016/j.ins.2012.10.036zbMath1320.68170OpenAlexW2019855372MaRDI QIDQ497654
Mina Husseinzadeh Kashan, Somayyeh Karimiyan, Ali Husseinzadeh Kashan
Publication date: 24 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.10.036
bin packing problemgrouping genetic algorithmparticle swarm optimizationgrouping problemsbatch-machine scheduling problem
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- A hybrid grouping genetic algorithm for the cell formation problem
- Lower bounds and reduction procedures for the bin packing problem
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Hybrid evolutionary algorithms for graph coloring
- A study of particle swarm optimization particle trajectories
- On Approximation Methods for the Assignment Problem
- 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: A particle swarm optimizer for grouping problems